Case Study 2: Reading a Quantum Announcement

"Extraordinary claims require ordinary evidence, presented in the ordinary way, by people willing to say what would have falsified them."

Executive Summary

Sooner than you expect, someone will forward you a quantum computing announcement and ask what you think. It might be a competitor's press release, a vendor's pitch, a news article your director read, or a preprint a colleague found. You will be the quantum person in the room, and your answer will carry weight you have not yet earned.

This case study builds the skill for that moment. We take a composite announcement — assembled from the rhetorical patterns that recur across real quantum computing publicity, but describing no specific company or result — and take it apart line by line using the five-question method from §1.5. Then we do the harder and more useful thing: we ask what a good version of the same announcement would look like, because the goal is not reflexive cynicism. Real progress is happening and dismissing all of it is as much an error as believing all of it.

Skills applied: the five-question test (§1.5); current hardware capabilities and their limits (§1.5); the qubit-count-versus-error-rate distinction (§1.5); the exponential wall and what it implies about classical baselines (§1.4).

A note on the source. The announcement below is constructed for this book. It is not a quotation from any real company, and no real product or result should be read into it. Every sentence in it, however, follows a pattern that appears repeatedly in genuine quantum computing communications, which is why it is useful as a training exercise.

The Announcement

QuantumScale Announces Breakthrough in Practical Quantum Advantage

QuantumScale today announced that its 512-qubit Meridian processor has successfully solved a real-world supply chain optimization problem, demonstrating quantum advantage for a commercially relevant application for the first time.

Working with a Fortune 500 logistics partner, QuantumScale researchers encoded a vehicle routing problem across 340 qubits and obtained a solution in 4.2 seconds. The company reports that the quantum approach found routes 11% more efficient than the partner's existing system.

"This is the moment the industry has been waiting for," said the company's Chief Quantum Officer. "We have moved decisively from laboratory curiosity to production capability."

The Meridian processor's 512 qubits make it among the most powerful quantum computers in the world. QuantumScale expects to reach 2,048 qubits within eighteen months and anticipates that quantum computing will disrupt logistics, finance, and pharmaceutical research within five years.

The company also noted that its quantum-safe roadmap positions clients ahead of the post-quantum cryptography transition.

Read it once more before continuing, and notice how reasonable it sounds. Nothing in it is an obvious falsehood. That is what makes this a useful exercise: the problems are not lies but omissions, and omissions are much harder to see.

Question 1: What exactly was computed, and was the answer already known?

What the announcement says: "a vehicle routing problem," "encoded across 340 qubits."

What it does not say: the problem's size, its structure, or its actual difficulty.

This is the largest gap. "Vehicle routing problem" describes a family spanning from instances a human solves on a napkin to instances that defeat every known method. Without the number of stops, the number of vehicles, the constraint structure, and the objective, "a vehicle routing problem" carries essentially no information.

The qubit count offers a clue, and it is not a favorable one. Encoding a routing problem into qubits typically requires a number of qubits that grows with the square of the problem size — one binary variable per (location, position) pair in the simplest formulations. Three hundred and forty qubits is therefore consistent with a problem involving roughly eighteen locations, which is a size that classical solvers handle exactly, in milliseconds, and have for decades.

Was the answer already known? The announcement does not say, which almost always means yes. Nearly every quantum demonstration verifies against a classical solution, because otherwise you cannot tell whether your quantum result is correct. That is good practice. It also means the quantum computer did not discover anything.

The follow-up to ask: "How many locations and vehicles, with what constraints? Was the optimal solution known in advance by classical means?"

Question 2: What is the classical baseline, and who ran it?

What the announcement says: "11% more efficient than the partner's existing system."

This is the sentence that should stop you, and it is worth understanding exactly why, because the pattern is extremely common and quite subtle.

The comparison is against the partner's existing system — not against the best classical algorithm for the problem. Those are radically different baselines. A logistics company's production routing system is a compromise among optimality, runtime, integration constraints, business rules, maintainability, and the year it was written. It is frequently a heuristic that has not been revised in a decade. Beating it by 11% may well be an achievement of the problem formulation — someone sat down and wrote a clean objective function, possibly for the first time — rather than of the quantum hardware.

The controlled comparison would run the identical formulation through a strong classical solver: a modern branch-and-cut solver, or simulated annealing, or a good tabu search, on comparable hardware. This is a standard and inexpensive experiment. Its absence from the announcement is informative.

There is precedent for why this matters. Several prominent quantum advantage claims over the past decade have been substantially narrowed or eliminated within months by improved classical algorithms — the announcement prompts someone to try harder classically, and the harder classical attempt succeeds. This is a healthy scientific dynamic and it is also a warning: an advantage claim that has not survived a serious classical counterattack is provisional.

The follow-up to ask: "What does a modern classical solver produce on the same formulation, given the same 4.2 seconds? Who ran that comparison, and can we see it?"

Question 3: How many qubits, and were they error-corrected?

What the announcement says: "512 qubits," "among the most powerful quantum computers in the world."

Qubit count is the field's most cited and least informative metric. A processor with 512 noisy physical qubits and a 1% two-qubit error rate is less computationally useful than one with 100 qubits at 0.1%, because circuit depth — not width — is usually the binding constraint. The announcement gives no error rates, no coherence times, no gate fidelities, and no circuit depth for the reported computation.

"Among the most powerful in the world" is doing rhetorical work without carrying meaning. There is no agreed metric that ranks quantum computers, which is precisely why Chapter 30 exists — Quantum Volume, CLOPS, layer fidelity, and error-per-layered-gate were all invented because qubit count is not a ranking.

Nothing suggests error correction, so these are physical qubits. That is expected for current hardware and it should be stated, because the distinction between 512 physical qubits and 512 logical qubits is roughly a factor of a thousand in hardware.

The follow-up to ask: "What are the two-qubit gate error rate, the coherence times, and the depth of the circuit that produced this result? What is the Quantum Volume?"

Question 4: Was the result reproducible by someone outside the company?

What the announcement says: nothing.

There is no paper, no preprint, no code, no data, no independent verification, and no named partner. The result exists only in the announcement.

This is not automatically damning — commercial partnerships have real confidentiality constraints, and a company is entitled to announce before publishing. But it does establish where the claim sits on the evidentiary scale, and the honest position is that an unreproducible claim from an interested party is a hypothesis, not a finding.

The follow-up to ask: "Is there a preprint or a paper? Is the problem instance available? Would you run our formulation on your hardware and let us run the classical comparison?"

That last offer is the one that separates real results from marketing, and it is remarkable how often it is declined.

Question 5: Is the claim about today or about a roadmap?

What the announcement says: "2,048 qubits within eighteen months," "will disrupt logistics, finance, and pharmaceutical research within five years."

The first is a roadmap statement and it is legitimate. Hardware roadmaps are published, they are useful, and companies are broadly held to them. Read as a roadmap, "2,048 qubits in eighteen months" is a normal engineering projection.

The second is not a roadmap. "Will disrupt three industries within five years" is a prediction about algorithms, error correction, and economics — none of which follow from a qubit count. This sentence would need, at minimum: which specific problem in each industry, at what problem size, requiring how many logical qubits, at what error rate, and with what classical baseline. None of that is supplied because it is not knowable.

The paragraph's structure is the tell: a concrete near-term engineering claim and an unbounded long-term market claim placed in the same sentence, so that the credibility of the first transfers to the second. Once you see this pattern you will see it everywhere.

The final sentence — the "quantum-safe roadmap" — is a different move again. It gestures at post-quantum cryptography, which is a genuine and urgent concern, in a way that implies the company's quantum computer is relevant to solving it. It is not. Post-quantum cryptography is classical cryptography designed to resist quantum attack; migrating to ML-KEM and ML-DSA requires no quantum hardware whatsoever. This conflation is common enough to be worth naming explicitly, and Chapter 38 takes it apart properly.

The Verdict

How to summarize it in one sentence for your director: "They formulated a routing problem cleanly and got a better answer than the customer's old system, which is a real if modest result about problem formulation; there is no evidence yet that the quantum hardware contributed the improvement, and the five-year industry predictions are not supported by anything in the announcement."

That sentence is defensible, it is not dismissive, and it gives your director something to act on.

What a Good Announcement Looks Like

The point of this exercise is calibration, not cynicism, so here is the same result written honestly.

QuantumScale reports results from a 340-qubit QAOA implementation of a capacitated vehicle routing problem with 18 locations and 4 vehicles, run on the 512-qubit Meridian processor (median two-qubit error rate 0.6%, median $T_1$ 110 μs, circuit depth 84 after transpilation).

The quantum solution achieved a routing cost 11% below the partner's production heuristic. A classical branch-and-cut solver found the optimal solution to the same formulation in 0.3 seconds, 14% below the production heuristic. The quantum result did not exceed the classical baseline.

The result demonstrates that a problem of this class can be encoded and executed end to end on current hardware with the solution quality reported above. It does not demonstrate quantum advantage. Extrapolating from current scaling, instances large enough to challenge classical solvers would require circuit depths beyond current coherence budgets by roughly two orders of magnitude.

The problem instance, the encoding, and the classical comparison code are available at [repository].

Notice: this version is more impressive, not less. It reports a real end-to-end engineering achievement, it states its own limitations before anyone else can, and it gives you enough information to build on. It also tells you exactly what would have to change for the result to matter — two orders of magnitude in coherence-limited depth — which is the single most useful sentence in it.

Companies that write announcements like this are the ones to take seriously. Some do.

Lessons

1. Qubit count is not a capability metric. Always ask for error rates, coherence times, and circuit depth alongside it.
2. "Better than the customer's current system" is not a classical baseline. The controlled comparison is against the best available classical method on the identical formulation.
3. Absence of the classical comparison is evidence about the classical comparison. It is cheap to run and it would be reported if it were favorable.
4. Roadmap claims and capability claims get fused deliberately. Separate them in your own summary before you pass the claim along.
5. Post-quantum cryptography is not a quantum computing product. Watch for the conflation; it is pervasive and it confuses buyers badly.
6. The best signal is self-limitation. A group that tells you what their result does not show, and what would have to change, is a group whose positive claims are worth trusting.
7. You will be asked for a verdict before you feel qualified to give one. The five questions let you give a useful answer from a position of limited knowledge, which is exactly the position you will be in.

Questions

1. Rewrite the announcement's third paragraph — the Chief Quantum Officer quotation — as something a scientifically careful executive could say without overclaiming, while still being genuinely positive about the result.

2. The analysis infers a problem size of roughly eighteen locations from a count of 340 qubits. Reconstruct that inference. What encoding assumption does it rest on, and how would the estimate change under a different encoding?

3. Which of the five questions is most likely to be answered honestly if you simply ask? Which is least likely, and why?

4. The "good announcement" reports that the quantum result was worse than the classical optimum. Why is that version more useful to a potential customer than the original, and why do so few announcements take that approach?

5. Construct a version of this announcement that would genuinely demonstrate quantum advantage. Specify the problem, the size, the classical baseline, the hardware requirements, and the verification method. Is your version achievable on current hardware? What would have to change?

6. Apply the five questions to a real quantum computing announcement you find this week. Write the one-sentence summary you would give a director. Save it and revisit in a year.

7. Hardest. This case study's method is adversarial: it assumes the announcement is trying to create an impression its evidence does not support. What is the cost of applying this method to a genuine breakthrough — and how would you recognize one? Give at least two properties a real advantage result would have that this method might cause you to undervalue.