Pith. sign in

REVIEW 2 major objections 5 minor 72 references

Decoupling 2D translation-invariant topological CSS codes

T0 review · 2 major / 5 minor · reviewed 2026-08-15 · deepseek-v4-flash

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

Pith's one-line read This paper proves that after coarse-graining to the maximal anyon-preserving superlattice, every 2D translation-invariant topological CSS code is local-unitarily equivalent to a stack of toric codes and product states, and that the…

desk verdict A complete, constructive answer to the decoupling question at maximal anyon-preserving symmetry; the main theorem holds up, with minor proof-compression and complexity caveats. read the letter →

arxiv 2608.09915 v1 pith:E3YWNKGD submitted 2026-08-10 quant-ph cond-mat.str-elmath-phmath.MP

Yifei Wang , Zhongyi Ni , Mingxin He , Jinguo Liu , Yingfei Gu This is my paper · ORCID
classification quant-phcond-mat.str-elmath-phmath.MP MSC 81P7013P1018G15 PACS 03.67.Pp
keywords translation-invarianttopologicalCSScodestoriccodedecouplinganyon-preservingsuperlatticelocalunitaryequivalenceextensionclassificationLaurentpolynomialringbivariatebicycleCliffordquantumcellularautomata
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

The paper sets out to prove that anyon-permuting translations are the only obstruction to splitting a 2D translation-invariant topological CSS code into simple building blocks. It shows that after coarse-graining to the largest superlattice whose translations leave every anyon type fixed, every such code is local-unitarily equivalent to a stack of toric codes together with product states. The proof is constructive: the authors give a polynomial-time algorithm that outputs the decoupling map, with explicit bounds on the supercell size and on how far the map spreads local Pauli operators. If true, this closes a gap left by earlier classifications, which achieved the same decoupling only after breaking more translation symmetry than necessary, and it gives a concrete route to decoding and logical-gate protocols for families such as bivariate bicycle codes.

What carries the argument

The argument runs through the module-theoretic chain complex representation of CSS codes, where $R=\mathbb{F}_2[x^{\pm 1},y^{\pm 1}]$ encodes the two translation directions. The load-bearing objects are reduction modulo the ideal $J=(x-1,y-1)$, which turns the topological data into finite-dimensional $\mathbb{F}_2$ linear algebra; the classification of short exact sequences by $\mathrm{Ext}^1_R(R^{p_X}\oplus J R^t, R^r) \cong \mathrm{Hom}_{\mathbb{F}_2}(\mathbb{F}_2^t,\mathbb{F}_2^r)$, whose representatives are $r\times t$ matrices over $\mathbb{F}_2$; and the transitivity of $\mathrm{GL}(r,\mathbb{F}_2)$ on full-rank matrices, which lets a pushout by an invertible change of stabilizer basis move the input extension to the standard extension. A chain-homotopy correction step then restores invertibility of the constructed maps, and the Five Lemma guarantees the middle map is an isomorphism.

What would settle it

Run the paper's reduction modulo $J$ on any 2D translation-invariant topological CSS code that satisfies exactness, injectivity, finite anyons, and the annihilator condition, then compute the representative of its extension class in $\mathrm{Hom}_{\mathbb{F}_2}(\mathbb{F}_2^t,\mathbb{F}_2^r)$; if any representative has rank less than $t$, the claimed chain isomorphism to the standard toric-code stack cannot exist.

Watch

Extended reading notes

Core claim

The central claim is that for any code whose chain complex and dual over $R=\mathbb{F}_2[x^{\pm 1},y^{\pm 1}]$ are exact, whose check maps are injective, whose anyon spaces have common finite dimension $t$, and whose anyon annihilator is exactly the ideal $(x-1,y-1)$, there is a commuting chain isomorphism from the input complex to a standard complex built from $t$ toric-code sectors, $r-t$ $Z$-basis product states, and $s-t$ $X$-basis product states. The isomorphism is an $R$-module isomorphism, hence a translation-invariant local Clifford unitary; its inverses are computed by the paper's Algorithm SM.1 in time polynomial in $q$ and the input matrix degrees. Because the annihilator condition is precisely what holds on the maximal anyon-preserving superlattice, the theorem says the only symmetry breaking ever needed is the removal of anyon-permuting translations.

Load-bearing premise

The proof rests on Lemma 6, which asserts that every admissible code's extension class is represented by an $r\times t$ matrix of full rank $t$; should some code satisfying the theorem's conditions yield a lower-rank representative, the decoupling map would not exist.

Editorial extensions

If this is right

  • Anyon permutation is the sole obstruction: after passing to the maximal anyon-preserving superlattice, no further coarse-graining is needed to decouple a 2D translation-invariant topological CSS code into toric codes and product states.
  • The decoupling unitary can be compiled to a constant-depth circuit of CNOT gates with no ancillas in generic cases, and on a finite torus it maps the code to $t$ toric codes with $2t$ logical qubits.
  • Syndromes of the original code can be decoded by mapping them to independent toric-code sectors and running minimum-weight perfect matching, with a speed-accuracy tradeoff because local faults spread across sectors.
  • Logical-gate protocols, such as transversal Clifford gates, can be transported between different 2D topological CSS codes by composing them with the decoupling maps, at bounded loss of locality.
  • The algorithm's empirical running time and operator spreading on bivariate bicycle codes scale as $q^{1.86}$ and $q^{0.65}$, respectively.

Reading between the lines

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

  • Beyond the paper: if the full-rank lemma is robust, the extension-class rank serves as a natural homological count of the genuine toric-code sectors, suggesting that $t$ can be identified from the extension class before any decoupling map is constructed.
  • Beyond the paper: the two-dimensionality of the result appears essential, since an independent concurrent classification noted that a naive three-dimensional analogue fails; symmetry-preserving decoupling may therefore be a genuinely planar phenomenon.
  • Beyond the paper: the decoder described here suggests a testable family of flushed decoders that first project syndromes onto $\mathrm{coker}\, H_X$; comparing their logical error rates with symmetry-based decoders would quantify how much accuracy the independent-sector approximation costs.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

2 major / 5 minor

Summary. The paper proves a symmetry-preserving decoupling theorem for 2D translation-invariant topological CSS codes on qubits. After passing to the maximal anyon-preserving superlattice, every code satisfying exactness, injectivity, finiteness of the anyon spaces, and the annihilator condition is shown to be chain-isomorphic to a standard complex consisting of t toric-code sectors together with p_Z Z-basis and p_X X-basis product-state sectors. The authors provide an explicit algorithm for computing the chain isomorphism in polynomial time in the coarse-grained parameters, prove bounds on supercell size and operator spreading, and demonstrate the construction on color codes and bivariate bicycle codes. Corollaries cover ancilla-free and shift-free circuit compilation, reabsorption of product states, periodic boundary conditions, and a decoder based on the decoupling map.

Significance. If the main theorem is correct, it closes a question left open by earlier classification results of Bombin, Haah, and others: after the anyon-permuting translations are removed by coarse-graining, no further obstruction to local unitary decoupling into toric codes and product states exists. The proof strategy is attractive: reduce modulo J, reinterpret the resulting short exact sequences as extensions, use the classification of extensions to prove existence, and then repair an explicit chain map to make it invertible. The paper gives reproducible numerical evidence and code, benchmarks on color codes and BB codes, and honest statements about empirical scaling. The central gap I identify is a missing step in the proof of Lemma 6; it is load-bearing but local and, in my view, fixable within the manuscript's scope.

major comments (2)
  1. [Supplemental Sec. IV.C, Lemma 6] The full-rank claim for θ is asserted but not proved. The text classifies the reference extensions E_Δ and asserts that pushouts and pullbacks 'traverse all matrices of the same rank', but it never shows that the representative of an arbitrary input extension has rank t; this is load-bearing because the transitivity of GL(r,F2) on full-rank r×t matrices is exactly what allows the pushout by φ2 to reach the standard extension. Please add the missing argument: applying the long exact sequence for Tor(-,F2) to the exact sequence (IV.9) yields 0 -> F2^t --δ--> F2^r -> F2^q -> F2^{pX+2t} -> 0, where δ is the connecting homomorphism and is injective by exactness; under the identification Ext^1(R^{pX}⊕JR^t,R^r) ≅ Hom_F2(F2^t,F2^r), δ is the extension-class representative, so rank(δ)=t. The same argument applies to eθ. With this step added, the proof of Lemma 6 is complete.
  2. [Supplemental Sec. IV.B, Eq. (IV.9)] As written, the sequence (IV.9) has right-hand term R^{pX}⊕JR^t, but the map ξ0^{-1}H_Xξ1 maps into R^s, not into R^{pX}⊕JR^t; identifying the image of this map with R^{pX}⊕JR^t is part of what Lemma 6 proves, so Lemma 5 cannot already assert this as a well-defined exact sequence. Please reformulate Lemma 5 with right-hand term im(ξ0^{-1}H_Xξ1) and state the isomorphism to R^{pX}⊕JR^t only after Lemma 6, or define the map to R^{pX}⊕JR^t explicitly after choosing the isomorphism supplied by Lemma 6.
minor comments (5)
  1. [Main text, before Algorithm] The sentence explaining that the natural outputs are the inverses of (ψ2,ψ1,ψ0) is important, but the physical-interpretation paragraph immediately afterward refers to ψ1 as though it were the forward map; please make the convention explicit in both places.
  2. [Abstract and Section VI.A] The phrase 'no additional ancillas in generic cases' is vague; Section VI.A gives precise sufficient conditions, so the abstract should carry the same qualification.
  3. [Main text, periodic-boundary paragraph] The string 'J144,12,12Kgross code' appears to be a typesetting error; it should refer to the gross code of Ref. [6].
  4. [Section V.C and Fig. SM.5] The empirical exponents T∝q^1.86 and deg(ψ1^{-1})∝q^0.65 are fitted to a sample of 60 instances without stated confidence intervals; please state the sample size and, if possible, error bars, and make clear that these exponents are not used in the proof of the main theorem.
  5. [Supplemental Sec. VII, Eq. (VII.4)] The worst-case exponents d0^192 q^195 make the polynomial-time statement formally correct but practically uninformative; a remark stating that these bounds are not observed in the benchmarks would help readers calibrate the claim.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the decoupling theorem follows from the stated module-theoretic assumptions, and the empirical scalings are fits that are not load-bearing.

full rationale

The paper's central claim is a theorem: under exactness, injectivity, finite anyon number, and the annihilator condition ann cokerHZ = ann cokerHX = (x-1,y-1), the input chain complex is chain-isomorphic to a standard complex of toric-code sectors and product states. The proof derives this from homological algebra: reduction modulo J, identification of extensions via Ext^1(R^{pX} ⊕ JR^t, R^r) ≅ Hom_{F2}(F2^t, F2^r), and the transitivity of GL(r,F2) on full-rank r×t matrices. The full-rank claim for the input representative is the key step, and it is argued from the exactness of the short exact sequence and the shape of the middle module R^q; the standard representative has full rank by construction. This is not a case where the target result is assumed in the input: the annihilator condition is a symmetry condition on anyons, not a statement that the code is already a stack of toric codes. The algorithm constructs the maps by solving matrix equations, and its polynomial-time and locality bounds are stated as theorem claims with proofs in the Supplemental Material; they are not obtained by fitting. The empirical scalings T ∝ q^1.86 and deg(ψ_1^{-1}) ∝ q^0.65 in Section V.C are fits to benchmark instances and are explicitly presented as observed scaling, not as predictions used in the derivation. Citations to prior work by Haah and others provide the module-theoretic framework and background classification results, but the existence proof does not reduce to those citations; in particular, the independent work of Song (Ref. [51]) is not used as a premise. No load-bearing self-citation, no fitted parameter renamed as a prediction, and no definitional identity between input and output was found. The derivation is self-contained with respect to the stated assumptions, so the circularity score is 0.

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

The central theorem rests on the standard module-theoretic description of translation-invariant CSS codes, the TQO/exactness condition, the annihilator condition achieved by coarse-graining, and standard homological algebra (extension classification, comparison theorem, Five Lemma, Suslin stability). No new physical entities are introduced. The two fitted scaling exponents are benchmark observations only and do not support the theorem.

free parameters (2)
  • empirical runtime scaling exponent = 1.86
    Power-law fit to 60 BB-code benchmark instances in Fig. SM.5; reported as empirical scaling, not used in the derivation of the theorem.
  • empirical locality scaling exponent = 0.65
    Power-law fit to 59 non-zero deg(psi1^-1) values in Fig. SM.5; empirical benchmark, not used in the derivation.
assumptions (6)
  • domain assumption A code is represented by an exact chain complex R^r -> R^q -> R^s of finite free R-modules with injective H^dagger_Z and H^dagger_X and q = r + s.
    This is the module-theoretic formulation of CSS stabilizer codes; injectivity and the density relation follow from Haah's framework and TQO, cited in Sec. I and Supplemental Sec. I.
  • domain assumption Topological order is equivalent to exactness at the middle module, i.e., no finite-support logical Pauli operators.
    Standard TQO-1 condition of Bravyi, Hastings, and Michalakis, used to define the class of codes under study.
  • domain assumption After passing to the anyon-preserving superlattice, ann cokerH_X = ann cokerH_Z = (x-1,y-1).
    The main theorem takes this as property 3 in Theorem 4; the paper argues it holds for any code after coarse-graining (Supplemental Sec. III.A).
  • standard math Ext^1(R^{pX} + J R^t, R^r) is isomorphic to Hom_{F2}(F2^t, F2^r), and the extension-class representative of the input complex has full rank t.
    Used in Lemma 6 to prove existence of a chain isomorphism via the pushout action of GL(r,F2).
  • standard math The comparison theorem for projective resolutions and the Five Lemma imply uniqueness up to chain homotopy and invertibility of corrected maps.
    Used in Lemmas 7 and 8 and in the proof of Theorem 4.
  • standard math Suslin stability theorem: every SL(q,R) matrix with q >= 3 is a product of elementary matrices, enabling CNOT-only compilation.
    Used in the ancilla and shift removal discussion (Sec. VI.A); not needed for the existence of the chain isomorphism.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Decoupling 2D translation-invariant topological CSS codes." pith.science (2026). https://pith.science/paper/E3YWNKGD

@misc{pith2026260809915,
  author       = {Pith},
  title        = {Pith review of: Decoupling 2D translation-invariant topological CSS codes},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/E3YWNKGD}},
  note         = {Machine review of arXiv:2608.09915}
}
read the original abstract

Two-dimensional translation-invariant topological CSS codes on qubits are known to be locally equivalent, after coarse-graining, to stacks of toric codes. However, existing constructions generally break more translation symmetry than is required to remove anyon-permuting translations, leaving open whether any further obstruction exists. We prove that no such obstruction occurs: after passing to the maximal anyon-preserving superlattice, every such code admits a local unitary decoupling into toric codes and product states. We further provide an efficient algorithm for explicitly constructing the decoupling map, together with bounds on the required supercell size and operator spreading. The decoupling requires no additional ancillas in generic cases and extends to finite systems with suitable boundary conditions.

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

72 extracted references · 42 canonical work pages

  1. [1]

    decoupling

    both complexes are exact; 2.H † Z,H† X are injective; 3.dim F2 cokerHX = dimF2 cokerHZ =t<∞, andann cokerH Z = ann cokerHX = (x−1,y−1), then there exists a chain isomorphism between the first chain complex and a(t,r,s)-standard chain complex repre- sentingtcopies of toric codes, together withp Z =r−tcopies ofZ-basis product states, andp X =s−tcopies of X-...

    work page

  2. [2]

    as the standard one, then the required (ϕ 2,ϕ 1) exists. Therefore, we can establish the following existence result by proving that the orbit of the representatives of (IV.13) under all possible invertibleϕ 2 (called “pushout”) contains the representative of the standard chain. Lemma 6.There existR-isomorphisms(ϕ 2,ϕ 1)such that the diagram (IV.11) commut...

    work page

  3. [3]

    directly solve the matrix

    has rankt−∆, contributed entirely by the non-split (toric code) summands. Based on these reference extensions, pushing out inR r and pulling back in the direct summandJR t by invertibleF 2-matrices (intuitively, changes of “basis” inR r andJR t) act on the representatives by left and right multiplication by someF 2-invertible matrices (intuitively, change...

    work page

  4. [4]

    For anyv∈π [pZ+1:r]Fr 2, we have ( eH† Z)∗v= 0, so (H † Z)∗(ϕ2)0v= (ϕ 1)∗(eH† Z)∗v= 0, i.e., (ϕ 2)0v∈ ker(H† Z)∗ =π [pZ+1:r]Fr

    work page

  5. [5]

    This proves the diagonal form in Eq

    Henceπ [pZ+1:r]Fr 2 is invariant under (ϕ 2)0. This proves the diagonal form in Eq. (IV.17). Invertibility of (ϕ2)0 thus implies invertibility ofAandB. We then prove that the lasttcolumns for anyϕ 2 are the same as (ϕ 2)0 moduloJ. SinceR r andR q are free (hence projective)R-modules, each row in the diagram below is a projective resolution ofR pX⊕JR t, an...

    work page

  6. [6]

    The Gr¨ obner basis for ideal (1 +x+xy,1 +y+xy) is{1 +x+x 2,x+y,1 +x+u,1 +y+v}(we lift the ideal (1+x+xy,1+y+xy) inR=F 2[x±1,y±1] to the ideal (1+x+xy,1+y+xy,1+xu,1+yv) inP=F 2[x,u,y,v])

    work page

  7. [7]

    The monomial basis for the quotientP/(1 +x+xy,1 +y+xy,1 +xu,1 +yv) is{1,x}

    work page

  8. [8]

    Therefore, Tx = 0 1 1 1 , T y = 0 1 1 1 .(V.2) 15 𝑥 𝑦 1 2 𝑥𝑦 𝑦 𝑥 𝑥𝑦 (1+𝑥+𝑥𝑦 1+𝑦+𝑥𝑦) 𝑥2𝑦 ≡ 1 𝑥3 ≡ 1 FIG

    To compute the representation matrix, we have: bTx(1) =x, bTx(x) =x 2 = 1 +x+ (1 +x+x 2)≡1 +x, bTy(1) =y=x+ (x+y)≡x, bTy(x) =xy=x 2 +x(x+y) = 1 +x+ (1 +x+x 2) +x(x+y)≡1 +x. Therefore, Tx = 0 1 1 1 , T y = 0 1 1 1 .(V.2) 15 𝑥 𝑦 1 2 𝑥𝑦 𝑦 𝑥 𝑥𝑦 (1+𝑥+𝑥𝑦 1+𝑦+𝑥𝑦) 𝑥2𝑦 ≡ 1 𝑥3 ≡ 1 FIG. SM. 3. The 6.6.6 color code, withq= 2,r=s= 1. As shown in the first panel, there...

    work page

Show all 72 references
  1. [9]

    Thus the superlattice is generated byx 3,x 2y

    It is easy to check thatT x =T y andT 3 x = 1. Thus the superlattice is generated byx 3,x 2y

  2. [10]

    The coarse-grained check matrices are: HX =   1 1 x1 1 y y1 1x1 1 xy y1xy x1  , H Z =   1 x xy1 y xy 1 1 x1 1 y y1 1x1 1  .(V.3) The corresponding standard forms are: eHX =   1 0 0 0 0 0 0 0x+ 1y+ 1 0 0 0 0 0 0x+ 1y+ 1  , eHZ =   0 1 0 0 0 0 0 0 1 + y1 + x0 0 0 0...

  3. [11]

    The Gr¨ obner basis for submodule imHX is given by: 1 +x 1 , 0 1 +x , 1 +y 1 , 0 1 +y , 1 +u 1 , 0 1 +u , 1 +v 1 , 0 1 +v 16 𝑥 𝑦 12 3 4 𝑦𝑦 𝑥 𝑥 𝑥𝑦 𝑥𝑦 ( 1+𝑦 1+𝑦 1+𝑥 1+𝑥) ( 𝑥𝑦 𝑦 𝑥𝑦 𝑥 ) 𝑥2 ≡ 1 𝑥𝑦 ≡ 1 FIG. SM. 4. The 4.8.8 color code, withq= 4,r=s= 2. As shown in the first panel, t...

  4. [12]

    The monomial basis for the quotient (P/I) 2/imH X is: 1 0 , 0 1

  5. [13]

    To compute the representation matrix, we have: bTx 1 0 = x 0 = 1 0 + 0 1 + 1 +x 1 ≡ 1 0 + 0 1 , bTx 0 1 = 0 x = 0 1 + 0 1 +x ≡ 0 1 , bTy 1 0 = y 0 = 1 0 + 0 1 + 1 +y 1 ≡ 1 0 + 0 1 , bTy 0 1 = 0 y = 0 1 + 0 1 +y ≡ 0 1

  6. [14]

    Therefore the superlattice is generated byx 2,xy

    Therefore, Tx = 1 0 1 1 , T y = 1 0 1 1 .(V.7) It is easy to check thatT x =T y andT 2 x = 1. Therefore the superlattice is generated byx 2,xy

  7. [15]

    The coarse-grained check matrices are: HX =   1 1 1 1 1 xy1 xy x1x1y1y1 y0 0 1y0 0 xy 0y x0 0y y0  , H Z =   1 1 1 1 1 xy1 xy x1x1y1y1 y0 0 1y0 0 xy 0y x0 0y y0  .(V.8) The corresponding standard forms are given by: eHX =   1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 ...

  8. [16]

    Thus Algorithm SM

    to (ξ 2ϕ′ 2,ξ 1ϕ′ 1,ξ 0) does not change the degree bounds. Thus Algorithm SM. 1 returns the chain maps (ξ 2ϕ′ 2,ξ 1ϕ′ 1,ξ 0) with Talg =O d192 0 q195 ,deg(ϕ ′

  9. [17]

    =O d16 0 q16 ,deg(ϕ ′

  10. [18]

    The worst-case exponents in Eq

    =O d16 0 q16 .(VII.4) A similar analysis gives polynomial time and degree bounds for the inverses of these chain isomorphisms. The worst-case exponents in Eq. (VII.4) are intentionally conservative. As reported in Sec. V C, the sam- pled benchmark and additional BB-code instan...

  11. [19]

    Map the measured syndrome of the original code to the TC sectors

  12. [20]

    Decode each TC sector independently using a graph-matching routine such as MWPM

  13. [21]

    However, the performance of this decoder is not entirely satisfactory

    Lift the direct sum of the sector corrections back to a Pauli operator on the original code. However, the performance of this decoder is not entirely satisfactory. Because the decoupling is implemented by a constant-depth circuit, a single local physical error in the original ...

  14. [22]

    Haah, Algebraic Methods for Quantum Codes on Lattices, Revista Colombiana de Matem´ aticas50, 299 (2017), arXiv:1607.01387 [quant-ph]

    J. Haah, Algebraic Methods for Quantum Codes on Lattices, Revista Colombiana de Matem´ aticas50, 299 (2017), arXiv:1607.01387 [quant-ph]

    2017 arXiv

  15. [23]

    Kitaev, A

    A. Kitaev, A. Shen, and M. Vyalyi,Classical and Quantum Computation, Graduate Studies in Mathematics (American Mathematical Society, 2002)

    2002

  16. [24]

    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

  17. [25]

    Bravyi, M

    S. Bravyi, M. Hastings, and S. Michalakis, Topological quantum order: Stability under local perturbations, Journal of Mathematical Physics51, 093512 (2010), arXiv:1001.0344 [quant-ph]

    2010 arXiv

  18. [26]

    Song, From Koszul-Complex Stabilizer Models to Superselection Profiles: Topological Rigidity and Nonsplit Extensions (2026), arXiv:2608.XXXXX [quant-ph]

    H. Song, From Koszul-Complex Stabilizer Models to Superselection Profiles: Topological Rigidity and Nonsplit Extensions (2026), arXiv:2608.XXXXX [quant-ph]

    2026

  19. [27]

    M. H. Freedman, D. A. Meyer, and F. Luo, Z2-systolic freedom and quantum codes, inMathematics of quantum computation (Chapman and Hall/CRC, 2002) pp. 287–320

    2002

  20. [28]

    A. Y. Kitaev, Fault-tolerant quantum computation by anyons, Annals of Physics303, 2 (2003), arXiv:quant-ph/9707021

    2003 arXiv

  21. [29]

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

    1998 arXiv

  22. [30]

    N. P. Breuckmann and S. Burton, Fold-Transversal Clifford Gates for Quantum Codes, Quantum8, 1372 (2024), arXiv:2202.06647 [quant-ph]

    2024 arXiv

  23. [31]

    J. N. Eberhardt and V. Steffan, Logical operators and fold-transversal gates of bivariate bicycle codes (2024), arXiv:2407.03973 [quant-ph]

    2024 arXiv

  24. [32]

    Huang, T

    S. Huang, T. Jochym-O’Connor, and T. J. Yoder, Homomorphic Logical Measurements (2022), arXiv:2211.03625 [quant- ph]

    2022 arXiv

  25. [33]

    Q. Xu, H. Zhou, G. Zheng, D. Bluvstein, J. P. B. Ataides, M. D. Lukin, and L. Jiang, Fast and Parallelizable Logical Computation with Homological Product Codes, https://arxiv.org/abs/2407.18490v1 (2024)

    2024 arXiv

  26. [34]

    Horsman, A

    D. Horsman, A. G. Fowler, S. Devitt, and R. V. Meter, Surface code quantum computing by lattice surgery, New Journal of Physics14, 123011 (2012)

    2012

  27. [35]

    L. Z. Cohen, I. H. Kim, S. D. Bartlett, and B. J. Brown, Low-overhead fault-tolerant quantum computing using long-range connectivity, Science Advances8, eabn1717 (2022), arXiv:2110.10794 [quant-ph]

    2022 arXiv

  28. [36]

    B. Ide, M. G. Gowda, P. J. Nadkarni, and G. Dauphinais, Fault-tolerant logical measurements via homological measurement, Physical Review X15, 021088 (2025), arXiv:2410.02753

    2025 arXiv

  29. [37]

    N. P. Breuckmann and J. N. Eberhardt, Balanced Product Quantum Codes, IEEE Transactions on Information Theory 67, 6653 (2021), arXiv:2012.09271 [quant-ph]

    2021 arXiv

  30. [38]

    Panteleev and G

    P. Panteleev and G. Kalachev, Quantum LDPC Codes with Almost Linear Minimum Distance, IEEE Transactions on Information Theory68, 213 (2022), arXiv:2012.04068 [cs.IT]

    2022 arXiv

  31. [39]

    Panteleev and G

    P. Panteleev and G. Kalachev, Asymptotically Good Quantum and Locally Testable Classical LDPC Codes (2022), arXiv:2111.03654 [cs]

    2022 arXiv

  32. [40]

    J. Haah, Classification of translation invariant topological Pauli stabilizer codes for prime dimensional qudits on two- 26 dimensional lattices, Journal of Mathematical Physics62, 012201 (2021)

    2021

  33. [41]

    Kitaev, Anyons in an exactly solved model and beyond, Annals of Physics321, 2 (2006), arXiv:cond-mat/0506438

    A. Kitaev, Anyons in an exactly solved model and beyond, Annals of Physics321, 2 (2006), arXiv:cond-mat/0506438

    2006 arXiv

  34. [42]

    Barkeshli, P

    M. Barkeshli, P. Bonderson, M. Cheng, and Z. Wang, Symmetry Fractionalization, Defects, and Gauging of Topological Phases, Physical Review B100, 115147 (2019), arXiv:1410.4540 [cond-mat]

    2019 arXiv

  35. [43]

    Wen, Quantum Orders and Symmetric Spin Liquids, Physical Review B65, 165113 (2002), arXiv:cond-mat/0107071

    X.-G. Wen, Quantum Orders and Symmetric Spin Liquids, Physical Review B65, 165113 (2002), arXiv:cond-mat/0107071

    2002 arXiv

  36. [44]

    Wen, Quantum orders in an exact soluble model, Physical Review Letters90, 016803 (2003), arXiv:quant- ph/0205004

    X.-G. Wen, Quantum orders in an exact soluble model, Physical Review Letters90, 016803 (2003), arXiv:quant- ph/0205004

    2003

  37. [45]

    Bombin and M

    H. Bombin and M. A. Martin-Delgado, Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study, https://arxiv.org/abs/quant-ph/0703272v1 (2007)

    2007 arXiv

  38. [46]

    Bombin and M

    H. Bombin and M. A. Martin-Delgado, Statistical Mechanical Models and Topological Color Codes, Physical Review A 77, 042322 (2008), arXiv:0711.0468 [quant-ph]

    2008 arXiv

  39. [47]

    D. A. Cox, J. B. Little, and D. O’Shea,Using Algebraic Geometry, second edition ed., Graduate Texts in Mathematics No. 185 (Springer Science+Business Media, Inc, New York, NY, 2005)

    2005

  40. [48]

    Atiyah and I

    M. Atiyah and I. MacDonald,Introduction to Commutative Algebra, Addison-Wesley Series in Mathematics (Avalon Pub- lishing, 1994)

    1994

  41. [49]

    K. Chen, Y. Liu, Y. Zhang, Z. Liang, Y.-A. Chen, K. Liu, and H. Song, Anyon Theory and Topological Frustration of High-Efficiency Quantum Low-Density Parity-Check Codes, Physical Review Letters135, 076603 (2025)

    2025

  42. [50]

    D. N. Bernshtein, The number of roots of a system of equations, Functional Analysis and Its Applications9, 183 (1975)

    1975

  43. [51]

    A. A. Suslin, On the Structure of the Special Linear Group Over Polynomial Rings, Izvestiya: Mathematics11, 221 (1977)

    1977

  44. [52]

    Park and C

    H. Park and C. Woodburn, An Algorithmic Proof of Suslin’s Stability Theorem over Polynomial Rings (1994), arXiv:alg- geom/9405003

    1994

  45. [53]

    Quillen, Projective modules over polynomial rings, Inventiones Mathematicae36, 167 (1976)

    D. Quillen, Projective modules over polynomial rings, Inventiones Mathematicae36, 167 (1976)

    1976

  46. [54]

    A. A. Suslin, Projective modules over polynomial rings are free, Doklady Akademii Nauk SSSR229, 1063 (1976)

    1976

  47. [55]

    Caniglia, G

    L. Caniglia, G. Corti˜ nas, S. Dan´ on, J. Heintz, T. Krick, and P. Solern´ o, Algorithmic aspects of Suslin’s proof of Serre’s conjecture, computational complexity3, 31 (1993)

    1993

  48. [56]

    Liang, Degree bounds for gr¨ obner bases of modules, Journal of Symbolic Computation111, 27 (2022)

    Y. Liang, Degree bounds for gr¨ obner bases of modules, Journal of Symbolic Computation111, 27 (2022)

    2022

  49. [57]

    Cartan and S

    H. Cartan and S. Eilenberg,Homological Algebra, Princeton Landmarks in Mathematics and Physics (Princeton University Press, 1999)

    1999

  50. [58]

    C. A. Weibel,An Introduction to Homological Algebra, 1st ed. (Cambridge University Press, 1994)

    1994

  51. [59]

    Liang, K

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

    2025

  52. [60]

    R. Zhou, X. Yuan, L. Kong, F. Zhang, K. Zhang, Z. Yang, and J. Chen, Bunny codes: Broadening superconducting quantum error correction capability through advanced control engineering (2026), arXiv:2606.22853 [quant-ph]

    2026 arXiv

  53. [61]

    Liang and Y.-A

    Z. Liang and Y.-A. Chen, Topological subsystem bivariate bicycle codes with four-qubit check operators (2026), arXiv:2605.04151 [quant-ph]

    2026 arXiv

  54. [62]

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

    2025 arXiv

  55. [63]

    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 (2024), arXiv:2308.07915 [quant-ph]

    2024 arXiv

  56. [64]

    Haah, Clifford Quantum Cellular Automata: Trivial group in 2D and Witt group in 3D, Journal of Mathematical Physics 62, 092202 (2021), arXiv:1907.02075 [quant-ph]

    J. Haah, Clifford Quantum Cellular Automata: Trivial group in 2D and Witt group in 3D, Journal of Mathematical Physics 62, 092202 (2021), arXiv:1907.02075 [quant-ph]

    2021 arXiv

  57. [65]

    Gross, V

    D. Gross, V. Nesme, H. Vogts, and R. F. Werner, Index theory of one dimensional quantum walks and cellular automata, Communications in Mathematical Physics310, 419 (2012), arXiv:0910.3675 [quant-ph]

    2012 arXiv

  58. [66]

    Kubica, B

    A. Kubica, B. Yoshida, and F. Pastawski, Unfolding the color code, New Journal of Physics17, 083026 (2015), arXiv:1503.02065 [quant-ph]

    2015 arXiv

  59. [67]

    Faug` ere, A new efficient algorithm for computing Gr¨ obner bases (F4), Journal of Pure and Applied Algebra139, 61 (1999)

    J.-C. Faug` ere, A new efficient algorithm for computing Gr¨ obner bases (F4), Journal of Pure and Applied Algebra139, 61 (1999)

    1999

  60. [68]

    Bardet, J.-C

    M. Bardet, J.-C. Faug` ere, and B. Salvy, On the complexity of the f5 gr¨ obner basis algorithm, Journal of Symbolic Com- putation70, 49 (2015)

    2015

  61. [69]

    Roffe, D

    J. Roffe, D. R. White, S. Burton, and E. Campbell, Decoding across the quantum low-density parity-check code landscape, Physical Review Research2, 10.1103/physrevresearch.2.043423 (2020)

    2020 doi

  62. [70]

    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]

    2026

  63. [71]

    Sahay, D

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

    2026 arXiv

  64. [72]

    Gottesman, Stabilizer codes and quantum error correction (1997), caltech Ph.D

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

    1997 arXiv

Pith tools

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