The December 2024 report of the Willow processor presented the first superconducting surface-code memory in which enlarging the code reduced the logical error rate: each step from distance three to five to seven divided the error per cycle by a suppression factor Lambda of 2.14, reaching 1.43e-3 per cycle at distance seven. A single measured suppression factor invites extrapolation, and extrapolation deserves an audit. This paper takes the published Lambda and the published distance-seven rate as fixed inputs and computes what they imply for the distances and qubit counts that algorithmic error targets demand. Holding Lambda constant, a per-cycle logical error rate of 1.00e-9 requires distance 45 and 4049 physical qubits in one rotated patch, while 1.00e-12 requires distance 63 and 7937 qubits. The mean waiting time between logical failures at distance seven is only 699 cycles, which at a microsecond-scale cycle time is well under a millisecond, so the demonstrated patch is a physics milestone rather than a computational memory. The budget also exposes the sensitivity of every projection to Lambda: because distance grows logarithmically in the target but the qubit count grows with the square of distance, a ten per cent erosion of Lambda inflates the largest patches by roughly a quarter. Suppression factors, not raw physical error rates, are therefore the currency in which fault-tolerant overhead should be quoted.
The December 2024 report of the Willow processor presented the first superconducting surface-code memory in which enlarging the code reduced the logical error rate: each step from distance three to five to seven divided the error per cycle by a suppression factor Lambda of 2.14, reaching 1.43e-3 per cycle at distance seven. A single measured suppression factor invites extrapolation, and extrapolation deserves an audit. This paper takes the published Lambda and the published distance-seven rate as fixed inputs and computes what they imply for the distances and qubit counts that algorithmic error targets demand. Holding Lambda constant, a per-cycle logical error rate of 1.00e-9 requires distance 45 and 4049 physical qubits in one rotated patch, while 1.00e-12 requires distance 63 and 7937 qubits. The mean waiting time between logical failures at distance seven is only 699 cycles, which at a microsecond-scale cycle time is well under a millisecond, so the demonstrated patch is a physics milestone rather than a computational memory. The budget also exposes the sensitivity of every projection to Lambda: because distance grows logarithmically in the target but the qubit count grows with the square of distance, a ten per cent erosion of Lambda inflates the largest patches by roughly a quarter. Suppression factors, not raw physical error rates, are therefore the currency in which fault-tolerant overhead should be quoted.
Quantum error correction [1, 2, 3, 4] provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit, where the logical error rate is suppressed exponentially as more qubits are added. However, this exponential suppression only occurs if the physical error rate is below a critical threshold. Here, we present two below-threshold surface code memories on our newest generation of superconducting processors, Willow: a distance-7 code, and a distance-5 code integrated with a real-time decoder. The logical error rate of our larger quantum memory is suppressed by a factor of Λ=2.14±0.02 when increasing the code distance by two, culminating in a 101-qubit distance-7 code with 0.143% ± 0.003% error per cycle of error correction. This logical memory is also beyond break-even, exceeding its best physical qubit’s lifetime by a factor of 2.4±0.3 . Our system maintains below-threshold performance when decoding in real time, achieving an average decoder latency of 63 μs at distance-5 up to a million cycles, with a cycle time of 1.1 μs. We also run repetition codes up to distance-29 and find that logical performance is limited by rare correlated error events occurring approximately once every hour, or 3×109 cycles. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.
Quantum error correction can suppress logical errors exponentially with code distance when physical noise is below threshold. Realizing this on hardware requires tight coordination among quantum gates, mid-circuit measurements, and qubit coherence. Device variation, noise asymmetry, and correlations across space and time complicate the translation of these capabilities into logical error suppression. Here, we study rotated surface-code memory on an IBM Nighthawk r2 processor. Performance varies across tested processor placements, which we attribute to differences in qubit quality. We optimize the code by combining short readout, fused measurement and reset, and an XX echo on data qubits during ancilla readout. Compared with standard readout without reset or echo, the optimized syndrome extraction circuit reduces the median per-round logical error rate by factors of 3.8 in the X basis and 1.4 in the Z basis. In memory experiments of up to 150 rounds, the distance advantage weakens, alongside long-lived correlations that may reflect a persistent error component. Under our optimization recipe, increasing the protected distance from 3 to 6 while holding the other distance fixed reduces the per-round logical error rate from 0.53% to 0.24% in Z memory and from 0.52% to 0.22% in X memory. The corresponding error-suppression factors under maximum-likelihood decoding are 1.68 and 1.85. These results connect circuit compilation and optimization to surface-code memory performance and limitations, and motivate QPU and QEC circuit codesign for fault-tolerant quantum computing primitives on current cloud hardware.
Quantum Transfer Level (QTL) is applied as a contract-first design and verification framework to the Willow surface-code memory. This manuscript reports a milestone rather than a completed physical optimization and makes a central distinction between hardware width and future-distinguishable boundary-record width. Under the frozen logical-X and logical-Z eigenstate functional contract, initialization and cycle-boundary transformations reduce exactly, ideal data-qubit leakage removal closes side-locally, repeated ideal syndrome cycles collapse to one quantum extraction followed by classical repetitions, and the complete future response is a sparse affine transition family. After the first ideal extraction, no branch-dependent coherent record is required; the full ideal benchmark is generated by parity and exclusive OR (XOR) logic with 48 fresh unbiased bits. Separately, a fixed-basis stabilizer theorem gives a raw distance-seven Pauli-frame boundary record of 48 syndrome coordinates plus one logical-flip coordinate, with a one-bit conditioned residual only when the exact syndrome is already past context. A structural stochastic-fault extension yields conditioned weighted-history partitions, a binary group algebra, and Walsh-character attenuation. In the canonical code-capacity data-Pauli model, the logical-difference distance equals the code distance and the minimum branch-competition barrier is (d + 1)/2; this statement is not promoted to circuit-level superconducting-inspired 1000-ns (SI1000) noise, where hook and correlated mechanisms can reduce effective fault distance. A published distance-three/distance-five constant-Λ extrapolation agrees with the published distance-seven mean at the percent level, as expected from standard below-threshold scaling, and is reported only as a consistency check. At the milestone boundary, exactclosure-complete SI1000 cut certification and the remaining physical QTL optimization remained open.
This note applies a single first-order source-loss balance, C dθ/dt = A − ρθ, to systems across many scales — from a planetary surface to a qubit register — and reports, with exact numbers, where the balance reproduces measured values and where it does not. The central quantitative result concerns quantum error correction. Using published surface-code and trapped-ion data (Google Quantum AI, Nature 638, 920 (2024); Quantinuum Helios colour-code results, 2026), the note shows that the logical error per cycle falls by a constant factor Λ only while errors are independent. Correlated bursts act as a common loss channel whose rate does not fall with code distance; the quoted floor is about 3×10⁻¹⁰ per cycle, reached at distance about 46 for Λ = 2.17. For factoring a 2048-bit integer (about 1.4×10³ logical qubits, 6.5×10⁹ Toffoli gates, 4.96 days at a 1 μs cycle), the permitted logical error is 1.7×10⁻¹⁵ per qubit per cycle. At measured suppression factors this requires code distances of about 78 (Λ = 2.17) or about 24 (Λ = 12), while the published design uses 25 — and the correlated-error floor is not removed by increasing distance. This is a quantitative statement about where the scaling of error suppression stops matching the requirements of large computations, not a claim that small-scale quantum devices cannot work. The note also lists, separately and with exact values, the tests the balance fails: quark mass-step prediction (T6), gas/solid classification (T8, p = 0.81), nuclear count with A = 3, 4, prediction SP1 (−11.8% against a 10% threshold), coupling versus number of doors (T10, p = 0.015), width-to-cosmological-scale mapping (q₀ = −0.528 ± 0.011 against 0), human loss-rate estimates (11.1 and 15.3 W/K), critical Q₁₀ = 3.03 against measured 2.0–2.3, Higgs width from the b-quark exit alone (13.7% residual), shell boundaries (13 of 18), and several time constants. Of nine tests where the balance gives a value different from the standard one, one agreed with measurement and eight did not; the rules and thresholds were written before the data were examined. Successful checks include: photosynthesis stage efficiencies (0.487 × 0.094 = 0.0458 against 0.046 reported), a three-stage 2.45 GHz rectenna chain (0.906³ = 0.744), closure of the lunar surface energy budget to a ratio of 1.005, mode quality factors Q = m/Γ for the τ lepton (7.84×10¹¹), the Z boson (36.5) and the Higgs boson (3.38×10⁴), the Higgs lifetime from its width (290.87 fs against 290.3 ± 0.5 fs, a consistency check of standard formulas), and the proton-decay bound ρ < 1.3×10⁻⁴² s⁻¹. The complete theory, tests, scripts and the list of open items are maintained at https://zenodo.org/records/23812417. This note is a standalone publication; readers are invited to report measured values that disagree.
The planar surface code protects quantum information robustly but pays for its two-dimensional layout with an encoding rate that vanishes as the distance grows, so fault-tolerant memories require hundreds to thousands of physical qubits per logical qubit. A recent proposal constructs modular hyperbolic surface and color codes by partitioning a quantum processor into flat Euclidean modules and wiring sparse, static boundary connections between them, yielding semi-hyperbolic codes with constant encoding rate [1,4]. In this paper we provide an independent, fully explicit quantitative analysis of that proposal. Taking the reported parameters — encoding rate k/n=1/16 and distance d≥22 — as inputs, we compute that a twelve-logical-qubit modular memory requires nmod=192 physical qubits, versus 11100 data qubits for twelve distance-22 rotated surface-code patches, a raw overhead reduction of 57.8×; the reduction remains ≥30× even if the true modular implementation uses up to 370 physical qubits. We further develop a seam-noise mixture model and compute the seam-error budget under which the modular advantage survives: with a seam fraction f=0.1443, seam links may carry up to γ≈2.5× the intra-module error rate before a tenfold advantage at matched distance is exhausted. We compare against the [[288,12,18]] bivariate bicycle code (1.5× fewer qubits for the modular code, at strictly larger distance) and situate the proposal within the low-overhead QEC landscape. All arithmetic is shown step by step; all projections are labeled with stated assumptions. ## 1. Introduction Quantum error correction (QEC) is the accepted route to fault-tolerant quantum computation, but the leading practical scheme — the planar surface code — has an encoding rate k/n that tends to zero as the code distance d grows. For a target logical error rate, the required physical-to-logical qubit ratio grows roughly quadra Full text and updates: papers.qnfo.org/papers/low-overhead-quantum-error-correction-with-boundary-connected-planar-modules-a-r/
Abstract Practical quantum computing will require error rates well below those achievable with physical qubits. Quantum error correction 1,2 offers a path to algorithmically relevant error rates by encoding logical qubits within many physical qubits, for which increasing the number of physical qubits enhances protection against physical errors. However, introducing more qubits also increases the number of error sources, so the density of errors must be sufficiently low for logical performance to improve with increasing code size. Here we report the measurement of logical qubit performance scaling across several code sizes, and demonstrate that our system of superconducting qubits has sufficient performance to overcome the additional errors from increasing qubit number. We find that our distance-5 surface code logical qubit modestly outperforms an ensemble of distance-3 logical qubits on average, in terms of both logical error probability over 25 cycles and logical error per cycle ((2.914 ± 0.016)% compared to (3.028 ± 0.023)%). To investigate damaging, low-probability error sources, we run a distance-25 repetition code and observe a 1.7 × 10 −6 logical error per cycle floor set by a single high-energy event (1.6 × 10 −7 excluding this event). We accurately model our experiment, extracting error budgets that highlight the biggest challenges for future systems. These results mark an experimental demonstration in which quantum error correction begins to improve performance with increasing qubit number, illuminating the path to reaching the logical error rates required for computation.