QUANTUM COMPUTING BASICS / ADVANCED

Quantum Advantage, Supremacy And The Claims That Did Not Survive

Since 2019, several claims that a quantum computer beat every classical computer have been narrowed or challenged. Here is the record, and how to judge the next claim.

Checked against primary sources and independently reviewed on . Sources are listed at the end.

Every year or so a headline announces that a quantum computer has done something no classical computer could. Some of those claims have held up. Others were matched within weeks or months by cleverer classical software. If you are deciding how seriously to take quantum computing, as a security leader or an investor, the pattern matters more than any single result.

This article explains what “supremacy” and “advantage” mean, walks through the main claims from 2019 to 2026 and the classical responses to them and ends with a short test you can apply to the next announcement. It assumes the background from the earlier articles in this series, especially the one on error correction.

Supremacy, Advantage And Utility

“Quantum supremacy” was the original term for a quantum device completing a task that no classical computer could finish in any reasonable time. The task did not need to be useful. It only had to be well defined and, on the strength of complexity theory and the best known classical methods, believed to be very hard to simulate. No such claim comes with a proof that every possible classical algorithm would fail. Many researchers now prefer “quantum advantage”, a term whose meaning varies between groups and is often reserved for results that are also useful, verifiable or both. IBM used “utility” in 2023 to describe experiments it argued were beyond brute-force classical simulation and scientifically useful, even without full error correction.1

The differences matter because a supremacy result on a contrived task says nothing about whether a machine can break encryption or design a drug. Each claim also rests on an estimate of the best classical method, and classical methods keep improving.

The Record So Far

  1. Google Sycamore: Random Circuit Sampling

    53 qubits sampled a random circuit a million times in about 200 seconds; Google estimated 10,000 years for a supercomputer. IBM disputed this in October 2019 with an estimate of 2.5 days.

  2. Classical Sampling Of Sycamore Circuits

    A tensor network method on 512 GPUs generated a million samples for the same circuits in about 15 hours. The supremacy margin was narrowed sharply.

  3. IBM Utility Experiment

    A 127-qubit processor measured accurate values for a physics model at a scale beyond brute-force simulation.

  4. Classical Reproduction Of The IBM Experiment

    Belief propagation tensor networks reproduced the results more accurately than the quantum processor.

  5. Google Willow: Random Circuit Sampling

    Under five minutes on Willow versus an estimated 10 to the power 25 years classically. Google notes the benchmark has no commercial use yet.

  6. D-Wave Annealing Simulation, Then Challenged

    D-Wave reported a beyond-classical quantum simulation in Science in 2025. A Flatiron Institute team reproduced key cases classically in Science in 2026. D-Wave disputes that the rebuttal covers its hardest cases.

  7. Google Quantum Echoes

    A verifiable quantity measured on 65 qubits in about two hours, estimated at 13,000 times longer on a classical supercomputer. Published in Nature; no matching classical method published as of October 2026.

  8. IBM And Partners Claim Advantage

    Three preprints with the University of Chicago, Qedma and Algorithmiq. About two weeks later a classical team computed the exact probabilities of the sampling experiment’s published outputs, challenging its hardness, and IBM replaced that demonstration with a new circuit. IBM’s own claim, not yet peer reviewed.

Major beyond-classical claims and the classical responses, 2019 to 2026. All dates refer to publication or announcement.

How The Early Claims Were Narrowed

Google’s 2019 Sycamore paper reported that its 53-qubit processor took about 200 seconds to sample one random circuit a million times, a task it estimated would take a state-of-the-art supercomputer about 10,000 years.2 IBM published a response on 22 October 2019, the day before the paper appeared, arguing that a classical system using disk storage and better simulation techniques could do the ideal version of the task in 2.5 days.3 That was an estimate, not a run. The more decisive response came in 2022, when Pan, Chen and Zhang generated a million samples for the Sycamore circuits in about 15 hours on a cluster of 512 GPUs, and estimated that an efficient implementation on an exascale supercomputer could be faster than Google’s hardware.4 Their method used tensor networks, which compress a large quantum state into many small linked blocks of numbers that a classical computer can handle.

IBM’s own 2023 utility experiment, on a 127-qubit Eagle processor, met a similar fate. About two weeks after it appeared, Tindall and colleagues posted a classical simulation that combined tensor networks with belief propagation, a technique that passes approximate summaries between neighbouring blocks instead of computing everything exactly. They reported results more accurate than the quantum processor’s, later published in PRX Quantum.5 The experiment remained a useful demonstration of noise handling, but it did not show a task out of classical reach.

The Current Claims

Google’s December 2024 Willow result repeated random circuit sampling at a much larger scale: under five minutes on Willow against an estimated 10 to the power 25 years for the Frontier supercomputer. Google was candid about the limits. It said the benchmark has yet to show commercial applications, and that the classical estimate generously assumed unlimited fast access to disk storage.6 The gap is so large that a full classical reversal looks unlikely, but the task itself remains of no practical use.

D-Wave’s 2025 Science paper claimed that its Advantage2 quantum annealer simulated the dynamics of magnetic models known as spin glasses with an accuracy that leading classical approximation methods could not match in reasonable time.7 A Flatiron Institute team then published classical simulations of the same models in Science in 2026, reporting state-of-the-art accuracy with modest computing resources.8 D-Wave responded in May 2026 that the classical work did not attempt its hardest lattice geometries or largest three-dimensional cases.9 This claim is disputed, and both sides have published their arguments.

Google’s October 2025 Quantum Echoes experiment aimed at something different. Instead of a long list of random samples, whose quality can only be judged statistically and, at this scale, only with enormous classical effort, it measured an average value that any good quantum computer running the same circuit should reproduce. Google reported that the measurement took about two hours on 65 of Willow’s qubits and would take a classical supercomputer about 13,000 times longer.10 The result was peer reviewed and published in Nature. As of October 2026 no published classical method matches it. The most direct test so far, an April 2026 preprint, found that the belief propagation approach that caught up with IBM’s 2023 experiment cannot feasibly simulate it, though that study comes from Google’s own quantum team rather than an independent group.11

In November 2025 IBM said it expected the wider research community to confirm the first cases of verified quantum advantage by the end of 2026. It also said it was contributing, alongside Algorithmiq, Flatiron Institute researchers and BlueQubit, to an open, community-led tracker of candidate experiments.12 On 30 July 2026 IBM announced three demonstrations, each posted as a preprint: a sampling experiment with the University of Chicago whose accuracy could be certified on the device and two physics simulations, one with Qedma and one with Algorithmiq.1314 IBM’s roadmap page now states that it and its partners delivered advantage in 2026 as promised.15

The sampling result was challenged within about two weeks. Manabe, Gu and Pan, at the Singapore University of Technology and Design and NVIDIA, exploited the simple one-dimensional layout of the original circuit and computed the exact probabilities of all 2,051 outputs IBM had published in 37.3 minutes on 256 GPUs. Their numbers also agreed with IBM’s estimate of how accurate the hardware had been.16 IBM’s revised preprint of September 2026 acknowledges this, replaces the demonstration with a 64-qubit circuit on a different layout and adds the three classical researchers as co-authors.17 As of October 2026 none of the three IBM-linked papers has been through peer review. Treat “advantage delivered” as IBM’s own claim, still being tested in the way described above.

How To Judge The Next Claim

The history suggests a short set of questions. Work through them for any new announcement.

Has the result been published in a peer-reviewed journal?

  • Yes:

    Can the output be checked efficiently, by a classical computer or by another quantum computer?

    • Yes:

      Does the task solve a problem someone actually needs solved?

      • Yes:

        Has it stood for a year without a matching classical method?

        • Yes:

          Strong evidence of useful advantage. Still check which classical methods were compared.

        • No:

          Promising, not settled. Past claims have been matched or seriously challenged by classical methods within weeks in two cases and within a few years in another.

      • No:

        Credible, but not yet useful. Expect it to matter for science before it matters for business.

    • No:

      Treat as a benchmark milestone. Such results show hardware progress but are the type most often narrowed by classical methods.

  • No:

    Treat as a company claim for now. Wait for the paper and for independent comment before relying on it.

A quick test for any new quantum advantage claim. It does not decide whether a claim is true, only how much weight to give it today.

Footnotes

  1. Y. Kim et al. (IBM), “Evidence for the utility of quantum computing before fault tolerance”, Nature 618, 500 (2023). nature.com ↩

  2. F. Arute et al. (Google), “Quantum supremacy using a programmable superconducting processor”, Nature 574, 505 (2019). nature.com ↩

  3. E. Pednault, D. Maslov, J. Gunnels and J. Gambetta, “On ‘quantum supremacy’”, IBM Quantum Computing Blog, 22 October 2019. ibm.com ↩

  4. F. Pan, K. Chen and P. Zhang, “Solving the sampling problem of the Sycamore quantum circuits”, Physical Review Letters 129, 090502 (2022). arxiv.org ↩

  5. J. Tindall et al., “Efficient tensor network simulation of IBM’s Eagle kicked Ising experiment”, PRX Quantum 5, 010308 (2024). arxiv.org ↩

  6. Google, “Meet Willow, our state-of-the-art quantum chip”, 9 December 2024. blog.google ↩

  7. A. D. King et al. (D-Wave), “Beyond-classical computation in quantum simulation”, Science 388, 199 (2025). arxiv.org ↩

  8. J. Tindall et al. (Flatiron Institute), “Dynamics of disordered quantum systems with two- and three-dimensional tensor networks”, Science 392, 868 (2026). arxiv.org ↩

  9. D-Wave, “D-Wave’s Quantum Supremacy Result Stands”, press release, 26 May 2026. dwavequantum.com ↩

  10. Google Quantum AI and collaborators, “Observation of constructive interference at the edge of quantum ergodicity”, Nature 646, 825 (2025), published online 22 October 2025 nature.com; Google Research, “A verifiable quantum advantage”, 22 October 2025 research.google ↩

  11. P. Bermejo, B. Villalonga, B. Ware, G. Vidal and A. Szasz (Google Quantum AI), “Tensor Networks with Belief Propagation Cannot Feasibly Simulate Google’s Quantum Echoes Experiment”, arXiv 2604.15427, 16 April 2026 (preprint). arxiv.org ↩

  12. IBM, “IBM Delivers New Quantum Processors, Software, and Algorithm Breakthroughs on Path to Advantage and Fault Tolerance”, press release, 12 November 2025. newsroom.ibm.com ↩

  13. IBM, “IBM and The University of Chicago Demonstrate Quantum Advantage, Establishing Trusted Quantum Computation on Logical Circuits”, press release, 30 July 2026. newsroom.ibm.com ↩

  14. E. Leviatan et al. (Qedma), “Resolving Structure in Prethermal Floquet Dynamics with Precision Quantum Computation”, arXiv 2607.24937, 27 July 2026 (preprint) arxiv.org; S. V. Barron et al. (Algorithmiq), “Observable Estimation in the Absence of Classical Verification”, arXiv 2607.25998, 28 July 2026 (preprint) arxiv.org ↩

  15. IBM Quantum, “Roadmap”, web page, accessed 7 October 2026. ibm.com ↩

  16. H. Manabe, H. Gu and F. Pan, “Classical Simulation and Design Frontiers for IBM’s Doped Clifford Sampling Experiment”, arXiv 2608.13110, 13 August 2026 (preprint). arxiv.org ↩

  17. S. Martiel et al. (IBM, University of Chicago and others), “Sampling hard circuits with verifiably high fidelity”, arXiv 2607.25941, first version 28 July 2026, revised 1 and 2 September 2026 (preprint). arxiv.org ↩

Knowledge Hub content is general information. It is not legal advice, a compliance certification, a guarantee of security or a substitute for an assessment of your own systems. Standards and rules change; check the sources for the latest position.