Pith. sign in

REVIEW 5 minor 86 references

Coupled-Layer Codes: Beyond Quantum Product Constructions

T0 review · 0 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper claims that coupled-layer codes, defined by condensing arbitrary Pauli excitations across stacks via an excitation algebra and an algebra-preserving map, unify quantum product codes with coupled-layer models of topological…

desk verdict A genuinely unifying coupled-layer framework with a new Hadamard-twisted balanced product that reproduces X-cube, Chamon, the fermionic toric code, and 3-fermion Walker-Wang; the disjoint-support assumption in the general construction is real but disclosed, and it does not threaten the concrete examples. read the letter →

arxiv 2608.10069 v1 pith:AAHL2SW3 submitted 2026-08-10 quant-ph cond-mat.str-el

Shuyu Zhang , Tzu-Chieh Wei , Nathanan Tantivasadakarn This is my paper · ORCID
classification quant-phcond-mat.str-el MSC 81P7081P68 PACS 03.67.Pp
keywords coupled-layercodesquantumproductstabilizerexcitationcondensationmappingconebalancedfermionictoriccodeWalker-Wangmodel
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

This paper argues that a single construction, coupled-layer codes, contains both quantum product codes and many coupled-layer models of topological phases, and extends both. The idea is to stack many copies of one code, one per qubit of a second code, then enforce new stabilizers that condense chosen Pauli excitations across layers, with the second code's checks dictating which combinations to condense. The condensation data is organized as an excitation algebra plus an algebra-preserving map, which works even when the inputs are not CSS codes. Because the formalism does not require a chain-complex description, it can produce non-CSS stabilizer codes; the authors demonstrate this by reproducing the X-cube model, the Chamon and XYZ product codes, the three-dimensional fermionic toric code, and a family containing the 3-fermion Walker-Wang model. If correct, the construction supplies a common origin for tensor products, balanced products, gauging, and mapping cones in one framework.

What carries the argument

The load-bearing object is the excitation algebra: the operator algebra generated by the stabilizers of the first code together with a chosen set of Pauli excitations, paired with an algebra-preserving map that sends each generator to a Pauli operator on an auxiliary system while preserving commutation relations. This is the operator-level form of the mapping cone from homological algebra, and it replaces the chain-complex description when the input code is not CSS. The second code enters only as a recipe: for each of its stabilizers and for each qubit in that stabilizer, the corresponding image under the algebra-preserving map and the excitation in one layer are multiplied to form the code-switching term; commutativity of the second code's stabilizers guarantees these terms are compatible. In the balanced version the same data is combined with a free group action whose unitary part may be a Hadamard, which is what converts CSS inputs into non-CSS codes.

What would settle it

Take the balanced coupled-layer construction with the 2D toric code as the stacked code and a repetition code as the recipe, choose a group action by translation, and pick two excitations whose supports are not mutually disjoint but are freely permuted by the group. Compute the commutator of the two code-switching terms A(e, f) and A(e', f). A nonvanishing phase would show that the disjoint-support condition is essential; universal vanishing would show Lemmas 3 through 6 are stronger than stated.

Watch

Extended reading notes

Core claim

The paper's central claim is that any coupled-layer condensation of Pauli excitations is specified by an excitation algebra and an algebra-preserving map, and that this data alone defines a valid stabilizer code when the second code's stabilizers commute. This formulation makes the old coupled-layer realization of tensor and balanced product codes a special case: choose single-Pauli X and Z excitations and the usual gauging maps. More importantly, the same recipe works without CSS structure, so condensing general excitations yields codes such as the X-cube and Chamon models. The paper further generalizes the quotient and balancing step by allowing the group action to include an onsite Hadamard, an e-m symmetry swapping X and Z; balancing by this symmetry turns CSS inputs into non-CSS outputs, recovering the 3D fermionic toric code and a family whose second member is the 3-fermion Walker-Wang model. The culmination is the balanced coupled-layer code, which combines general excitation condensates with permutation-plus-unitary group actions and reduces to the ordinary balanced product when the action is a free permutation and the excitations are single Pauli operators.

Load-bearing premise

The most load-bearing premise is that the excitations condensed in the balanced coupled-layer code have mutually disjoint supports that the group freely permutes, because Appendix C's proof that the code-switching terms commute relies on this disjointness.

Editorial extensions

If this is right

  • Tensor and balanced product codes are special cases of coupled-layer codes, so any property proved for the general condensation construction applies to those product families.
  • Condensing general excitations rather than single-Pauli operators can create fracton-type codes: the framework reproduces the X-cube model and the Chamon and quantum XYZ product codes.
  • Allowing a Hadamard in the balancing group action yields genuinely non-CSS codes from CSS inputs, including the 3D fermionic toric code and the family containing the 3-fermion Walker-Wang model.
  • The CSS coupled-layer code admits a logical-operator count under the assumptions stated in Appendix A, giving a way to compute the code dimension.
  • The construction supplies an explicit dictionary between gauging, partial gauging, and lattice-surgery-type operations and coupled-layer condensation, so those operations appear as special cases of one code-switching step.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The disjoint-support condition on excitations looks like the true boundary of the construction: if overlapping excitation supports can still be condensed consistently, the resulting codes would go beyond the paper's framework and could have better parameters; searching for such examples is a natural next step.
  • The e-m quotient of the 4D toric code producing the fermionic toric code suggests a physical interpretation the authors leave implicit: compactifying the 4D toric code with an e-m duality defect inserted should realize the same fermionic phase, and a braiding or statistics calculation on the resulting model would test this.
  • The paper's fiber-bundle remark points toward a sheaf-theoretic reformulation in which the coupled-layer code is a fiber bundle over the second code with the first code as fiber; formalizing that view could yield a parameter-counting tool and could streamline the Appendix C calculations.
  • Because the authors do not analyze code parameters, an immediate testable extension is to vary the excitation algebra and algebra-preserving map to see whether the distance can be pushed beyond the constant-distance examples found in the 4D example of Section III D.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

0 major / 5 minor

Summary. This paper introduces coupled-layer codes, a family of stabilizer-code constructions that start from a stack of copies of a first code and couple the layers with checks of a second code, condensing general Pauli excitations rather than only single-X/single-Z excitations. Three interrelated constructions are developed: (i) CSS coupled-layer codes based on mapping cones and partial gauging (Sec. III), reproducing X-cube and a 4D code; (ii) non-CSS coupled-layer codes defined through excitation algebras and algebra-preserving maps (Sec. IV), reproducing the Chamon model and the quantum XYZ product; and (iii) a generalized quotient and e'm balanced product in which a ZX-duality (Hadamard twist) accompanies the group action (Secs. V-VI), reproducing the 3D fermionic toric code and the 3-fermion Walker-Wang family. Section VII presents a balanced coupled-layer code intended to combine (ii) and (iii), with commutativity of the code-switching terms proven in Appendix C under a disjoint-support assumption. Appendix A counts logicals under stated surjectivity assumptions, and Appendix B relates e'm balancing to symplectic doubling.

Significance. The main contribution is a common framework in which product constructions and several topological and fracton models become instances of one condensation procedure. If the claims are correct, the framework connects code switching with gauging, mapping cones, and non-CSS topological phases. The strengths are substantial: the stabilizer groups for all the reproduced models are written out explicitly; the logical count in Appendix A is carried out under transparent assumptions; the relation to symplectic doubling is made precise; and no parameters are fitted or target results assumed. The paper is also unusually candid about its limitations, including the constant-distance 4D example, the absence of a low-dimensional example exercising both general excitations and unitary-twisted group actions, and the disjoint-support assumption in Sec. VII. The stress-test concern about that assumption is real but contained: every concrete example instantiating Sec. VII or Sec. VI uses single-Pauli or automatically disjoint excitations, so the reproduced codes are not affected; the limitation concerns the breadth of the unification claim rather than the validity of the central examples.

minor comments (5)
  1. [Sec. II.A] In the first paragraph of Sec. II.A, 'ccohain complex' should be 'cochain complex'; please also rephrase the sentence beginning 'We always place the qubits...' so that the figure reference and the degree-zero convention are stated clearly.
  2. [Sec. VII and App. C] The disjoint-support condition in Sec. VII is stated as 'the supports of e^{(\tilde{f})} to be mutually disjoint and freely permuted by G,' which is ambiguous: Appendix C, Lemma 6 uses disjointness globally across different excitation sets E^{\tilde{f}} and E^{\tilde{f}'}. Please state the global version explicitly and add a remark that the plaquette excitations used in the X-cube example overlap on shared edges, so that construction is not literally an instance of the Sec. VII balanced coupled-layer construction with general excitations.
  3. [Sec. III.D] The statement that adding the two weight-5 logicals as stabilizers results in a code with distance linear in the system size is given without proof or reference; please provide a short argument or cite a place where this is established.
  4. [Sec. VI.C] The claim that on a three-torus the constructed code has 3 logicals if n is odd and 0 logicals if n is even is stated without derivation; please justify it by an explicit lattice calculation or a precise citation to the Walker-Wang literature.
  5. [Sec. V, Eq. (10)] The definition of \tilde{s}_G involves a product over operators that may become non-commuting single-qubit Pauli operators on a quotient qubit after conjugation by Hadamards; a short remark making the chosen ordering explicit and explaining why the phase ambiguity is irrelevant would improve readability.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the coupled-layer construction is defined from explicit stabilizer data and reproduces known models by direct calculation, not by importing its conclusions.

full rationale

The paper's central construction starts from explicit stabilizer groups (S0 in Sec. III A, Sec. IV, and Sec. VII) and code-switching terms (e.g., Eq. (11)), then derives a new stabilizer group by enforcing commuting condensation terms. No parameter is fitted to a target code, and no claimed prediction is equivalent by construction to an input. The known examples (X-cube, Chamon, 3D fermionic toric code, 3-fermion Walker-Wang, balanced product) are verified through explicit stabilizer manipulations, which are the appropriate external checks. The disjoint-support condition on excitations is the main technical limitation and is explicitly acknowledged in Sec. VIII; it restricts generality but does not make the argument circular, since the paper proves commutativity under that stated assumption and all demonstrated examples satisfy it. Self-citations to [30] and [32] are used for review, notation, and identification of known models, not as unverified premises that force the conclusions; the constructions themselves are carried out from the displayed stabilizers. No circular steps of any of the enumerated kinds are present.

Assumptions & free parameters 0 free parameters · 6 assumptions · 0 invented entities

No free parameters are fitted to data; the construction is parameter-free. The axioms are structural assumptions about commuting Pauli stabilizers, free group actions, and the existence of commutation-preserving maps. The disjoint-support excitation condition is the most restrictive ad hoc input and is explicitly flagged as an open generalization in Sec. VIII.

assumptions (6)
  • domain assumption The second code has stabilizers of pure Pauli type X, Y, or Z that pairwise commute.
    Used in Secs. IV and VII to guarantee that the code-switching terms can be imposed simultaneously; stated at the start of Sec. IV.
  • domain assumption An algebra-preserving map on an excitation algebra exists and maps generators to Pauli operators on auxiliary qubits while preserving commutation relations.
    Introduced in Sec. II C as the operator version of a mapping cone; every coupled-layer construction is defined through such maps and each example verifies one by hand.
  • domain assumption The group action on qubits and stabilizer supports is free, and the on-site unitaries satisfy U_{gg'} = U_g U_{g'}.
    Used in Lemma 1 in Sec. V and in Lemmas 3 to 6 of Appendix C to prove commutativity of quotient stabilizers and code-switching terms.
  • ad hoc to paper Excitations selected for the general balanced coupled-layer code have mutually disjoint supports and are freely permuted by the group action.
    Explicitly assumed in Sec. VII before Eq. (11); Appendix C relies on this disjointness for the pairwise-commutation proof, and Sec. VIII lists removing this restriction as future work.
  • standard math Standard background on stabilizer codes and on Z_2 cochain complexes and mapping cones is accepted.
    The paper builds on the stabilizer formalism and homological algebra without reproving them; this is standard background rather than an ad hoc assumption.
  • domain assumption Appendix A's logical count assumes surjectivity of certain boundary maps and a metacheck preimage condition.
    These are stated as assumptions 1 and 2 in Appendix A; they qualify the logical-dimension theorem but are not needed for the main constructions.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Coupled-Layer Codes: Beyond Quantum Product Constructions." pith.science (2026). https://pith.science/paper/AAHL2SW3

@misc{pith2026260810069,
  author       = {Pith},
  title        = {Pith review of: Coupled-Layer Codes: Beyond Quantum Product Constructions},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/AAHL2SW3}},
  note         = {Machine review of arXiv:2608.10069}
}
read the original abstract

Product codes are an important class of quantum error-correcting codes constructed from multiple input codes, which can give rise to asymptotically good quantum low-density parity check codes. In previous work, we showed how the product between two codes can be physically implemented by coupling layers of the first code using checks of the second code. In this work, we further unify product code constructions with coupled-layer constructions of phases of matter by introducing coupled-layer codes. The essential strategy is to condense general excitations created by Pauli operators among multiple decoupled layers of the first code. The condensation is specified by an excitation algebra, which encodes the excitations, along with an algebra-preserving map. This coupling between layers generalizes the notion of gauging in physics as well as the mapping cone in homological algebra, and can be used to produce non-CSS codes. As examples, we show how coupled-layer codes reproduce the X-cube and Chamon models. We further generalize the balanced product code by allowing a unitary transformation in addition to a group action by free permutation and describe its corresponding coupled-layer construction. In particular, we show how balancing by a ZX-duality can reproduce non-CSS codes such as the fermionic toric code and the 3-fermion Walker-Wang model in 3D.

Figures

Figures reproduced from arXiv: 2608.10069 by the authors.

Figure 1
Figure 1. FIG. 1: The tensor product complex [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 3
Figure 3. FIG. 3: The chain complex after gauging all [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figure 5
Figure 5. FIG. 5: The mapping cone for code surgery on [PITH_FULL_IMAGE:figures/full_fig_p005_5.png] view at source ↗
Figures from the paper (6 more)
Figure 4
Figure 4. Figure 4: FIG. 4: The tensor product CSS [PITH_FULL_IMAGE:figures/full_fig_p005_4.png]
Figure 7
Figure 7. Figure 7: FIG. 7: The chain complex of the CSS coupled-layer code, [PITH_FULL_IMAGE:figures/full_fig_p008_7.png]
Figure 8
Figure 8. Figure 8: FIG. 8: Under the coupled layer construction, low-weight [PITH_FULL_IMAGE:figures/full_fig_p009_8.png]
Figure 9
Figure 9. Figure 9: FIG. 9: (a) Tensor product of Ising [PITH_FULL_IMAGE:figures/full_fig_p022_9.png]
Figure 10
Figure 10. Figure 10: FIG. 10: From left to right, [PITH_FULL_IMAGE:figures/full_fig_p024_10.png]
Figure 11
Figure 11. Figure 11: FIG. 11: The condensation schemes of the codes TC [PITH_FULL_IMAGE:figures/full_fig_p024_11.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

86 extracted references · 33 canonical work pages

  1. [30]

    Liu and W

    S. Liu and W. Ji, Towards non-invertible anomalies from gener- alized Ising models, SciPost Phys.15, 150 (2023)

    2023

  2. [32]

    Garre-Rubio, Emergent (2+1)d topological orders from itera- tive (1+1)d gauging, Nature Communications15, 7986 (2024)

    J. Garre-Rubio, Emergent (2+1)d topological orders from itera- tive (1+1)d gauging, Nature Communications15, 7986 (2024)

    work page 2024

  3. [1]

    Coupled-Layer Construction It turns out that in order to reproduce exactly the stabilizers for the fermionic TC, we will need to express the two input codes in a particular way on the lattice. We express CSS 1 as the usual 2D TC on the square lattice with coordinatespx, yq, with stabilizer group TC“xa v,b p|vPV, pPPy with qubits on edges,X-stabilizers on ...

  4. [2]

    IfU g “idso that˜s 1 is also anX-stabilizer, then we only need to relabel qubitsb 1b˜sa byb 1¨gb˜s1

    Similarly for stabilizers, without loss of generality, assume we replace˜sa by another represen- tative˜s1, related by˜sa “g¨˜s 1. IfU g “idso that˜s 1 is also anX-stabilizer, then we only need to relabel qubitsb 1b˜sa byb 1¨gb˜s1. OtherwiseU g “h, and˜s1 is aZ-stabilizer, so we need to relabel qubitsb 1b˜sa byb 1¨gb˜s1, followed by a transversalhin this ...

  5. [3]

    V, the resulting code is independent of the representatives

    Different Representatives As shown in Sec. V, the resulting code is independent of the representatives. To demonstrate this in this particular ex- ample, let us choose another set of representatives of qubits and stabilizers in TC when setting up the coupled-layer con- struction, and show that we recover the same code, up to a basis transformation. 20 Let...

  6. [4]

    ABABto be the sign upon commuting a pair of operators, we have sgnpApe, ˜fq,Bph t,˜q2qq “sgn ´ Γp ˜fqpeq, ź gPC Γp ˜fqpUg´1phtqq ¯ sgn ´ź gPC Ugpep˜q2qq,h p˜q2q t ¯ “ ź gPC

    Quotient 4D TC The usual tensor product of two 2D TC is the 4D loop- only TC, which has ane´mduality inherited from thee´ mduality in 2D TC. To see this, recall the qubits of 4D TC live on2-cells, which are labeled bype, e1q,pv, p1qandpp, v1q, wherev,e,pare the vertices, edges and plaquettes in 2D, the un-primed and primed labels correspond to the first a...

  7. [5]

    This is captured by a few related concepts, namely the mapping cone, which in turn is related to partial gauging/partial lattice surgery between the lay- ers

    The CSS coupled-layer code introduces the idea of con- densing general excitations, instead of the excitations created by single PauliXorZas in the case of ten- sor product. This is captured by a few related concepts, namely the mapping cone, which in turn is related to partial gauging/partial lattice surgery between the lay- ers. Equivalently, the coupli...

  8. [6]

    As an ex- ample, we discussed thee´mbalanced product where the onsite unitary is Hadamard

    We introduce the concept of a generalized quotient where the group action acts not only by permutation, but also accompanied by an onsite unitary. As an ex- ample, we discussed thee´mbalanced product where the onsite unitary is Hadamard. We also relate this con- struction to an ordinary balancing of CSS codes via the symplectic doubling [68, 69] in Append...

Show all 86 references
  1. [7]

    Combining the ideas from1and2, we attempted to pro- vide a unifying framework, which condenses general excitations, and at the same time is twisted by a group action, which is combination of permutation and onsite unitary. Although we do not have an illuminating ex- ample in l...

  2. [8]

    Tillich and G

    J.-P. Tillich and G. Z´emor, Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength, IEEE Trans. Info. Theor.60, 1193 (2014), arXiv:0903.0566 [cs.IT]

    2014 arXiv

  3. [9]

    Bravyi and M

    S. Bravyi and M. B. Hastings, Homological product codes, in Proceedings of the forty-sixth annual ACM symposium on The- ory of computing(2014) pp. 273–282

    2014

  4. [10]

    M. B. Hastings, J. Haah, and R. O’Donnell, Fiber bundle codes: breaking the n 1/2 polylog (n) barrier for quantum ldpc codes, inProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing(2021) pp. 1276–1288

    2021

  5. [11]

    Panteleev and G

    P. Panteleev and G. Kalachev, Quantum ldpc codes with almost linear minimum distance, IEEE Transactions on Information Theory68, 213 (2021)

    2021

  6. [12]

    N. P. Breuckmann and J. N. Eberhardt, Balanced product quan- tum codes, IEEE Transactions on Information Theory67, 6653 (2021)

    2021

  7. [13]

    Panteleev and G

    P. Panteleev and G. Kalachev, Asymptotically good quantum and locally testable classical LDPC codes, inProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Comput- ing, STOC 2022 (Association for Computing Machinery, New York, NY , USA, 2022) p. 375–388

    2022

  8. [14]

    S. L. Sondhi and K. Yang, Sliding phases via magnetic fields, Phys. Rev. B63, 054430 (2001)

    2001

  9. [15]

    C. L. Kane, R. Mukhopadhyay, and T. C. Lubensky, Fractional quantum hall effect in an array of quantum wires, Phys. Rev. Lett.88, 036401 (2002)

    2002

  10. [16]

    J. C. Y . Teo and C. L. Kane, From Luttinger liquid to non- Abelian quantum Hall states, arXiv e-prints , arXiv:1111.2617 (2011), arXiv:1111.2617 [cond-mat.mes-hall]

    2011 arXiv

  11. [17]

    Wang and T

    C. Wang and T. Senthil, Boson topological insulators: A win- dow into highly entangled quantum phases, Phys. Rev. B87, 235122 (2013), arXiv:1302.6234 [cond-mat.str-el]

    2013 arXiv

  12. [18]

    Fidkowski, X

    L. Fidkowski, X. Chen, and A. Vishwanath, Non-Abelian Topo- logical Order on the Surface of a 3D Topological Supercon- ductor from an Exactly Solved Model, Physical Review X3, 041016 (2013), arXiv:1305.5851 [cond-mat.str-el]

    2013 arXiv

  13. [19]

    Jian and X.-L

    C.-M. Jian and X.-L. Qi, Layer construction of 3d topologi- cal states and string braiding statistics, Phys. Rev. X4, 041043 (2014)

    2014

  14. [20]

    Vijay, Isotropic Layer Construction and Phase Dia- gram for Fracton Topological Phases, arXiv e-prints 10.48550/arXiv.1701.00762 (2017), arXiv:1701.00762 [cond- mat.str-el]

    S. Vijay, Isotropic Layer Construction and Phase Dia- gram for Fracton Topological Phases, arXiv e-prints 10.48550/arXiv.1701.00762 (2017), arXiv:1701.00762 [cond- mat.str-el]

    2017 doi arXiv

  15. [21]

    H. Ma, E. Lake, X. Chen, and M. Hermele, Fracton topological order via coupled layers, Phys. Rev. B95, 245126 (2017)

    2017

  16. [22]

    G. B. Hal ´asz, T. H. Hsieh, and L. Balents, Fracton topological phases from strongly coupled spin chains, Phys. Rev. Lett.119, 257202 (2017)

    2017

  17. [23]

    Prem, S.-J

    A. Prem, S.-J. Huang, H. Song, and M. Hermele, Cage-net frac- ton models, Phys. Rev. X9, 021010 (2019)

    2019

  18. [24]

    A. T. Schmitz, Distilling Fractons from Layered Subsystem- Symmetry Protected Phases, arXiv e-prints , arXiv:1910.04765 (2019), arXiv:1910.04765 [quant-ph]

    2019 arXiv

  19. [25]

    D. J. Williamson and M. Cheng, Designer non-Abelian frac- tons from topological layers, Phys. Rev. B107, 035103 (2023), arXiv:2004.07251 [cond-mat.str-el]

    2023 arXiv

  20. [26]

    Wen, Systematic construction of gapped nonliquid states, Phys

    X.-G. Wen, Systematic construction of gapped nonliquid states, Phys. Rev. Res.2, 033300 (2020)

    2020

  21. [27]

    D. J. Williamson and T. Devakul, Type-ii fractons from coupled spin chains and layers, Phys. Rev. B103, 155140 (2021)

    2021

  22. [28]

    Sullivan, T

    J. Sullivan, T. Iadecola, and D. J. Williamson, Planar p-string condensation: Chiral fracton phases from fractional quantum hall layers and beyond, Phys. Rev. B103, 205301 (2021)

    2021

  23. [29]

    Wang, Nonliquid cellular states: Gluing gauge-higher- symmetry-breaking versus gauge-higher-symmetry-extension interfacial defects, Phys

    J. Wang, Nonliquid cellular states: Gluing gauge-higher- symmetry-breaking versus gauge-higher-symmetry-extension interfacial defects, Phys. Rev. Res.4, 023258 (2022)

    2022

  24. [31]

    Luo, Gapped boundaries of (3 +1 ) -dimensional topolog- ical order, Phys

    Z.-X. Luo, Gapped boundaries of (3 +1 ) -dimensional topolog- ical order, Phys. Rev. B107, 125425 (2023), arXiv:2212.09779 [cond-mat.str-el]

    2023 arXiv

  25. [33]

    B. V .-D. Cuiper and J. Garre-Rubio, Systematic construction of stabilizer codes via gauging abelian boundary symmetries, Quantum9, 1852 (2025)

    2025

  26. [34]

    Gorantla, A

    P. Gorantla, A. Prem, N. Tantivasadakarn, and D. J. Williamson, String membrane nets from higher-form gauging: An alter- nate route to p-string condensation, Phys. Rev. B112, 125124 (2025), arXiv:2505.13604 [cond-mat.str-el]

    2025 arXiv

  27. [35]

    Gorantla, A

    P. Gorantla, A. Prem, N. Tantivasadakarn, and D. J. Williamson, 28 Gauging nexus between topological and fracton phases, Phys. Rev. B113, 085110 (2026), arXiv:2509.19440 [cond-mat.str- el]

    2026 arXiv

  28. [36]

    Liu, Constructing Bulk Topological Orders via Lay- ered Gauging, arXiv e-prints , arXiv:2604.27363 (2026), arXiv:2604.27363 [cond-mat.str-el]

    S. Liu, Constructing Bulk Topological Orders via Lay- ered Gauging, arXiv e-prints , arXiv:2604.27363 (2026), arXiv:2604.27363 [cond-mat.str-el]

    2026 arXiv

  29. [37]

    Zhang, T.-C

    S. Zhang, T.-C. Wei, and N. Tantivasadakarn, Coupled-Layer Construction of Quantum Product Codes, arXiv e-prints , arXiv:2603.08711 (2026), arXiv:2603.08711 [quant-ph]

    2026 arXiv

  30. [38]

    Vijay, J

    S. Vijay, J. Haah, and L. Fu, Fracton topological order, general- ized lattice gauge theory, and duality, Phys. Rev. B94, 235157 (2016)

    2016

  31. [39]

    Barkeshli, Y .-A

    M. Barkeshli, Y .-A. Chen, S.-J. Huang, R. Kobayashi, N. Tan- tivasadakarn, and G. Zhu, Codimension-2 defects and higher symmetries in (3+1)D topological phases, SciPost Physics14, 065 (2023), arXiv:2208.07367 [cond-mat.str-el]

    2023 arXiv

  32. [40]

    M. B. Hastings, On Quantum Weight Reduction, arXiv e-prints , arXiv:2102.10030 (2021), arXiv:2102.10030 [quant-ph]

    2021 arXiv

  33. [41]

    Cowtan, SSIP: automated surgery with quantum LDPC codes, arXiv e-prints , arXiv:2407.09423 (2024), arXiv:2407.09423 [quant-ph]

    A. Cowtan, SSIP: automated surgery with quantum LDPC codes, arXiv e-prints , arXiv:2407.09423 (2024), arXiv:2407.09423 [quant-ph]

    2024 arXiv

  34. [42]

    B. Ide, M. G. Gowda, P. J. Nadkarni, and G. Dauphinais, Fault- Tolerant Logical Measurements via Homological Measure- ment, Physical Review X15, 021088 (2025), arXiv:2410.02753 [quant-ph]

    2025 arXiv

  35. [43]

    Cowtan, Z

    A. Cowtan, Z. He, D. J. Williamson, and T. J. Yoder, Paral- lel Logical Measurements via Quantum Code Surgery, arXiv e-prints , arXiv:2503.05003 (2025), arXiv:2503.05003 [quant- ph]

    2025 arXiv

  36. [44]

    A. C. Yuan, Unified framework for quantum code embedding, Phys. Rev. A113, 022438 (2026), arXiv:2507.05361 [quant- ph]

    2026

  37. [45]

    Cowtan, Z

    A. Cowtan, Z. He, D. J. Williamson, and T. J. Yoder, Fast and fault-tolerant logical measurements: Auxiliary hypergraphs and transversal surgery, arXiv e-prints , arXiv:2510.14895 (2025), arXiv:2510.14895 [quant-ph]

    2025

  38. [46]

    Chang, Z

    K. Chang, Z. He, T. J. Yoder, G. Zhu, and T. Jochym- O’Connor, Constant-Time Surgery on 2D Hypergraph Prod- uct Codes with Near-Constant Space Overhead, arXiv e-prints , arXiv:2603.02157 (2026), arXiv:2603.02157 [quant-ph]

    2026

  39. [47]

    Zheng, G

    H. Zheng, G. Zheng, L. Jiang, and Q. Xu, Logical compu- tation with canonical lifted product codes, arXiv e-prints , arXiv:2607.28605 (2026), arXiv:2607.28605 [quant-ph]

    2026 arXiv

  40. [48]

    Y . Tan, B. Roberts, N. Tantivasadakarn, B. Yoshida, and N. Y . Yao, Fracton models from product codes, Phys. Rev. Res.7, L032062 (2025)

    2025

  41. [49]

    Rakovszky and V

    T. Rakovszky and V . Khemani, The Physics of (good) LDPC Codes II. Product constructions, arXiv e-prints , arXiv:2402.16831 (2024), arXiv:2402.16831 [quant-ph]

    2024 arXiv

  42. [50]

    Chamon, Quantum Glassiness in Strongly Correlated Clean Systems: An Example of Topological Overprotection, Phys

    C. Chamon, Quantum Glassiness in Strongly Correlated Clean Systems: An Example of Topological Overprotection, Phys. Rev. Lett.94, 040402 (2005), arXiv:cond-mat/0404182 [cond- mat.str-el]

    2005 arXiv

  43. [51]

    Leverrier, S

    A. Leverrier, S. Apers, and C. Vuillot, Quantum XYZ Product Codes, Quantum6, 766 (2022), arXiv:2011.09746 [quant-ph]

    2022 arXiv

  44. [52]

    Walker and Z

    K. Walker and Z. Wang, (3+1)-TQFTs and topological insu- lators, Frontiers of Physics7, 150 (2012), arXiv:1104.2632 [cond-mat.str-el]

    2012 arXiv

  45. [53]

    F. J. Burnell, X. Chen, L. Fidkowski, and A. Vishwanath, Ex- actly soluble model of a three-dimensional symmetry-protected topological phase of bosons with surface topological order, Phys. Rev. B90, 245122 (2014)

    2014

  46. [54]

    J. Haah, L. Fidkowski, and M. B. Hastings, Nontrivial Quantum Cellular Automata in Higher Dimensions, Communications in Mathematical Physics398, 469 (2023), arXiv:1812.01625 [quant-ph]

    2023 arXiv

  47. [55]

    D. J. Williamson, Fractal symmetries: Ungauging the cubic code, Phys. Rev. B94, 155128 (2016)

    2016

  48. [56]

    Yoshida, Topological phases with generalized global sym- metries, Phys

    B. Yoshida, Topological phases with generalized global sym- metries, Phys. Rev. B93, 155131 (2016)

    2016

  49. [57]

    Yoshida, Gapped boundaries, group cohomology and fault- tolerant logical gates, Annals of Physics377, 387 (2017)

    B. Yoshida, Gapped boundaries, group cohomology and fault- tolerant logical gates, Annals of Physics377, 387 (2017)

    2017

  50. [58]

    Kubica and B

    A. Kubica and B. Yoshida, Ungauging quantum error- correcting codes, arXiv e-prints , arXiv:1805.01836 (2018), arXiv:1805.01836 [quant-ph]

    2018 arXiv

  51. [59]

    N. Tantivasadakarn, Jordan-Wigner dualities for translation- invariant Hamiltonians in any dimension: Emergent fermions in fracton topological order, Physical Review Research2, 023353 (2020), arXiv:2002.11345 [cond-mat.str-el]

    2020 arXiv

  52. [60]

    Rakovszky and V

    T. Rakovszky and V . Khemani, The physics of (good) ldpc codes i. gauging and dualities, arXiv preprint arXiv:2310.16032 (2023)

    2023 arXiv

  53. [61]

    Hatcher,Algebraic topology(Cambridge Univ

    A. Hatcher,Algebraic topology(Cambridge Univ. Press, Cam- bridge, 2000)

    2000

  54. [62]

    J. J. Rotman,An Introduction to Homological Algebra, Pure and Applied Mathematics, V ol. 85 (Academic Press, New York, 1979)

    1979

  55. [63]

    Nussinov and G

    Z. Nussinov and G. Ortiz, Bond algebras and exact solvability of hamiltonians: Spins“ 1 2 multilayer systems, Phys. Rev. B 79, 214440 (2009)

    2009

  56. [64]

    Cobanera, G

    E. Cobanera, G. Ortiz, and Z. Nussinov, Unified approach to quantum and classical dualities, Phys. Rev. Lett.104, 020402 (2010)

    2010

  57. [65]

    Cobanera, G

    E. Cobanera, G. Ortiz, and Z. Nussinov, The Bond- Algebraic Approach to Dualities, Adv. Phys.60, 679 (2011), arXiv:1103.2776 [cond-mat.stat-mech]

    2011 arXiv

  58. [66]

    Ji and X.-G

    W. Ji and X.-G. Wen, Categorical symmetry and noninvertible anomaly in symmetry-breaking and topological phase transi- tions, Phys. Rev. Res.2, 033417 (2020)

    2020

  59. [67]

    Poulin, Stabilizer formalism for operator quantum error cor- rection, Phys

    D. Poulin, Stabilizer formalism for operator quantum error cor- rection, Phys. Rev. Lett.95, 230504 (2005)

    2005

  60. [68]

    Schuster, N

    T. Schuster, N. Tantivasadakarn, A. Vishwanath, and N. Y . Yao, A holographic view of topological stabilizer codes, arXiv e-prints , arXiv:2312.04617 (2023), arXiv:2312.04617 [cond- mat.str-el]

    2023 arXiv

  61. [69]

    Haah, Commuting Pauli Hamiltonians as Maps between Free Modules, Communications in Mathematical Physics324, 351 (2013), arXiv:1204.1063 [quant-ph]

    J. Haah, Commuting Pauli Hamiltonians as Maps between Free Modules, Communications in Mathematical Physics324, 351 (2013), arXiv:1204.1063 [quant-ph]

    2013 arXiv

  62. [70]

    Wen, Quantum orders in an exact soluble model, Phys

    X.-G. Wen, Quantum orders in an exact soluble model, Phys. Rev. Lett.90, 016803 (2003)

    2003

  63. [71]

    J. P. Bonilla Ataides, D. K. Tuckett, S. D. Bartlett, S. T. Flam- mia, and B. J. Brown, The xzzx surface code, Nature Commu- nications12, 2172 (2021)

    2021

  64. [72]

    N. P. Breuckmann and S. Burton, Fold-Transversal Clifford Gates for Quantum Codes, Quantum8, 1372 (2024)

    2024

  65. [73]

    Gorantla, S.-H

    P. Gorantla, S.-H. Shao, and N. Tantivasadakarn, Tensor net- works for noninvertible symmetries in3`1Dand beyond, Phys. Rev. X15, 041006 (2025)

    2025

  66. [74]

    Chen and S

    Y .-A. Chen and S. Tata, Higher cup products on hyper- cubic lattices: Application to lattice models of topological phases, Journal of Mathematical Physics64, 091902 (2023), arXiv:2106.05274 [cond-mat.str-el]

    2023 arXiv

  67. [75]

    A. A. Kovalev and L. P. Pryadko, Quantum kronecker sum- product low-density parity-check codes with finite rate, Phys. Rev. A88, 012311 (2013)

    2013

  68. [76]

    M. L. Liu, N. Tantivasadakarn, and V . V . Albert, Subsystem CSS codes, a tighter stabilizer-to-CSS mapping, and Goursat’s Lemma, Quantum8, 1403 (2024). 29

    2024

  69. [77]

    Panteleev and G

    P. Panteleev and G. Kalachev, Maximally Extendable Sheaf Codes, arXiv e-prints , arXiv:2403.03651 (2024), arXiv:2403.03651 [cs.IT]. 30 Appendix A: Logicals in the CSS Coupled-Layer Code In this appendix, we count the number of logicals in the CSS coupled-layer code (whose corr...

    2024 arXiv

  70. [78]

    Classical Case First we consider an easier case, where CSS 1 is a classical code inZbasis, and CSS 2 is a classical code inXbasis. The stabilizer group isS“xαpe x, a2q,ζpb 1, q2qy, and the corresponding chain complex is shown below ‘ExbA 2 Q1bQ 2 QxbA 2 B1bQ 2 ϵxbδ 2 ϵ1 xbid d...

  71. [79]

    The stabilizer group isS“ xαpe x, a2q,βpe z, b2q,ξpa 1, q2q,ζpb 1, q2qy, and the chain complex is given in Figure 7

    Quantum Case Next, we consider the case where both CSS 1 and CSS 2 are quantum codes. The stabilizer group isS“ xαpe x, a2q,βpe z, b2q,ξpa 1, q2q,ζpb 1, q2qy, and the chain complex is given in Figure 7. First we find a maximal set of commut- ing logicals. We make this set roug...

  72. [80]

    Sincerq 2s “ rq1 2s, there existsgPGsuch thatq 2 “g¨q 1 2, therefore Suppp ˜fqXSupppU gp ˜fqq ‰ H

    In this way, the overlap is between U: gq2 Pp˜q2q q1¨gq2 Ugq2 PApq 1, ˜fqandU : gq1 2 Pp˜q2q q1 1¨gq1 2 Ugq1 2 PApq 1 1, ˜fq. Sincerq 2s “ rq1 2s, there existsgPGsuch thatq 2 “g¨q 1 2, therefore Suppp ˜fqXSupppU gp ˜fqq ‰ H. Moreover, we have gq2“gg q1 2, thereforepq 1¨gq¨g q1...

  73. [81]

    38 pðùqdirection: if Suppp ˜fqXSupppU gp ˜fqq‰H, then there existsq 2,q1 2P ˜fsuch thatq 2“g¨q 1 2, so thatg q2“gg q1

    Acting byg ´1 q1 2 , we haveq1 1“q 1¨g. 38 pðùqdirection: if Suppp ˜fqXSupppU gp ˜fqq‰H, then there existsq 2,q1 2P ˜fsuch thatq 2“g¨q 1 2, so thatg q2“gg q1

  74. [82]

    Finally, the group element satisfyingq1 1“q 1¨gis unique because the group action is free

    In which case,Apq 1, ˜fqandApq 1 1, ˜fqoverlap at U: ggq1 2 Pp˜q2q q1¨ggq1 2 Uggq1 2 PApq 1, ˜fqandU : gq1 2 Pp˜q2q q1 1¨gq1 2 Ugq1 2 PApq 1 1, ˜fq. Finally, the group element satisfyingq1 1“q 1¨gis unique because the group action is free. Consider now the commutation relation...

  75. [83]

    Sinceg¨q 1 2PSupppU gp ˜f1qqXSuppp ˜fq, we see the intersection is not empty

    In which case the overlap is between U: gq2 Pp˜q2q q1¨gq2 Ugq2 PApq 1, ˜fqandU : gq1 2 P1p˜q2q q1 1¨gq1 2 Ugq1 2 PApq 1 1, ˜f1q. Sinceg¨q 1 2PSupppU gp ˜f1qqXSuppp ˜fq, we see the intersection is not empty. Sinceg q2“gg q1 2, we seeq 1¨g“q 1 1. (ðù) direction: Pickq 2PSuppp ˜f...

  76. [84]

    This givesg q2“gg q1

  77. [85]

    40 Now we consider the commutation relation betweenApq1, ˜fqandApq 1 1, ˜f1q

    We see there is an overlap betweenApq 1, ˜fqandApq 1 1, ˜f1qon U: ggq1 2 Pp˜q2q q1¨ggq1 2 Uggq1 2 PApq 1, ˜fqandU : gq1 2 P1p˜q2q q1 1¨gq1 2 Ugq1 2 PApq 1 1, ˜f1q, wheregis again unique because the action is free. 40 Now we consider the commutation relation betweenApq1, ˜fqand...

  78. [86]

    Therefore we havepq 1 2, g¨q1 2qPK

    Since the group action on qubits is free, SupppU ggq1 2 peqqXSupppU gq1 2 pe1qq ‰ Himplies SupppUgpeqqXSupppe 1q‰H. Therefore we havepq 1 2, g¨q1 2qPK. Conversely, givenpq 2, g¨q 2qPK, the termU ggq2pep˜q2qqPApe, ˜fqandU gq2pe1p˜q2qqPApe 1, ˜f1qhave non-empty overlap. These tw...

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.