Making Random Quantum Codes Useful for Real Machines

In the paper's words

A recent preprint (arXiv:2609.40252) extends the local coordinate-wise linear (LCL) witness framework of Levi, Mosheiff, and Shagrithaya from classical linear codes to CSS quantum codes. The central structural difficulty is that a CSS code is a nested pair of spaces S ⊆ C, so a local witness has two ranks: a physical rank on representatives in C and a logical rank in the quotient C/S. The resulting theory yields a threshold theorem for random CSS codes whose striking corollary is that the per-sector rate threshold equals the classical rate threshold, together with quantum subspace designs and explicit folded constructions that are themselves qLDPC — the first explicit quantum list-decodable and list-recoverable codes with optimal list sizes.

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

Numbers it reports

1. Within the QNFO corpus, [10] argues on resource-commensurable grounds (photons per logical qubit at logical error rate $10^{-6}$) that bosonic codes need 5–40× fewer photons than surface codes, suggesting the "native encoding" question interacts with the choice of outer qLDPC code.

   from 2. Background and Related Work

2. Both sectors lie strictly below the per-sector threshold 0.5310, so by the threshold theorem of [2], a random CSS code from this ensemble is, with high probability, list-decodable to radius 0.1 in both sectors — i.e., the X-sector and Z-sector codes each tolerate a 10% error fraction with bounded lists.

   from 4.2 A concrete rate allocation for random CSS codes

3. We therefore fix the largest Hamming-bound-feasible relative distance, $\delta = 0.11$, giving the required block length $n = d/\delta = 100/0.11 \approx 910$ and k = R·n ≈ 455 logical qubits.

   from 4.4 Overhead comparison at matched distance

4. Feasible CSS rate allocation: $R_{X} = R_{Z} = 0.3$, total rate R = 0.4 ; at $n = 100,000$ this yields k = 40,000 logical qubits, with both sectors 0.2310 below threshold.

   from 5. Results

5. Our analysis shows the theorem has sharp numerical teeth: at error radius 0.1, the threshold is $R* = 0.5310$; a rate-0.4 CSS allocation with 40,000 logical qubits per 100,000 physical sits comfortably below it with constant list size ≈ 16; and the explicit qLDPC derandomization translates into a $\approx 10^{4}$-fold qubit-overhead advantage over surface codes at distance 100 on locality-permissive architectures — a comparison that holds at the Hamming-bound-feasible operating point (rate $1/2, \delta \approx 0.11, n \approx 910$), not at the impossible $n = 200 = 2d$.

   from 7. Conclusion

6. Fifth, the bosonic-encoding evidence of [10] (5–40× photon savings) is measured against surface codes, not qLDPC codes; whether it transfers is open.

   from 6. Discussion

How it is done

1. The resulting theory yields a threshold theorem for random CSS codes whose striking corollary is that the per-sector rate threshold equals the classical rate threshold, together with quantum subspace designs and explicit folded constructions that are themselves qLDPC — the first explicit quantum list-decodable and list-recoverable codes with optimal list sizes.

   from Abstract

2. This two-rank structure is the key innovation, and it yields the threshold theorem: random CSS codes satisfy a given quantum-LCL property with high probability precisely when the per-sector rate lies below a threshold, and that threshold equals the corresponding classical threshold.

   from 1. Introduction

3. Its headline results are a threshold theorem for random CSS codes, the equality of per-sector and classical rate thresholds, a quantum analogue of subspace designs, and explicit folded quantum-LCL constructions that are qLDPC, yielding the first explicit quantum list-decodable and list-recoverable codes with optimal list sizes.

   from 2. Background and Related Work

4. Our method is analytical arithmetic on stated asymptotic results.

   from 3. Methods

What would falsify it

1. (iii) We argue critically: we identify where the framework's guarantees are weakest and state what evidence would falsify the claim that quantum-LCL derandomization is practically transformative.

   from 1. Introduction

2. Failure modes and falsifiability.

   from 6. Discussion

3. The claim that per-sector thresholds equal classical thresholds would be falsified by exhibiting a folded quantum-LCL property for which the random CSS threshold deviates from the classical value in either sector.

   from 6. Discussion

Where the claim stops

1. This is the correct reading of the theorem, but it means per-sector thresholds do not by themselves pin down the effective k/n of the explicit constructions.

   from 6. Discussion

2. (v) A limitation of this paper's sources: the bibliography mixes peer-reviewed work with preprints of varying maturity, including the unrefereed [1], [2] themselves; all conclusions conditional on [2] inherit its verification status.

   from 6. Discussion

3. Whether quantum-LCL codes can be spatially coupled without losing check locality is an open question (Section 6).

   from 2. Background and Related Work

Where to read

1. Abstract304 words · 1 min
2. 1. Introduction359 words · 2 min
3. 2. Background and Related Work801 words · 3 min
4. 3. Methods349 words · 2 min
5. 4. Analysis885 words · 4 min
6. 5. Results214 words · 1 min
7. 6. Discussion606 words · 3 min
8. 7. Conclusion163 words · 1 min
9. Appendix A. Divergence report617 words · 3 min
10. Appendix B. Claim attribution446 words · 2 min