pith. machine review for the scientific record. sign in

arxiv: 2605.11318 · v1 · submitted 2026-05-11 · 🪐 quant-ph

Recognition: 3 theorem links

· Lean Theorem

Spatial overhead reduction for 2D hypergraph product codes

Aarav Pabla , Yu-Xin Wang , Yifan Hong
Authors on Pith no claims yet

Pith reviewed 2026-05-13 01:30 UTC · model grok-4.3

classification 🪐 quant-ph
keywords quantum error correctionhypergraph product codesstabilizer codesoverhead reductionfault tolerancesurface codessyndrome measurementlogical gates
0
0 comments X

The pith

A spatial reduction shrinks hypergraph product quantum codes while preserving code dimension, logical basis, and minimum distances.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces a technique to remove physical qubits from 2D hypergraph product codes built from classical linear codes. This reduction leaves the code dimension, canonical logical basis, and minimum distances unchanged. It supplies explicit distance-preserving schedules for syndrome measurements. Concrete examples include shrinking a [[610,64,6]] code to [[441,64,6]] and a [[1225,49,11]] code to [[931,49,11]]. Circuit-level noise simulations show the smaller codes achieve comparable subthreshold performance in memory, and the savings remain compatible with homomorphic measurements, fold-transversal gates, and automorphisms.

Core claim

The central claim is that a spatial reduction can be applied to the qubit layout of any 2D hypergraph product code such that the stabilizer code's dimension, its canonical logical operators, and its minimum distances are exactly preserved, while distance-preserving syndrome measurement circuits still exist.

What carries the argument

The spatial reduction map on the hypergraph product lattice that eliminates selected physical qubits while leaving the stabilizer generators and logical operators intact.

If this is right

  • The reduced codes have identical code dimension and minimum distances to the originals.
  • Explicit distance-preserving syndrome measurement schedules remain available after reduction.
  • Parameter improvements occur, such as 610 to 441 physical qubits for fixed [[64,6]] logical parameters.
  • Subthreshold performance under circuit-level depolarizing noise stays similar despite fewer qubits.
  • The qubit savings extend to logical computation through preserved compatibility with homomorphic gadgets, fold-transversal gates, and automorphisms.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same reduction could lower physical resources needed during both memory and computation phases of fault-tolerant protocols.
  • Because automorphisms are preserved, the reduced codes may support the same set of transversal logical operations as the originals.

Load-bearing premise

The reduction works for arbitrary classical linear codes as inputs to the hypergraph product and still admits distance-preserving syndrome schedules.

What would settle it

A concrete hypergraph product code in which the reduced version exhibits a strictly smaller minimum distance than the original or requires syndrome measurements that drop below the original distance.

Figures

Figures reproduced from arXiv: 2605.11318 by Aarav Pabla, Yifan Hong, Yu-Xin Wang.

Figure 1
Figure 1. Figure 1: FIG. 1 [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2. General structure of the hypergraph product. The [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: as an example. The result is that if we can χ1-color the checks of H1 and χ2-color the checks of H2, the check-type qubits of the HGP code will be divided into χ1χ2 product-color groups, within which there are no shared (X or Z) stabi￾lizer support. Due to the restriction, we can only choose to combine X (Z) stabilizers in one color group per row (column). Additionally, let us restrict ourselves to never c… view at source ↗
Figure 4
Figure 4. Figure 4: FIG. 4. Combining [PITH_FULL_IMAGE:figures/full_fig_p007_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: FIG. 5. Example of parallel qubit reduction based on [PITH_FULL_IMAGE:figures/full_fig_p007_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: FIG. 6. Example HGP graph with colorings of check-type qubits denoted. Since the classical checks are 3-colorable ( [PITH_FULL_IMAGE:figures/full_fig_p008_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: FIG. 7. Example bipartite graph [PITH_FULL_IMAGE:figures/full_fig_p009_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: FIG. 8. When the checks of the classical codes can be 2- [PITH_FULL_IMAGE:figures/full_fig_p012_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: FIG. 9 [PITH_FULL_IMAGE:figures/full_fig_p014_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: FIG. 10. Example check-type qubits with 25 color groups showing the main diagonal upon which we are “fold-symmetric” [PITH_FULL_IMAGE:figures/full_fig_p015_10.png] view at source ↗
Figure 12
Figure 12. Figure 12: FIG. 12 [PITH_FULL_IMAGE:figures/full_fig_p018_12.png] view at source ↗
Figure 13
Figure 13. Figure 13: FIG. 13. Puncturing the second input classical code results in [PITH_FULL_IMAGE:figures/full_fig_p019_13.png] view at source ↗
Figure 14
Figure 14. Figure 14: FIG. 14 [PITH_FULL_IMAGE:figures/full_fig_p020_14.png] view at source ↗
Figure 15
Figure 15. Figure 15: FIG. 15. Using the configuration model with bit-vertex de [PITH_FULL_IMAGE:figures/full_fig_p021_15.png] view at source ↗
Figure 16
Figure 16. Figure 16: FIG. 16. The block logical error rate (BLER) as a function of the noise strength [PITH_FULL_IMAGE:figures/full_fig_p026_16.png] view at source ↗
Figure 17
Figure 17. Figure 17: FIG. 17. Geometric picture of a 3-complex as a mapping [PITH_FULL_IMAGE:figures/full_fig_p031_17.png] view at source ↗
Figure 18
Figure 18. Figure 18: FIG. 18 [PITH_FULL_IMAGE:figures/full_fig_p032_18.png] view at source ↗
Figure 20
Figure 20. Figure 20: FIG. 20. Hypergraph product [PITH_FULL_IMAGE:figures/full_fig_p034_20.png] view at source ↗
Figure 21
Figure 21. Figure 21: FIG. 21 [PITH_FULL_IMAGE:figures/full_fig_p035_21.png] view at source ↗
Figure 22
Figure 22. Figure 22: FIG. 22. For the HGP example in Figure [PITH_FULL_IMAGE:figures/full_fig_p037_22.png] view at source ↗
Figure 25
Figure 25. Figure 25: FIG. 25. Example of [PITH_FULL_IMAGE:figures/full_fig_p039_25.png] view at source ↗
Figure 23
Figure 23. Figure 23: FIG. 23. Example adjacency matrix. Rows and columns are [PITH_FULL_IMAGE:figures/full_fig_p039_23.png] view at source ↗
Figure 24
Figure 24. Figure 24: FIG. 24. Example of [PITH_FULL_IMAGE:figures/full_fig_p039_24.png] view at source ↗
read the original abstract

The hypergraph product creates a quantum stabilizer code from two input classical linear codes; a paradigmatic example being the surface code as a hypergraph product of two classical repetition codes. Many properties of the hypergraph product code can be inherited from those of the classical codes such as the code dimension, minimum distance and certain fault-tolerant gadgets. We investigate ways to reduce the number of physical qubits in hypergraph product codes while maintaining some of their useful properties for fault tolerance. We show that the code dimension, canonical logical basis, and minimum distances of the hypergraph product code are preserved through this reduction. We also provide distance-preserving syndrome measurement schedules as well as examples of reduced hypergraph product codes with parameter improvements such as $[\![610,64,6]\!] \rightarrow [\![441,64,6]\!]$ and $[\![1225,49,11]\!] \rightarrow [\![931,49,11]\!]$. In memory simulations with circuit-level depolarizing noise, we observe that the reduced codes can have similar subthreshold performance as their unreduced versions, but using fewer physical qubits. Finally, we show how overhead reduction can be compatible with homomorphic measurement gadgets, fold-transversal gates and automorphisms, which extends the savings to logical computation.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The manuscript proposes a spatial reduction technique for 2D hypergraph product quantum stabilizer codes constructed from pairs of classical linear codes. It claims that this reduction preserves the code dimension, the canonical logical basis, and the minimum distance of the resulting quantum code; supplies explicit distance-preserving syndrome measurement schedules; demonstrates concrete parameter improvements (e.g., [[610,64,6]] to [[441,64,6]] and [[1225,49,11]] to [[931,49,11]]); reports circuit-level depolarizing-noise memory simulations showing comparable subthreshold scaling with fewer physical qubits; and shows compatibility with homomorphic measurements, fold-transversal gates, and automorphisms.

Significance. If the preservation claims and simulation results hold, the work offers a practical route to lower spatial overhead for a broad family of quantum codes that inherit useful properties from classical inputs. The explicit examples, distance-preserving schedules, and extension to logical operations strengthen the potential utility for fault-tolerant architectures.

minor comments (3)
  1. [Abstract / Introduction] The abstract and introduction would benefit from a brief statement of the precise conditions on the input classical codes under which the reduction is guaranteed to preserve distance (e.g., any linear code or only those with additional structure).
  2. [Simulation section] Figure captions and simulation plots should explicitly state the number of Monte Carlo samples and the precise noise model parameters used to generate the subthreshold curves.
  3. [Syndrome measurement section] The description of the distance-preserving syndrome schedule would be clearer if it included a short pseudocode or diagram illustrating the modified measurement order relative to the unreduced code.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary of our work, recognition of its significance for reducing spatial overhead in hypergraph product codes while preserving key properties, and recommendation for minor revision. We are pleased that the explicit examples, distance-preserving schedules, simulation results, and compatibility with logical operations were viewed favorably.

Circularity Check

0 steps flagged

No significant circularity; explicit construction is self-contained

full rationale

The paper advances an explicit spatial reduction on 2D hypergraph product codes and verifies preservation of dimension, canonical logical basis, and minimum distance by direct construction, concrete examples such as [[610,64,6]] to [[441,64,6]], and circuit-level simulations. No equation or claim reduces by definition to its own inputs, no fitted parameter is relabeled as a prediction, and no load-bearing premise rests on a self-citation chain. The derivation therefore stands independently of the quantities it claims to preserve.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Based solely on the abstract, the central claim rests on the standard mathematical properties of classical linear codes and the hypergraph product construction; no free parameters, invented entities, or ad-hoc axioms are visible in the summary.

axioms (1)
  • standard math Standard definitions and distance properties of the hypergraph product of two classical linear codes
    The paper inherits code dimension, distance, and logical operators from the classical inputs via the hypergraph product.

pith-pipeline@v0.9.0 · 5523 in / 1353 out tokens · 55763 ms · 2026-05-13T01:30:32.541671+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

116 extracted references · 116 canonical work pages · 4 internal anchors

  1. [1]

    row coordinates

    EXAMPLES 5.1. Random LDPC codes One can define a classical random LDPC code using the bipartite configuration model, which will return a random bipartite graphG= (B∪C, E), where edges do not exist between vertices withinBorC, that we can interpret as a Tanner graph with bit-vertex setBand check-vertex setC. If we specify the number of checks each bit part...

    work page

  2. [2]

    Original

    NUMERICAL SIMULA TIONS To assess the near-term prospects of our qubit re- duction scheme in practice, we perform circuit-levelZ- memory simulations on a few select code instances. For a givenJn, k, dKcode, we initialize all data qubits in|0⟩⊗n, performdrounds of (XandZ) syndrome extraction, fol- lowed by a transversalZ-measurement of all data qubits. A fi...

    work page

  3. [3]

    transversal

    OUTLOOK We introduced a general-purpose procedure to reduce the number of physical qubits in HGP codes while main- taining code parameters such as code dimension, log- ical operator basis and minimum distance. We also show compatibility with a variety of existing HGP fault- tolerant gadgets such as distance-preserving syndrome extraction, fold-transversal...

    work page

  4. [4]

    Scheme for reducing decoherence in quantum computer memory,

    Peter W. Shor, “Scheme for reducing decoherence in quantum computer memory,” Phys. Rev. A52, R2493– R2496 (1995)

    work page 1995

  5. [5]

    Information- theoretic interpretation of quantum error-correcting codes,

    Nicolas J. Cerf and Richard Cleve, “Information- theoretic interpretation of quantum error-correcting codes,” Phys. Rev. A56, 1721–1732 (1997)

    work page 1997

  6. [6]

    Stabilizer Codes and Quantum Error Correction

    Daniel Gottesman, “Stabilizer codes and quantum error correction,” (1997), arXiv:quant-ph/9705052 [quant- ph]

    work page internal anchor Pith review Pith/arXiv arXiv 1997

  7. [7]

    Quantum computations: Algorithms and error correction,

    A Yu Kitaev, “Quantum computations: Algorithms and error correction,” Russian Mathematical Surveys52, 1191–1249 (1997)

    work page 1997

  8. [8]

    Quantum Error Correction with Imper- fect Gates,

    A. Yu. Kitaev, “Quantum Error Correction with Imper- fect Gates,” inQuantum Communication, Computing, and Measurement, edited by O. Hirota, A. S. Holevo, and C. M. Caves (Springer US, Boston, MA, 1997) pp. 181–188

    work page 1997

  9. [9]

    Fault-tolerant quantum computation by anyons,

    A.Yu. Kitaev, “Fault-tolerant quantum computation by anyons,” Annals of Physics303, 2–30 (2003)

    work page 2003

  10. [10]

    Quantum codes on a lattice with boundary,

    S. B. Bravyi and A. Yu. Kitaev, “Quantum codes on a lattice with boundary,” (1998), arXiv:quant- ph/9811052 [quant-ph]

    work page arXiv 1998

  11. [11]

    Surface code quantum computing by lattice surgery,

    Dominic Horsman, Austin G Fowler, Simon Devitt, and Rodney Van Meter, “Surface code quantum computing by lattice surgery,” New Journal of Physics14, 123011 (2012)

    work page 2012

  12. [12]

    Poking holes and cutting corners to achieve clifford gates with the surface code,

    Benjamin J. Brown, Katharina Laubscher, Markus S. Kesselring, and James R. Wootton, “Poking holes and cutting corners to achieve clifford gates with the surface code,” Phys. Rev. X7, 021029 (2017)

    work page 2017

  13. [13]

    A game of surface codes: Large-scale quantum computing with lattice surgery,

    Daniel Litinski, “A game of surface codes: Large-scale quantum computing with lattice surgery,” Quantum3, 128 (2019)

    work page 2019

  14. [14]

    A fault-tolerant non-clifford gate for the surface code in two dimensions,

    Benjamin J. Brown, “A fault-tolerant non-clifford gate for the surface code in two dimensions,” Science Ad- vances6(2020)

    work page 2020

  15. [15]

    Uni- versal quantum computing with twist-free and tempo- rally encoded lattice surgery,

    Christopher Chamberland and Earl T. Campbell, “Uni- versal quantum computing with twist-free and tempo- rally encoded lattice surgery,” PRX Quantum3, 010331 (2022)

    work page 2022

  16. [16]

    Magic state cultivation: growing T states as cheap as CNOT gates

    Craig Gidney, Noah Shutty, and Cody Jones, “Magic state cultivation: growing t states as cheap as cnot gates,” (2024), arXiv:2409.17595 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2024

  17. [17]

    Fast correlated decoding of transversal logical algorithms,

    Madelyn Cain, Dolev Bluvstein, Chen Zhao, Shouzhen Gu, Nishad Maskara, Marcin Kalinowski, Alexandra A. Geim, Aleksander Kubica, Mikhail D. Lukin, and Hengyun Zhou, “Fast correlated decoding of transversal logical algorithms,” (2025), arXiv:2505.13587 [quant- ph]

    work page arXiv 2025

  18. [18]

    Decoding across transversal clifford gates in the surface code,

    Marc Serra-Peralta, Mackenzie H. Shaw, and Bar- bara M. Terhal, “Decoding across transversal clifford gates in the surface code,” (2025), arXiv:2505.13599 28 [quant-ph]

    work page arXiv 2025

  19. [19]

    Scalable decoding protocols for fast transversal logic in the surface code,

    Mark L. Turner, Earl T. Campbell, Ophelia Crawford, Neil I. Gillespie, and Joan Camps, “Scalable decoding protocols for fast transversal logic in the surface code,” PRX Quantum7, 010320 (2026)

    work page 2026

  20. [20]

    How to factor 2048 bit rsa integers in 8 hours using 20 million noisy qubits,

    Craig Gidney and Martin Ekerå, “How to factor 2048 bit rsa integers in 8 hours using 20 million noisy qubits,” Quantum5, 433 (2021)

    work page 2048

  21. [21]

    Tradeoffs for reliable quantum information storage in 2d systems,

    Sergey Bravyi, David Poulin, and Barbara Terhal, “Tradeoffs for reliable quantum information storage in 2d systems,” Phys. Rev. Lett.104, 050503 (2010)

    work page 2010

  22. [22]

    Z2-systolic freedom and quantum codes,

    Michael H. Freedman, David A. Meyer, and Feng Luo, “Z2-systolic freedom and quantum codes,” in Mathematics of Quantum Computation(Chapman and Hall/CRC, 2002)

    work page 2002

  23. [23]

    Tradeoffs for reliable quantum infor- mationstorageinsurfacecodesandcolorcodes,

    Nicolas Delfosse, “Tradeoffs for reliable quantum infor- mationstorageinsurfacecodesandcolorcodes,” in2013 IEEE International Symposium on Information Theory (IEEE, 2013) p. 917–921

    work page 2013

  24. [24]

    Con- structions and noise threshold of hyperbolic surface codes,

    Nikolas P. Breuckmann and Barbara M. Terhal, “Con- structions and noise threshold of hyperbolic surface codes,” IEEE Transactions on Information Theory62, 3731–3744 (2016)

    work page 2016

  25. [25]

    Quantum ldpc codes with positive rate and minimum distance pro- portional to the square root of the blocklength,

    Jean-Pierre Tillich and Gilles Zémor, “Quantum ldpc codes with positive rate and minimum distance pro- portional to the square root of the blocklength,” IEEE Transactions on Information Theory60, 1193–1202 (2014)

    work page 2014

  26. [26]

    Fault-tolerant quantum computa- tion with constant overhead,

    Daniel Gottesman, “Fault-tolerant quantum computa- tion with constant overhead,” (2014), arXiv:1310.2984 [quant-ph]

    work page arXiv 2014

  27. [27]

    Constant overhead quantum fault tolerance with quantum expander codes,

    Omar Fawzi, Antoine Grospellier, and Anthony Lever- rier, “Constant overhead quantum fault tolerance with quantum expander codes,” Commun. ACM64, 106–114 (2020)

    work page 2020

  28. [28]

    Degenerate quan- tum ldpc codes with good finite length performance,

    Pavel Panteleev and Gleb Kalachev, “Degenerate quan- tum ldpc codes with good finite length performance,” Quantum5, 585 (2021)

    work page 2021

  29. [29]

    Quantum Tan- ner codes ,

    Anthony Leverrier and Gilles Zemor, “ Quantum Tan- ner codes ,” in2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)(IEEE Com- puter Society, 2022) pp. 872–883

    work page 2022

  30. [30]

    Good quantum ldpc codes with linear time decoders,

    Irit Dinur, Min-Hsiu Hsieh, Ting-Chun Lin, and Thomas Vidick, “Good quantum ldpc codes with linear time decoders,” inProceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023 (As- sociation for Computing Machinery, 2023) p. 905–918

    work page 2023

  31. [31]

    Fault-tolerant quantum computation with polyloga- rithmic time and constant space overheads,

    Shiro Tamiya, Masato Koashi, and Hayata Yamasaki, “Fault-tolerant quantum computation with polyloga- rithmic time and constant space overheads,” Nature Physics22, 27–32 (2026)

    work page 2026

  32. [32]

    Ex- pansion of High-Dimensional Cubical Complexes: with Application to Quantum Locally Testable Codes ,

    Irit Dinur, Ting-Chun Lin, and Thomas Vidick, “ Ex- pansion of High-Dimensional Cubical Complexes: with Application to Quantum Locally Testable Codes ,” in 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)(IEEE Computer Society,

    work page 2024

  33. [33]

    Quantum fault tolerance with constant-space and logarithmic-time overheads,

    Quynh T. Nguyen and Christopher A. Pattison, “Quantum fault tolerance with constant-space and logarithmic-time overheads,” inProceedings of the 57th Annual ACM Symposium on Theory of Computing, STOC ’25 (Association for Computing Machinery, New York, NY, USA, 2025) p. 730–737

    work page 2025

  34. [34]

    Quantum low-density parity-check codes,

    Nikolas P. Breuckmann and Jens Niklas Eberhardt, “Quantum low-density parity-check codes,” PRX Quan- tum2, 040101 (2021)

    work page 2021

  35. [35]

    Constant-overhead fault-tolerant quantum computation with reconfigurable atom ar- rays,

    Qian Xu, J. Pablo Bonilla Ataides, Christopher A. Pat- tison, Nithin Raveendran, Dolev Bluvstein, Jonathan Wurtz, Bane Vasić, Mikhail D. Lukin, Liang Jiang, and Hengyun Zhou, “Constant-overhead fault-tolerant quantum computation with reconfigurable atom ar- rays,” Nature Physics20, 1084–1090 (2024)

    work page 2024

  36. [36]

    Asymptotically good quantum and locally testable classical ldpc codes,

    Pavel Panteleev and Gleb Kalachev, “Asymptotically good quantum and locally testable classical ldpc codes,” inProceedings of the 54th Annual ACM SIGACT Sym- posium on Theory of Computing, STOC 2022 (Associa- tion for Computing Machinery, 2022) p. 375–388

    work page 2022

  37. [37]

    High-threshold and low-overhead fault-tolerant quan- tum memory,

    Sergey Bravyi, Andrew W. Cross, Jay M. Gambetta, Dmitri Maslov, Patrick Rall, and Theodore J. Yoder, “High-threshold and low-overhead fault-tolerant quan- tum memory,” Nature627, 778–782 (2024)

    work page 2024

  38. [38]

    Explicit instances of quantum tan- ner codes,

    Rebecca Katharina Radebold, Stephen D. Bartlett, and Andrew C. Doherty, “Explicit instances of quantum tan- ner codes,” (2025), arXiv:2508.05095 [quant-ph]

    work page arXiv 2025

  39. [39]

    Re- Shape: A Decoder for Hypergraph Product Codes,

    Armanda O. Quintavalle and Earl T. Campbell, “Re- Shape: A Decoder for Hypergraph Product Codes,” IEEE Transactions on Information Theory68, 6569– 6584 (2022)

    work page 2022

  40. [40]

    Partitioning qubits in hypergraph product codes to implement logical gates,

    Armanda O. Quintavalle, Paul Webster, and Michael Vasmer, “Partitioning qubits in hypergraph product codes to implement logical gates,” Quantum7, 1153 (2023)

    work page 2023

  41. [41]

    Distance- preserving stabilizer measurements in hypergraph prod- uct codes,

    Argyris Giannisis Manes and Jahan Claes, “Distance- preserving stabilizer measurements in hypergraph prod- uct codes,” Quantum9, 1618 (2025)

    work page 2025

  42. [42]

    Effective dis- tance of higher dimensional hgps and weight-reduced quantum ldpc codes,

    Shi Jie Samuel Tan and Lev Stambler, “Effective dis- tance of higher dimensional hgps and weight-reduced quantum ldpc codes,” Quantum9, 1897 (2025)

    work page 2025

  43. [43]

    A topological theory for qldpc: non- clifford gates and magic state fountain on homological product codes with constant rate and beyond then1/3 distance barrier,

    Guanyu Zhu, “A topological theory for qldpc: non- clifford gates and magic state fountain on homological product codes with constant rate and beyond then1/3 distance barrier,” (2025), arXiv:2501.19375 [quant-ph]

    work page arXiv 2025

  44. [44]

    Limitations on transversal gates for hypergraph product codes,

    Simon Burton and Dan Browne, “Limitations on transversal gates for hypergraph product codes,” IEEE Transactions on Information Theory68, 1772–1781 (2022)

    work page 2022

  45. [45]

    No-go theorems for logical gates on product quan- tum codes,

    Esther Xiaozhen Fu, Han Zheng, Zimu Li, and Zi-Wen Liu, “No-go theorems for logical gates on product quan- tum codes,” (2025), arXiv:2507.16797 [quant-ph]

    work page arXiv 2025

  46. [46]

    Fast and parallelizable logical computation with homological product codes,

    Qian Xu, Hengyun Zhou, Guo Zheng, Dolev Bluvstein, J. Pablo Bonilla Ataides, Mikhail D. Lukin, and Liang Jiang, “Fast and parallelizable logical computation with homological product codes,” Phys. Rev. X15, 021065 (2025)

    work page 2025

  47. [47]

    High-rate surgery: towards constant-overhead logical operations,

    Guo Zheng, Liang Jiang, and Qian Xu, “High-rate surgery: towards constant-overhead logical operations,” (2025), arXiv:2510.08523 [quant-ph]

    work page arXiv 2025

  48. [49]

    Optimal re- sources for topological two-dimensional stabilizer codes: Comparative study,

    H. Bombin and M. A. Martin-Delgado, “Optimal re- sources for topological two-dimensional stabilizer codes: Comparative study,” Phys. Rev. A76, 012305 (2007)

    work page 2007

  49. [50]

    Homological stabilizer codes,

    Jonas T. Anderson, “Homological stabilizer codes,” (2011), arXiv:1107.3502 [quant-ph]. 29

    work page arXiv 2011

  50. [51]

    Improved quantum hypergraph-product ldpc codes,

    Alexey A. Kovalev and Leonid P. Pryadko, “Improved quantum hypergraph-product ldpc codes,” in2012 IEEE International Symposium on Information Theory Proceedings(2012) pp. 348–352

    work page 2012

  51. [52]

    Low-distance surface codes under realistic quantum noise,

    Yu Tomita and Krysta M. Svore, “Low-distance surface codes under realistic quantum noise,” Phys. Rev. A90, 062320 (2014)

    work page 2014

  52. [53]

    Compare the pair: Rotated vs. unrotated surface codes at equal logical error rates,

    Anthony Ryan O’Rourke and Simon Devitt, “Compare the pair: Rotated vs. unrotated surface codes at equal logical error rates,” (2024), arXiv:2409.14765 [quant- ph]

    work page arXiv 2024

  53. [54]

    Mapping the toric code to the rotated toric code,

    Anthony Leverrier, “Mapping the toric code to the rotated toric code,”https://github.com/ errorcorrectionzoo/eczoo_data/files/9210173/ rotated.pdf(2022)

    work page arXiv 2022

  54. [55]

    Efficientdecoding up to a constant fraction of the code length for asymp- totically good quantum codes,

    AnthonyLeverrierandGillesZémor,“Efficientdecoding up to a constant fraction of the code length for asymp- totically good quantum codes,” ACM Trans. Algorithms 21(2025)

    work page 2025

  55. [56]

    Suppressing quantum errors by scaling a surface code logical qubit,

    Google Quantum AI, “Suppressing quantum errors by scaling a surface code logical qubit,” Nature614, 676–681 (2023)

    work page 2023

  56. [57]

    Quantum error correction below the surface code threshold,

    Google Quantum AI et al., “Quantum error correction below the surface code threshold,” Nature638, 920–926 (2024)

    work page 2024

  57. [58]

    Weight reduction for quantum codes,

    M. B. Hastings, “Weight reduction for quantum codes,” (2016), arXiv:1611.03790 [quant-ph]

    work page arXiv 2016

  58. [59]

    On quantum weight reduction,

    M. B. Hastings, “On quantum weight reduction,” (2023), arXiv:2102.10030 [quant-ph]

    work page arXiv 2023

  59. [60]

    Weight-reduced stabilizer codes with lower overhead,

    Eric Sabo, Lane G. Gunderman, Benjamin Ide, Michael Vasmer, and Guillaume Dauphinais, “Weight-reduced stabilizer codes with lower overhead,” PRX Quantum5, 040302 (2024)

    work page 2024

  60. [61]

    Sim- plified quantum weight reduction with optimal bounds,

    Min-HsiuHsieh, XingjianLi, andTing-ChunLin,“Sim- plified quantum weight reduction with optimal bounds,” (2025), arXiv:2510.09601 [quant-ph]

    work page arXiv 2025

  61. [62]

    Fault tol- erance of quantum low-density parity check codes with sublinear distance scaling,

    Alexey A. Kovalev and Leonid P. Pryadko, “Fault tol- erance of quantum low-density parity check codes with sublinear distance scaling,” Phys. Rev. A87, 020304 (2013)

    work page 2013

  62. [63]

    Adaptive syndrome extraction,

    Noah Berthusen, Shi Jie Samuel Tan, Eric Huang, and Daniel Gottesman, “Adaptive syndrome extraction,” PRX Quantum6, 030307 (2025)

    work page 2025

  63. [64]

    Good quantum error-correcting codes exist,

    A. R. Calderbank and Peter W. Shor, “Good quantum error-correcting codes exist,” Phys. Rev. A54, 1098– 1105 (1996)

    work page 1996

  64. [65]

    Error correcting codes in quantum the- ory,

    A. M. Steane, “Error correcting codes in quantum the- ory,” Phys. Rev. Lett.77, 793–797 (1996)

    work page 1996

  65. [66]

    Multiple-particle interference and quantum error correction,

    Andrew Steane, “Multiple-particle interference and quantum error correction,” Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences452, 2551–2577 (1996), https://royalsocietypublishing.org/rspa/article- pdf/452/1954/2551/998878/rspa.1996.0136.pdf

    work page arXiv 1996

  66. [67]

    Theoretical im- provements in algorithmic efficiency for network flow problems,

    Jack Edmonds and Richard M. Karp, “Theoretical im- provements in algorithmic efficiency for network flow problems,” J. ACM19, 248–264 (1972)

    work page 1972

  67. [68]

    On some techniques useful for solution of transportation network problems,

    N. Tomizawa, “On some techniques useful for solution of transportation network problems,” Networks1, 173–194 (1971)

    work page 1971

  68. [69]

    Computing ef- ficiently in qldpc codes,

    Alexander J. Malcolm, Andrew N. Glaudell, Patri- cio Fuentes, Daryus Chandra, Alexis Schotte, Colby DeLisle, Rafael Haenel, Amir Ebrahimi, Joschka Roffe, Armanda O. Quintavalle, Stefanie J. Beale, Nicholas R. Lee-Hone, and Stephanie Simmons, “Computing ef- ficiently in qldpc codes,” (2025), arXiv:2502.07150 [quant-ph]

    work page arXiv 2025

  69. [70]

    Automor- phism gadgets in homological product codes,

    Noah Berthusen, Michael J. Gullans, Yifan Hong, Maryam Mudassar, and Shi Jie Samuel Tan, “Automor- phism gadgets in homological product codes,” (2025), arXiv:2508.04794 [quant-ph]

    work page arXiv 2025

  70. [71]

    Fold- transversal clifford gates for quantum codes,

    Nikolas P. Breuckmann and Simon Burton, “Fold- transversal clifford gates for quantum codes,” Quantum 8, 1372 (2024)

    work page 2024

  71. [72]

    Leveraging auto- morphisms of quantum codes for fault-tolerant quantum computation,

    Markus Grassl and Martin Roetteler, “Leveraging auto- morphisms of quantum codes for fault-tolerant quantum computation,” in2013 IEEE International Symposium on Information Theory(2013) pp. 534–538

    work page 2013

  72. [73]

    Computation with quantum reed-muller codes and their mapping onto 2d atom arrays,

    Anqi Gong and Joseph M. Renes, “Computation with quantum reed-muller codes and their mapping onto 2d atom arrays,” (2024), arXiv:2410.23263 [quant-ph]

    work page arXiv 2024

  73. [74]

    Entangling logical qubits without physical op- erations,

    Jin Ming Koh, Anqi Gong, Andrei C. Diaconu, DanielBochenTan, AlexandraA.Geim, MichaelJ.Gul- lans, Norman Y. Yao, Mikhail D. Lukin, and Shayan Majidy, “Entangling logical qubits without physical op- erations,” (2026), arXiv:2601.20927 [quant-ph]

    work page arXiv 2026

  74. [75]

    The classification of reversible bit operations,

    Scott Aaronson, Daniel Grier, and Luke Schaeffer, “The classification of reversible bit operations,” (2015), arXiv:1504.05155 [quant-ph]

    work page arXiv 2015

  75. [76]

    Entangling four logical qubits beyond break-even in a nonlocal code,

    Yifan Hong, Elijah Durso-Sabina, David Hayes, and Andrew Lucas, “Entangling four logical qubits beyond break-even in a nonlocal code,” Phys. Rev. Lett.133, 180601 (2024)

    work page 2024

  76. [77]

    Homomorphic logical mea- surements,

    Shilin Huang, Tomas Jochym-O’Connor, and Theodore J. Yoder, “Homomorphic logical mea- surements,” PRX Quantum4, 030301 (2023)

    work page 2023

  77. [78]

    On quasi-cyclic repeat-accumulate codes,

    R. M. Tanner, “On quasi-cyclic repeat-accumulate codes,” inProceedings of the 37th Allerton Conference on Communication, Control, and Computing(Monti- cello, IL, USA, 1999) pp. 249–259

    work page 1999

  78. [79]

    A class of group-structured ldpc codes,

    R. Michael Tanner, Deepak Sridhara, and Tom Fuja, “A class of group-structured ldpc codes,” inProceedings of ISTA(2001) proc. ISTA. 2001

    work page 2001

  79. [80]

    Designing ldpc codes using cyclic shifts,

    T. Okamura, “Designing ldpc codes using cyclic shifts,” inIEEE International Symposium on Information The- ory, 2003. Proceedings.(2003) pp. 151–

    work page 2003

  80. [81]

    Quasicyclic low-density parity-check codes from circulant permutation matrices,

    M.P.C. Fossorier, “Quasicyclic low-density parity-check codes from circulant permutation matrices,” IEEE Transactions on Information Theory50, 1788–1793 (2004)

    work page 2004

Showing first 80 references.