pith. sign in

arxiv: 2605.19298 · v1 · pith:MGA6BTDXnew · submitted 2026-05-19 · 🪐 quant-ph · cond-mat.str-el

Translation-invariant quantum low-density parity-check codes from compactified fracton models

Cassandra M. Hopkin , Victor V. Albert , Dominic J. Williamson This is my paper

Pith reviewed 2026-05-20 06:25 UTC · model grok-4.3

classification 🪐 quant-ph cond-mat.str-el
keywords quantum error correctionLDPC codesfracton modelstranslation-invariant codesbivariate bicycle codescompactificationhypergraph productA2BGA codes
0
0 comments X

The pith

A higher-dimensional fracton model serves as the common parent for many translation-invariant 2D quantum codes, including all bivariate bicycle codes of fixed check weight.

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

Quantum error-correcting codes that are both translation-invariant and low-density parity-check are desirable for hardware implementation, yet a unifying construction for the local and long-range families has been missing. The paper establishes that the balanced product structure underlying Abelian Two-Block Group Algebra codes produces a local hypergraph-product fracton model in higher dimensions. Compactifying this parent in different ways then yields the observed variety of two-dimensional descendants. In particular, every bivariate bicycle code with a given check weight descends from the same parent. The construction also carries over existing parameter bounds and suggests that logical gates and energy barriers are inherited from the higher-dimensional model.

Core claim

The balanced product structure of A2BGA codes leads to a local parent code that is a hypergraph product fracton model in a higher dimension. Different compactifications of a parent code produce a wide variety of descendant codes which provides a unifying picture for their properties. In particular, all BB codes with the same check weight are derived from a single parent hypergraph product fracton model. This construction allows us to extend Wang and Pryadko's code-parameter bounds for Generalized Bicycle codes to A2BGA codes. We conjecture that the transversal gates and energy barriers of the translation-invariant descendant codes are limited by those of their parent fracton models.

What carries the argument

The balanced product construction applied to A2BGA codes, which produces a higher-dimensional hypergraph product fracton model as the local parent from which lower-dimensional descendants are obtained by compactification.

If this is right

  • All bivariate bicycle codes sharing the same check weight descend from one common higher-dimensional parent fracton model.
  • Code-parameter bounds previously known for generalized bicycle codes extend directly to the larger family of A2BGA codes.
  • Transversal gates realizable in the two-dimensional descendants are restricted to those already present in the parent fracton model.
  • Energy barriers of the compactified codes are bounded above by the barriers of their higher-dimensional parents.

Where Pith is reading between the lines

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

  • Choosing different compactification maps on the same parent may systematically generate new families of translation-invariant codes with prescribed properties.
  • The unification could link previously separate constructions of fracton models to other stabilizer codes that admit translation symmetry.
  • Numerical checks of small instances could test whether transversal gate sets in known bivariate bicycle codes match those of their conjectured parents.

Load-bearing premise

The properties of the higher-dimensional parent fracton model are inherited or strictly limit those of the compactified two-dimensional descendants without further assumptions on the compactification map or the resulting stabilizer structure.

What would settle it

An explicit A2BGA code whose stabilizer structure or logical operators cannot be recovered from any compactification of a higher-dimensional hypergraph product fracton model, or whose energy barrier exceeds that of every candidate parent.

Figures

Figures reproduced from arXiv: 2605.19298 by Cassandra M. Hopkin, Dominic J. Williamson, Victor V. Albert.

Figure 1
Figure 1. Figure 1: FIG. 1: A classical code generated by the polynomial [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2: Twisted boundary conditions on a 2D lattice [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3: The three fracton family trees that arise in [PITH_FULL_IMAGE:figures/full_fig_p008_3.png] view at source ↗
read the original abstract

Quantum error-correcting codes with translation symmetry and local checks have been studied extensively, leading to a wide variety of fracton codes in three or more dimensions which lack a complete unifying picture. Recently, the study of translation-invariant codes with long-range checks has revealed impressive performance for small fixed-size instances in two dimensions. Here, we provide a unifying picture for a large family of translation-invariant codes, both local and long-range, that captures many fracton codes and all Abelian Two-Block Group Algebra (A2BGA) codes, including the Bivariate Bicycle (BB) codes. The balanced product structure of A2BGA codes leads to a local parent code that is a hypergraph product fracton model in a higher dimension. Different compactifications of a parent code produce a wide variety of descendant codes which provides a unifying picture for their properties. In particular, all BB codes with the same check weight are derived from a single parent hypergraph product fracton model. This construction allows us to extend Wang and Pryadko's code-parameter bounds for Generalized Bicycle codes to A2BGA codes. We conjecture that the transversal gates and energy barriers of the translation-invariant descendant codes are limited by those of their parent fracton models.

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

2 major / 2 minor

Summary. The manuscript constructs a unifying framework for translation-invariant quantum LDPC codes by showing that A2BGA codes, including all same-check-weight BB codes, arise as different compactifications of a single higher-dimensional hypergraph-product fracton parent code obtained from the balanced-product structure. It extends Wang-Pryadko bounds to A2BGA codes and conjectures that transversal gates and energy barriers of the 2D descendants are limited by those of the parent.

Significance. If the compactification map and inheritance claims hold, the work supplies a concrete organizing principle that relates local fracton models to long-range 2D codes and explains shared properties across families. The explicit extension of parameter bounds is a verifiable advance; the parent-descendant picture, once the map is fully specified, could streamline future code design.

major comments (2)
  1. [§3] §3 (Construction): the claim that compactification preserves or strictly bounds the minimum weight of logical strings and the support of transversal gates is stated as a conjecture without an explicit general argument or even one fully worked example showing how a higher-dimensional stabilizer descends to a 2D check while keeping the logical-operator weight lower bound intact. This step is load-bearing for both the unifying picture and the conjecture on inherited properties.
  2. [§4.1] §4.1 (BB codes from single parent): the assertion that all BB codes of fixed check weight descend from one hypergraph-product fracton model requires a concrete mapping (e.g., explicit choice of compactification directions and resulting stabilizer generators) for at least two distinct BB instances to verify that no new low-weight logical operators are introduced by the compactification.
minor comments (2)
  1. [§3] The notation for the compactification map (e.g., the precise quotient or identification rules) is introduced only after several examples; moving a clear definition to the beginning of §3 would improve readability.
  2. [Figure 2] Figure 2 caption should state the lattice size and boundary conditions used for the depicted parent and descendant codes.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments on our manuscript. We address each major comment below and have revised the manuscript to incorporate additional explicit details where requested.

read point-by-point responses

  1. Referee: [§3] §3 (Construction): the claim that compactification preserves or strictly bounds the minimum weight of logical strings and the support of transversal gates is stated as a conjecture without an explicit general argument or even one fully worked example showing how a higher-dimensional stabilizer descends to a 2D check while keeping the logical-operator weight lower bound intact. This step is load-bearing for both the unifying picture and the conjecture on inherited properties.

    Authors: We agree that the inheritance of minimum logical weights and transversal gate supports under compactification is presented as a conjecture in the original manuscript, and a complete general proof is not provided. In the revised version we have added a fully worked example in §3 that explicitly traces the descent of one higher-dimensional stabilizer generator to its 2D descendant check under a specific compactification, confirming that the logical-operator weight lower bound is preserved in that case. This example illustrates the mechanism supporting the unifying picture while leaving the general statement as a conjecture, as originally indicated. revision: yes

  2. Referee: [§4.1] §4.1 (BB codes from single parent): the assertion that all BB codes of fixed check weight descend from one hypergraph-product fracton model requires a concrete mapping (e.g., explicit choice of compactification directions and resulting stabilizer generators) for at least two distinct BB instances to verify that no new low-weight logical operators are introduced by the compactification.

    Authors: We have added the requested concrete mappings in the revised §4.1. For two distinct BB codes of the same check weight we now specify the compactification directions, list the resulting stabilizer generators after compactification, and verify that the logical operators remain those inherited from the common parent without the introduction of new low-weight operators. These explicit instances support the general claim that all such BB codes descend from a single parent model. revision: yes

Circularity Check

0 steps flagged

No circularity: forward construction from balanced products to compactified descendants

full rationale

The derivation begins with the known balanced-product structure of A2BGA codes to define a higher-dimensional hypergraph-product fracton parent, then introduces compactification maps to generate descendant codes including all same-weight BB codes. This is a constructive mapping that unifies existing families rather than any step in which a claimed prediction, bound, or property is obtained by fitting to or renaming the target output. The extension of Wang-Pryadko bounds is an application of the new framework to external results, and the conjecture on inherited gates and barriers is explicitly labeled as such without being used to close the derivation. No self-citation is load-bearing for the central claims, and the compactification step supplies independent content.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The construction rests on the standard definition of hypergraph-product codes and the balanced-product structure of A2BGA codes, both taken from prior literature; no new free parameters or invented entities are introduced in the abstract.

axioms (2)
  • domain assumption Hypergraph product of two classical codes yields a fracton model with local stabilizers in three or more dimensions.
    Invoked when the parent code is identified as a hypergraph product fracton model.
  • domain assumption Compactification along one or more directions preserves translation invariance and the stabilizer structure of the descendant code.
    Central to the claim that different compactifications produce the family of descendant codes.

pith-pipeline@v0.9.0 · 5756 in / 1527 out tokens · 34911 ms · 2026-05-20T06:25:02.926158+00:00 · methodology

discussion (0)

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

Reference graph

Works this paper leans on

81 extracted references · 81 canonical work pages · 7 internal anchors

  1. [1]

    Kitaev, Fault-tolerant quantum computation by anyons, Annals of Physics303, 2–30 (2003)

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

    work page 2003

  2. [2]

    Chamon, Quantum glassiness in strongly correlated clean systems: An example of topological overprotection, Physical Review Letters94, 10.1103/physrevlett.94.040402 (2005)

    C. Chamon, Quantum glassiness in strongly correlated clean systems: An example of topological overprotection, Physical Review Letters94, 10.1103/physrevlett.94.040402 (2005)

    work page doi:10.1103/physrevlett.94.040402 2005

  3. [3]

    A. Dua, I. H. Kim, M. Cheng, and D. J. Williamson, Sorting topological stabilizer models in three dimensions, Physical Review B100, 10.1103/physrevb.100.155137 (2019)

    work page doi:10.1103/physrevb.100.155137 2019

  4. [5]

    Muller, S

    S. Bravyi and J. Haah, Quantum self-correction in the 3d cubic code model, Physical Review Letters111, 10.1103/phys- revlett.111.200501 (2013)

    work page doi:10.1103/phys- 2013

  5. [6]

    R. M. Nandkishore and M. Hermele, Fractons, Annual Review of Condensed Matter Physics10, 295–313 (2019)

    work page 2019

  6. [7]

    Z. Song, A. Dua, W. Shirley, and D. J. Williamson, Topological defect network representations of fracton stabilizer codes, PRX Quantum4, 10.1103/prxquantum.4.010304 (2023)

    work page doi:10.1103/prxquantum.4.010304 2023

  7. [8]

    Aasen, D

    D. Aasen, D. Bulmash, A. Prem, K. Slagle, and D. J. Williamson, Topological defect networks for fractons of all types, Physical Review Research2, 10.1103/physrevresearch.2.043165 (2020)

    work page doi:10.1103/physrevresearch.2.043165 2020

  8. [9]

    Pai and M

    S. Pai and M. Hermele, Fracton fusion and statistics, Physical Review B100, 10.1103/physrevb.100.195136 (2019)

    work page doi:10.1103/physrevb.100.195136 2019

  9. [10]

    Wickenden, M

    E. Wickenden, M. Qi, A. Dua, and M. Hermele, Planon-modular fracton orders, Physical Review B112, 10.1103/wg39-vjwc (2025)

    work page doi:10.1103/wg39-vjwc 2025

  10. [11]

    Excitation-detector principle and the algebraic theory of planon-only abelian fracton orders

    E. Wickenden, W. Shirley, A. Beaudry, and M. Hermele, Excitation-detector principle and the algebraic theory of planon- only abelian fracton orders (2025), arXiv:2506.21773 [cond-mat.str-el]

    work page internal anchor Pith review Pith/arXiv arXiv 2025

  11. [12]

    H. Song, N. Tantivasadakarn, W. Shirley, and M. Hermele, Fracton self-statistics, Physical Review Letters132, 10.1103/physrevlett.132.016604 (2024)

    work page doi:10.1103/physrevlett.132.016604 2024

  12. [13]

    Slagle, D

    K. Slagle, D. Aasen, and D. Williamson, Foliated field theory and string-membrane-net condensation picture of fracton order, SciPost Physics6, 10.21468/scipostphys.6.4.043 (2019)

    work page doi:10.21468/scipostphys.6.4.043 2019

  13. [14]

    Y. Tan, B. Roberts, N. Tantivasadakarn, B. Yoshida, and N. Y. Yao, Fracton models from product codes (2024), arXiv:2312.08462 [quant-ph]

    work page arXiv 2024

  14. [15]

    Tillich and G

    J.-P. Tillich and G. Zemor, Quantum ldpc codes with positive rate and minimum distance proportional to the square root of the blocklength, IEEE Transactions on Information Theory60, 1193–1202 (2014)

    work page 2014

  15. [16]

    Li and Y

    M.-Y. Li and Y. Wu, Fragmented topological excitations in generalized hypergraph product codes (2026), arXiv:2601.09850 [quant-ph]

    work page arXiv 2026

  16. [17]

    A. Dua, D. J. Williamson, J. Haah, and M. Cheng, Compactifying fracton stabilizer models, Physical Review B99, 10.1103/physrevb.99.245135 (2019)

    work page doi:10.1103/physrevb.99.245135 2019

  17. [18]

    Liang, K

    Z. Liang, K. Liu, H. Song, and Y.-A. Chen, Generalized toric codes on twisted tori for quantum error correction (2025), arXiv:2503.03827 [quant-ph]

    work page arXiv 2025

  18. [19]

    B. C. B. Symons, A. Rajput, and D. E. Browne, Sequences of bivariate bicycle codes from covering graphs (2025), arXiv:2511.13560 [quant-ph]

    work page arXiv 2025

  19. [20]

    Wang, H.-K

    R. Wang, H.-K. Lin, and L. P. Pryadko, Abelian and non-abelian quantum two-block codes (2023), arXiv:2305.06890 [quant-ph]

    work page arXiv 2023

  20. [21]

    Lin and L

    H.-K. Lin and L. P. Pryadko, Quantum two-block group algebra codes (2023), arXiv:2306.16400 [quant-ph]

    work page arXiv 2023

  21. [22]

    Panteleev and G

    P. Panteleev and G. Kalachev, Degenerate quantum ldpc codes with good finite length performance, Quantum5, 585 (2021)

    work page 2021

  22. [23]

    Bravyi, A

    S. Bravyi, A. W. Cross, J. M. Gambetta, D. Maslov, P. Rall, and T. J. Yoder, High-threshold and low-overhead fault- tolerant quantum memory, Nature627, 778–782 (2024)

    work page 2024

  23. [24]

    Yoshida, Exotic topological order in fractal spin liquids, Physical Review B88, 10.1103/physrevb.88.125122 (2013)

    B. Yoshida, Exotic topological order in fractal spin liquids, Physical Review B88, 10.1103/physrevb.88.125122 (2013)

    work page doi:10.1103/physrevb.88.125122 2013

  24. [25]

    M. E. J. Newman and C. Moore, Glassy dynamics and aging in an exactly solvable spin model, Phys. Rev. E60, 5068 (1999)

    work page 1999

  25. [26]

    Haah, Commuting pauli hamiltonians as maps between free modules, Communications in Mathematical Physics324, 351–399 (2013)

    J. Haah, Commuting pauli hamiltonians as maps between free modules, Communications in Mathematical Physics324, 351–399 (2013)

    work page 2013

  26. [27]

    Wang and L

    R. Wang and L. P. Pryadko, Distance bounds for generalized bicycle codes (2022), arXiv:2203.17216 [quant-ph]

    work page arXiv 2022

  27. [28]

    Bravyi, D

    S. Bravyi, D. Poulin, and B. Terhal, Tradeoffs for reliable quantum information storage in 2d systems, Physical Review Letters104, 10.1103/physrevlett.104.050503 (2010)

    work page doi:10.1103/physrevlett.104.050503 2010

  28. [29]

    L. Wang, A. Z. Liu, R. Li, A. Kubica, and S. Gu, Check-weight-constrained quantum codes: Bounds and examples (2026), arXiv:2601.15446 [quant-ph]

    work page arXiv 2026

  29. [30]

    X. Fu, H. Zheng, Z. Li, and Z.-W. Liu, No-go theorems for logical gates on product quantum codes (2025), arXiv:2507.16797 [quant-ph]

    work page arXiv 2025

  30. [31]

    M. B. Hastings, Quantum codes from high-dimensional manifolds (2016), arXiv:1608.05089 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2016

  31. [32]

    Freedman and M

    M. Freedman and M. B. Hastings, Building manifolds from quantum codes (2021), arXiv:2012.02249 [math.DG]

    work page arXiv 2021

  32. [33]

    Roberts, J

    B. Roberts, J. M. Koh, Y. Tan, and N. Y. Yao, Cored product codes for quantum self-correction in three dimensions (2025), arXiv:2510.05479 [quant-ph]

    work page arXiv 2025

  33. [34]

    C. G. Brell, A proposal for self-correcting stabilizer quantum memories in 3 dimensions (or slightly less), New Journal of Physics18, 013050 (2016). 14

    work page 2016

  34. [35]

    Lin, H.-P

    T.-C. Lin, H.-P. Wang, and M.-H. Hsieh, Proposals for 3d self-correcting quantum memory (2024), arXiv:2411.03115 [quant-ph]

    work page arXiv 2024

  35. [36]

    Stabilizer Codes and Quantum Error Correction

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

    work page internal anchor Pith review Pith/arXiv arXiv 1997

  36. [37]

    A. R. Calderbank, E. M. Rains, P. W. Shor, and N. J. Sloane, Quantum error correction and orthogonal geometry, Physical Review Letters78, 405 (1997)

    work page 1997

  37. [38]

    A. R. Calderbank and P. W. Shor, Good quantum error-correcting codes exist, Physical Review A54, 1098 (1996)

    work page 1996

  38. [39]

    A. M. Steane, Error correcting codes in quantum theory, Physical Review Letters77, 793 (1996)

    work page 1996

  39. [40]

    Steane, Multiple-particle interference and quantum error correction, Proceedings of the Royal Society of London

    A. Steane, Multiple-particle interference and quantum error correction, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences452, 2551 (1996)

    work page 1996

  40. [41]

    Lattice quantum codes and exotic topological phases of matter

    J. Haah, Lattice quantum codes and exotic topological phases of matter (2013), arXiv:1305.6973 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2013

  41. [43]

    Liang, Y

    Z. Liang, Y. Xu, J. T. Iosue, and Y.-A. Chen, Extracting topological orders of generalized pauli stabilizer codes in two dimensions, PRX Quantum5, 10.1103/prxquantum.5.030328 (2024)

    work page doi:10.1103/prxquantum.5.030328 2024

  42. [44]

    Vijay, J

    S. Vijay, J. Haah, and L. Fu, Fracton topological order, generalized lattice gauge theory, and duality, Physical Review B 94, 10.1103/physrevb.94.235157 (2016)

    work page doi:10.1103/physrevb.94.235157 2016

  43. [45]

    D. J. Williamson, Fractal symmetries: Ungauging the cubic code, Physical Review B94, 10.1103/physrevb.94.155128 (2016)

    work page doi:10.1103/physrevb.94.155128 2016

  44. [46]

    I. H. Kim and J. Haah, Localization from superselection rules in translationally invariant systems, Physical Review Letters 116, 10.1103/physrevlett.116.027202 (2016)

    work page doi:10.1103/physrevlett.116.027202 2016

  45. [47]

    A. Prem, J. Haah, and R. Nandkishore, Glassy quantum dynamics in translation invariant fracton models, Physical Review B95, 10.1103/physrevb.95.155133 (2017)

    work page doi:10.1103/physrevb.95.155133 2017

  46. [48]

    Prem, S.-J

    A. Prem, S.-J. Huang, H. Song, and M. Hermele, Cage-net fracton models, Physical Review X9, 10.1103/physrevx.9.021010 (2019)

    work page doi:10.1103/physrevx.9.021010 2019

  47. [49]

    D. J. Williamson and M. Cheng, Designer non-abelian fractons from topological layers, Physical Review B107, 10.1103/physrevb.107.035103 (2023)

    work page doi:10.1103/physrevb.107.035103 2023

  48. [50]

    Bulmash and M

    D. Bulmash and M. Barkeshli, Gauging fractons: Immobile non-abelian quasiparticles, fractals, and position-dependent degeneracies, Physical Review B100, 10.1103/physrevb.100.155146 (2019)

    work page doi:10.1103/physrevb.100.155146 2019

  49. [51]

    Prem and D

    A. Prem and D. Williamson, Gauging permutation symmetries as a route to non-abelian fractons, SciPost Physics7, 10.21468/scipostphys.7.5.068 (2019)

    work page doi:10.21468/scipostphys.7.5.068 2019

  50. [52]

    http://www.w3.org/1998/math/mathml

    P. Gorantla, A. Prem, N. Tantivasadakarn, and D. J. Williamson, String membrane nets from higher-form gauging: An alternate route to ¡mml:math xmlns:mml=“http://www.w3.org/1998/math/mathml”¿¡mml:mi¿p¡/mml:mi¿¡/mml:math¿ -string condensation, Physical Review B112, 10.1103/qq9n-16hk (2025)

    work page doi:10.1103/qq9n-16hk 1998

  51. [53]

    Devakul and D

    T. Devakul and D. J. Williamson, Fractalizing quantum codes, Quantum5, 438 (2021)

    work page 2021

  52. [54]

    K. P. Michnicki, 3d topological quantum memory with a power-law energy barrier, Physical Review Letters113, 10.1103/physrevlett.113.130501 (2014)

    work page doi:10.1103/physrevlett.113.130501 2014

  53. [55]

    Siva and B

    K. Siva and B. Yoshida, Topological order and memory time in marginally-self-correcting quantum memory, Physical Review A95, 10.1103/physreva.95.032324 (2017)

    work page doi:10.1103/physreva.95.032324 2017

  54. [56]

    D. J. Williamson and N. Baspin, Layer codes, Nature Communications15, 10.1038/s41467-024-53881-3 (2024)

    work page doi:10.1038/s41467-024-53881-3 2024

  55. [57]

    D. J. Williamson, Partial self-correction in layer codes (2025), arXiv:2510.09218 [quant-ph]

    work page arXiv 2025

  56. [58]

    S. Gu, L. Caha, S. H. Choe, Z. He, A. Kubica, and E. Tang, Layer codes as partially self-correcting quantum memories (2025), arXiv:2510.06659 [quant-ph]

    work page arXiv 2025

  57. [59]

    B. J. Brown and D. J. Williamson, Parallelized quantum error correction with fracton topological codes, Physical Review Research2, 10.1103/physrevresearch.2.013303 (2020)

    work page doi:10.1103/physrevresearch.2.013303 2020

  58. [60]

    Schwartzman-Nowik and B

    Z. Schwartzman-Nowik and B. J. Brown, Generalizing the matching decoder for the chamon code, Quantum9, 1775 (2025)

    work page 2025

  59. [61]

    J. F. S. Miguel, D. J. Williamson, and B. J. Brown, A cellular automaton decoder for a noise-bias tailored color code, Quantum7, 940 (2023)

    work page 2023

  60. [62]

    N. P. Breuckmann and J. N. Eberhardt, Balanced product quantum codes, IEEE Transactions on Information Theory67, 6653–6674 (2021)

    work page 2021

  61. [64]

    Haah, Algebraic methods for quantum codes on lattices, Revista Colombiana de Matem´ aticas50, 299 (2017)

    J. Haah, Algebraic methods for quantum codes on lattices, Revista Colombiana de Matem´ aticas50, 299 (2017)

    work page 2017

  62. [65]

    Pastawski and B

    F. Pastawski and B. Yoshida, Fault-tolerant logical gates in quantum error-correcting codes, Physical Review A91, 10.1103/physreva.91.012305 (2015)

    work page doi:10.1103/physreva.91.012305 2015

  63. [66]

    S. J. Devitt, W. J. Munro, and K. Nemoto, Quantum error correction for beginners, Reports on Progress in Physics76, 076001 (2013)

    work page 2013

  64. [67]

    Bravyi and R

    S. Bravyi and R. K¨ onig, Classification of topologically protected gates for local stabilizer codes, Physical Review Letters 110, 10.1103/physrevlett.110.170503 (2013)

    work page doi:10.1103/physrevlett.110.170503 2013

  65. [68]

    G. Zhao, A. C. Doherty, and I. H. Kim, Energy barrier of hypergraph product codes, Physical Review Letters134, 10.1103/physrevlett.134.180601 (2025)

    work page doi:10.1103/physrevlett.134.180601 2025

  66. [69]

    D. J. Williamson and T. J. Yoder, Low-overhead fault-tolerant quantum computation by gauging logical operators, Nature Physics22, 598–603 (2026)

    work page 2026

  67. [70]

    B. Ide, M. G. Gowda, P. J. Nadkarni, and G. Dauphinais, Fault-tolerant logical measurements via homological measurement, Physical Review X15, 10.1103/physrevx.15.021088 (2025). 15

    work page doi:10.1103/physrevx.15.021088 2025

  68. [71]

    A. C. Yuan, A. Cowtan, Z. He, T.-C. Lin, and D. J. Williamson, Parsimonious quantum low-density parity-check code surgery (2026), arXiv:2603.05082 [quant-ph]

    work page arXiv 2026

  69. [72]

    I. H. Kim, 3d local qupit quantum code without string logical operator (2012), arXiv:1202.0052 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2012

  70. [73]

    Sahay, D

    K. Sahay, D. J. Williamson, and B. J. Brown, A matching decoder for bivariate bicycle codes (2026), arXiv:2602.22770 [quant-ph]

    work page arXiv 2026

  71. [74]

    S. J. S. Tan, I. Gill, E. Huang, P. Liu, C. Zhao, H. Dehghani, A. Kubica, H. Zhou, and A. Dua, Generalized matching decoders for 2d topological translationally-invariant codes (2026), arXiv:2603.05402 [quant-ph]

    work page arXiv 2026

  72. [75]

    Coupled-Layer Construction of Quantum Product Codes

    S. Zhang, T.-C. Wei, and N. Tantivasadakarn, Coupled-layer construction of quantum product codes (2026), arXiv:2603.08711 [quant-ph]

    work page internal anchor Pith review Pith/arXiv arXiv 2026

  73. [76]

    Rakovszky and V

    T. Rakovszky and V. Khemani, The physics of (good) ldpc codes i. gauging and dualities (2023), arXiv:2310.16032 [quant- ph]

    work page arXiv 2023

  74. [77]

    Rakovszky and V

    T. Rakovszky and V. Khemani, The physics of (good) ldpc codes ii. product constructions (2024), arXiv:2402.16831 [quant-ph]

    work page arXiv 2024

  75. [78]

    T. H. Hsieh and G. B. Hal´ asz, Fractons from partons, Physical Review B96, 10.1103/physrevb.96.165105 (2017)

    work page doi:10.1103/physrevb.96.165105 2017

  76. [79]

    D. J. Williamson and T. Devakul, Type-ii fractons from coupled spin chains and layers, Physical Review B103, 10.1103/physrevb.103.155140 (2021)

    work page doi:10.1103/physrevb.103.155140 2021

  77. [80]

    Steffan, S

    V. Steffan, S. H. Choe, N. P. Breuckmann, F. R. F. Pereira, and J. N. Eberhardt, Tile codes: High-efficiency quantum codes on a lattice with boundary (2025), arXiv:2504.09171 [quant-ph]

    work page arXiv 2025

  78. [81]

    C. T. Aitchison, D. Bulmash, A. Dua, A. C. Doherty, and D. J. Williamson, Boundaries and defects in the cubic code, Physical Review B109, 10.1103/physrevb.109.205125 (2024)

    work page doi:10.1103/physrevb.109.205125 2024

  79. [82]

    Haah, Bifurcation in entanglement renormalization group flow of a gapped spin model, Physical Review B89, 10.1103/physrevb.89.075119 (2014)

    J. Haah, Bifurcation in entanglement renormalization group flow of a gapped spin model, Physical Review B89, 10.1103/physrevb.89.075119 (2014)

    work page doi:10.1103/physrevb.89.075119 2014

  80. [83]

    A. Dua, P. Sarkar, D. J. Williamson, and M. Cheng, Bifurcating entanglement-renormalization group flows of fracton stabilizer models, Physical Review Research2, 10.1103/physrevresearch.2.033021 (2020)

    work page doi:10.1103/physrevresearch.2.033021 2020

Showing first 80 references.