Google Quantum Advantage (Sycamore) — Computational Supremacy via Random Circuit Sampling

Classical algorithm improvement rate. The 10,000-year classical estimate was produced by Google using their own assessment of the best available classical methods at publication time. Within two years, tensor network methods (Pan & Zhang), improved contraction orderings, and GPU parallelisation reduced the classical simulation time by roughly eight orders of magnitude. Within five years, classical systems exceeded the quantum benchmark. This mechanism is structural: any quantum supremacy claim benchmarked against a static classical baseline is vulnerable to the continuous, incentivised improvement of classical simulation algorithms. The mechanism operated identically against the original Sycamore claim (see FR-QE-0002, RM-001 for the D-Wave parallel).

Benchmark specificity. Random Circuit Sampling was selected as the supremacy benchmark partly because it is believed to be classically hard in the asymptotic limit. However, the specific circuit parameters (53 qubits, 20 cycles, target fidelity ~0.2%) were chosen to be within reach of the Sycamore hardware. Critics have argued that the benchmark was optimised to demonstrate quantum advantage rather than to solve a problem of independent interest. The linear cross-entropy benchmark (XEB) used to verify output quality has itself been challenged: Gao et al. (PRX Quantum, 2024) demonstrated limitations of XEB as a measure of quantum advantage, showing that high XEB scores can be achieved by methods that do not faithfully sample from the target distribution.

Claimant-produced classical baseline. In both 2019 (Sycamore) and 2024 (Willow), the classical difficulty estimate was produced by the same team making the quantum claim. No independent party has verified the 10²⁵-year estimate for the Willow RCS benchmark. The historical pattern — Google's 2019 estimate of 10,000 years was reduced to days within five years by independent researchers — provides a Track Record Prior suggesting that claimant-produced classical baselines systematically overestimate classical difficulty.

Definition of "practical infeasibility." The supremacy claim depends on a threshold concept: a task is beyond classical reach if no classical computer can perform it in any reasonable timeframe. But "reasonable" is undefined and shifts with available hardware. IBM's 2.5-day rebuttal accepted the performance gap but contested whether it constituted infeasibility. As classical methods improve, the boundary between "slow" and "infeasible" remains contested. This bottleneck may be irreducible for any supremacy claim benchmarked on a fixed-size circuit.

Claim migration obscures resolution. The original 2019 claim has not been formally retracted, but Google's own research programme has moved to qualitatively different claims (error correction scaling, logical qubit lifetime). The supremacy claim persists in public discourse while the technical frontier has migrated. This creates an assessment bottleneck: the Observatory cannot issue a settled verdict on a claim whose claimant has effectively abandoned its original formulation without conceding its invalidity. The FCIF formalises this pattern as Claim Migration — one of four resolution pathways in the Preliminary Claim Resolution Taxonomy.

Exponential scaling of circuit complexity. Google's Willow result suggests that as qubit count and circuit depth increase, the classical simulation cost grows exponentially while the quantum execution cost grows polynomially. If this scaling relationship holds, classical simulation methods will eventually be unable to track quantum hardware improvements regardless of algorithmic ingenuity. The Willow RCS estimate (10²⁵ years) is far enough beyond the Sycamore estimate (10,000 years) that even multiple orders-of-magnitude classical improvement would not close the gap. This attractor mechanism favours eventual resolution of the broader supremacy claim, though it does not retroactively validate the 2019 formulation.