Pillar C · State as of 2026-09-24

Google’s 2019 supremacy claim, seven years on: what remains?

As of September 24, 2026, the 10,000-year margin behind Google’s 2019 quantum supremacy claim is gone: the same sampling task has been run classically in 86.4 seconds on 1,432 GPUs, at higher fidelity (Natl. Sci. Rev., jun-2024), and the first peer-reviewed history of the field lists the 2019 claim as refuted (Quantum 10, 2198, sep-2026). The 200-second run itself stands; the margin does not. Google’s larger circuits — 67 qubits (Nature 634, oct-2024) and 105 qubits (Willow, dec-2024) — remain unrefuted, as estimates rather than verified margins. Rosetta Quantum reads the seven-year clock below.
→ Leer en español
State as of: 2026-09-24
Rosetta QuantumQUANTUM VERIFICATION LEDGERPILLAR C · CLAIM EXPLAINERSTATUS AS OF: 2026-09-24Google’s 2019supremacy claim,seven years on7×classical now runs Sycamore’s own task7× faster, at higher fidelity (jun-2024)10K yrEST ’192.5 dIBM ’1986.4 sRUN ’24rosettaquantum.com/blograw, reproducible data · sources below

Status as of September 24, 2026. In October 2019 Google announced that its 53-qubit Sycamore processor had done in 200 seconds what it estimated would take the Summit supercomputer 10,000 years (Nature 574, oct-2019). Seven years later, that sentence splits cleanly into a part that survived and a part that did not. This post walks the clock — date by date, number by number — and reads what is left in 2026.

What did Google measure in October 2019 — and what did it estimate?

Two different things, and the difference is the whole story. What was measured: Sycamore sampled the output of random quantum circuits on 53 qubits at 20 cycles, collecting one million samples in about 200 seconds (Arute et al., Nature 574, oct-2019). What was estimated: that reproducing those samples classically would take about 10,000 years on Oak Ridge’s Summit, then the fastest supercomputer (same paper). The measurement was a real machine doing a real (synthetic) task. The margin — the part that made «supremacy» a headline — was a claim about the best classical algorithm known to the claimant that year. Rosetta Quantum has a standing rule for exactly this split: advantage vs supremacy are different words for different evidence.

SYCAMORE 2019 — TWO LEDGERSwhat was measured vs what the estimates promisedMEASURED (2019 RUN)TASKRCSQUBITS53CYCLES20WALL TIME200 sSAMPLES1MESTIMATED MARGINSSUMMIT ’1910,000 yrIBM ’19 (paper)2.5 daysSYC-67 ’2412–6E4 yrWILLOW ’241E25 yrrow sources: Nature 574 · arXiv:1910.09534 · Nature 634 · Google (dec-2024)the first estimate fell; the other two stand untested by outsiders

How did the classical side answer?

In escalating steps, each with a number attached. Days after the announcement, IBM argued the task would take about 2.5 days on Summit using secondary storage (Pednault et al., arXiv:1910.09534, oct-2019) — a counter-estimate on paper: the 2026 review of the episode notes it was never actually executed (LaRose, Quantum 10, 2198, sep-2026). In March 2021, Pan & Zhang produced samples that pass the XEB benchmark with tensor networks on GPUs (arXiv:2103.03074) — the method behind most reversals in this field (our tensor-networks explainer). In November 2021, a Sunway supercomputer team won the ACM Gordon Bell Prize for simulating the circuits in real time — sampling one bitstring from the 2019 experiment in 304 seconds on 41,932,800 cores (arXiv:2110.14502; prize nov-2021). In 2022, Pan, Chen & Zhang generated uncorrelated samples that pass XEB in roughly 15 hours on 512 GPUs (PRL 129, 090502). And in June 2024, Zhao et al. used 1,432 GPUs to produce 3 million uncorrelated samples in 86.4 seconds — 7× faster than the Sycamore run itself, at a higher linear cross-entropy score, and two orders of magnitude more energy-efficient than earlier simulations (arXiv:2406.18889; Natl. Sci. Rev. 12, nwae317, 2025). Their own abstract calls it «the first unambiguous experimental evidence to refute Sycamore’s claim of quantum advantage».

THE SYCAMORE CLOCK: 2019 → 2026seven years of claim vs classical counterattackOCT-2019200 sSycamore samples 53 qubits — Nature 574OCT-201910,000 yrSummit estimate published with the claimOCT-20192.5 daysIBM counter-estimate, never executedMAR-2021spoofedtensor networks pass XEB — arXiv:2103.03074NOV-2021304 sone bitstring on Sunway — Gordon Bell ’212022≈15 h512 GPUs, uncorrelated samples — PRL 129JUN-202486.4 s3M samples, 7× faster — 1,432 GPUs, NSROCT-20246E4 yrSYC-67 estimate — Nature 634, unrefutedDEC-20241E25 yrWillow 105 qubits — vendor estimateSEP-2026refuted2019 claim, review verdict — Quantum 10the 2019 margin fell from 10,000 years to 86.4 seconds

What survives of the 2019 claim in 2026?

The run survives; the margin does not. Nobody disputes that Sycamore sampled its circuits in 200 seconds in 2019 — that measurement stands. But the 10,000-year gap that carried the word «supremacy» is gone: a classical cluster now does the same task 7× faster, with higher fidelity, on measured hardware (arXiv:2406.18889, jun-2024), and the first peer-reviewed history of the field formally lists the 2019 experiment as refuted in its verdict table (Quantum 10, 2198, sep-2026). The claim did not die, though — it moved to bigger circuits. Google’s SYC-67 experiment (67 qubits, 32 cycles, XEB fidelity 1.5×10⁻³) estimates 12 years on Frontier under generous secondary-storage assumptions and about 6×10⁴ years from RAM alone (arXiv:2304.11119; Nature 634, oct-2024) — and the same 2026 review lists it as unrefuted to date. Willow (dec-2024) pushed to 105 qubits: an RCS benchmark in under five minutes against a 10²⁵-year Frontier estimate — with Google itself stating the estimate rests on «conservative assumptions», that «we expect classical computers to keep improving on this benchmark», and that RCS «has yet to demonstrate practical commercial applications» (Google blog, dec-2024). We found no public classical attack on the Willow estimate as of this writing — an absence in the record, not a proof.

Date Event The number Source
oct-2019 Sycamore run: 53 qubits, 20 cycles, 1M samples 200 s (measured) Nature 574
oct-2019 Summit estimate, published with the run ≈10,000 yr (estimate) Nature 574
oct-2019 IBM counter-estimate, secondary storage — never executed 2.5 days (estimate) arXiv:1910.09534
mar-2021 Tensor-network samples pass the XEB test on GPUs “spoofed” arXiv:2103.03074
nov-2021 Sunway simulation, 41.9M cores — ACM Gordon Bell Prize 304 s per bitstring arXiv:2110.14502
2022 Uncorrelated samples on 512 GPUs ≈15 h (measured) PRL 129, 090502
jun-2024 3M uncorrelated samples, higher XEB, 1,432 GPUs 86.4 s (measured) arXiv:2406.18889 · NSR 12 (2025)
oct-2024 SYC-67: 67 qubits, 32 cycles, XEB 1.5×10⁻³ 12–6×10⁴ yr on Frontier (estimate) Nature 634 · arXiv:2304.11119
dec-2024 Willow: 105 qubits, RCS in under 5 minutes 10²⁵ yr on Frontier (estimate) Google blog
sep-2026 First peer-reviewed history lists the 2019 claim as «refuted» — Quantum 10, 2198

What did seven years of this teach?

Four things, each of them checkable in the table above. First: a supremacy margin is a statement about the best classical algorithm known to the claimant on announcement day — the 2019 margin fell repeatedly without Sycamore getting one qubit worse. Second: estimates and measurements belong in different ledgers. Every number that killed the margin was measured on real hardware (304 s, ≈15 h, 86.4 s); both the 10,000 years and IBM’s 2.5 days were estimates, and one of them was never even run. Third: verification is the structural weak point. At these sizes the output distribution cannot be checked directly; XEB is a proxy, and producing samples that beat the proxy is exactly what the counterattacks did — the same pattern Rosetta documented in boson sampling and in how benchmarks get gamed. Fourth: the task is synthetic. Seven years on, no random-circuit-sampling experiment has produced a commercial application — Google says so itself (dec-2024). The 2019 episode is the founding case of the claim-vs-counterattack clock this ledger keeps.

What we don’t know

Rosetta Quantum publishes verdicts with raw, reproducible data. This is educational content, not a product claim.

Sources:
· Arute et al., “Quantum supremacy using a programmable superconducting processor”, Nature 574, 505–510 (oct-2019)
· Pednault et al. (IBM), “Leveraging Secondary Storage to Simulate Deep 54-qubit Sycamore Circuits”, arXiv:1910.09534 (oct-2019)
· Pan & Zhang, “Simulating the Sycamore quantum supremacy circuits”, arXiv:2103.03074 (mar-2021)
· Pan, Chen & Zhang, “Solving the sampling problem of the Sycamore quantum circuits”, Phys. Rev. Lett. 129, 090502 (2022)
· Liu et al., “Closing the quantum supremacy gap”, arXiv:2110.14502 · ACM Gordon Bell Prize (nov-2021)
· Zhao et al., “Leapfrogging Sycamore: harnessing 1432 GPUs for 7× faster quantum random circuit sampling”, Natl. Sci. Rev. 12, nwae317 (2025; arXiv:2406.18889, jun-2024)
· Morvan et al. (Google Quantum AI), “Phase transitions in random circuit sampling”, Nature 634 (oct-2024) · arXiv:2304.11119
· Google, “Meet Willow, our state-of-the-art quantum chip” (dec-2024)
· LaRose, “A brief history of quantum vs classical computational advantage”, Quantum 10, 2198 (sep-2026)
· Kalai et al., “Google’s Quantum Supremacy Claim: Data, Documentation, and Discussion”, arXiv:2210.12753 (2022)
· Rosetta Quantum — Quantum advantage vs quantum supremacy: what is the difference?
· Rosetta Quantum — Are tensor networks the classical rival that keeps winning?
· Rosetta Quantum — Boson sampling: what did Jiuzhang and Borealis actually prove?
· Rosetta Quantum — How do you cheat on a quantum benchmark (and how to avoid it)?

Get the next one.

One email a week: what the evidence engine published and what moved in the registry. No pitches.