The Scaling Paradox of Surface-Code Quantum Error Correction: Exponential Suppression, Logarithmic Overhead, and a Landauer Floor That Grows with Reliability

In the paper's words

Surface-code quantum error correction (QEC) is widely regarded as the leading route to fault-tolerant quantum computation, yet its resource story contains an under-examined tension we call the scaling paradox: the code suppresses logical errors exponentially in code distance d, so the physical-qubit overhead per logical qubit grows only as the square of a quantity that is itself logarithmic in the target reliability 1/p_L — while at the same time the thermodynamic cost of correction, priced by Landauer's principle, grows linearly in d and therefore also logarithmically in 1/p_L. Reliability is thus simultaneously cheap (polynomially, in qubits) and never free (the erasure floor per logical qubit per round, (n-k)/(k)k_B Tln 2, increases with every increment of d). We make this tension quantitative.

The abstract, verbatim, and its opening sentence is the claim. Every line below is quoted from the text.

Numbers it reports

1. We compute the Landauer floor at $T = 20$ mK as $1.68\times 10^{-16}$ W per logical qubit at a 1 MHz cycle, roughly fifteen orders of magnitude below realistic control dissipation, and identify syndrome-decoding throughput ($4.4\times 10^{14}$ bits/s at $10^6$ logical qubits) as the operative bottleneck.

   from Abstract

2. (2) The 1 mW/channel and $T = 20$ mK inputs are scenario assumptions; the $5.2\times 10^{15}$ gap is robust to many orders of magnitude of error in them, but the conclusion "thermodynamics is irrelevant" would fail if cryogenic erasure were priced at far higher effective temperatures or if reversible-computing decoders approached the floor.

   from 6. Discussion

3. Evidence that erasure in QEC cycles is irreducible at rates approaching $k_B T\ln 2\times$ syndrome volume at effective temperatures well above 20 mK would revive the thermodynamic floor as binding, contradicting our gap estimate.

   from 6. Discussion

4. The ATLAS pixel project designed segmented silicon trackers with radiation-hard readout electronics operating at a 40 MHz collision rate, providing two-dimensional space-point information in the region nearest the interaction point [2].

   from 2. Background and Related Work

5. Per logical qubit at 1 MHz: $4.40\times 10^{8}$ bits/s.

   from 4. Analysis

6. For $N_{\mathrm{log}} = 10^{6}$ logical qubits: $$\dot{S} = 440\times 10^{6}\times 10^{6} = 4.4\times 10^{14}\ \mathrm{bits/s}.$$ Relative to the ATLAS pixel readout rate of 40 MHz $= 4.0\times 10^{7}$ events/s [2]: $$\frac{4.4\times 10^{14}}{4.0\times 10^{7}} = 1.1\times 10^{7}.$$ Surface-code decoding at scale demands a raw syndrome decision rate about $10^{7}$ times a flagship detector's event rate.

   from 4. Analysis

How it is done

1. We compute the Landauer floor at $T = 20$ mK as $1.68\times 10^{-16}$ W per logical qubit at a 1 MHz cycle, roughly fifteen orders of magnitude below realistic control dissipation, and identify syndrome-decoding throughput ($4.4\times 10^{14}$ bits/s at $10^6$ logical qubits) as the operative bottleneck.

   from Abstract

2. We use this as a calibration point for what "large-scale, high-rate, low-latency readout" has historically meant in experimental physics, against the far higher syndrome rates that surface-code decoding demands (Section 4).

   from 2. Background and Related Work

3. We adopt the standard phenomenological ansatz for the logical error rate per round of the rotated surface code under circuit-level depolarizing noise: $$p_L(d, p) \approx A\left(\frac{p}{p_{\mathrm{th}}}\right)^{(d+1)/2},$$ where $d$ is the code distance, $p$ the physical (circuit-level) error rate, and $p_{\mathrm{th}} = 10^{-2}$ the threshold.

   from 3. Methods

4. Step 1: Distance from target reliability.

   from 4. Analysis

What would falsify it

1. We discuss falsifiability, failure modes, and the resource-commensurable alternative posed by bosonic encodings, which require $5$–$40\times$ fewer photons and $\sim 100\times$ fewer modes at matched $p_L = 10^{-6}$.

   from Abstract

2. A demonstrated surface-code implementation achieving $p_L \le 10^{-12}$ with $n \ll 400$ at $p \approx 10^{-3}$ would falsify the ansatz as used here.

   from 6. Discussion

Where the claim stops

1. (1) The ansatz $p_L \approx 0.1(p/p_{\mathrm{th}})^{(d+1)/2}$ is a heuristic; the prefactor is uncertain by factors of a few and the effective exponent can differ under realistic noise models (leakage, correlated errors, measurement crosstalk).

   from 6. Discussion

2. (2) The 1 mW/channel and $T = 20$ mK inputs are scenario assumptions; the $5.2\times 10^{15}$ gap is robust to many orders of magnitude of error in them, but the conclusion "thermodynamics is irrelevant" would fail if cryogenic erasure were priced at far higher effective temperatures or if reversible-computing decoders approached the floor.

   from 6. Discussion

3. (4) The linear decoding-cost projection is an assumption, not a result.

   from 6. Discussion

Where to read

1. Abstract253 words · 1 min
2. 1. Introduction385 words · 2 min
3. 2. Background and Related Work533 words · 2 min
4. 3. Methods353 words · 2 min
5. 4. Analysis768 words · 3 min
6. 5. Results425 words · 2 min
7. 6. Discussion726 words · 3 min
8. 7. Conclusion222 words · 1 min
9. Appendix A. Divergence report343 words · 1 min