Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2608.09913

Superselection Rigidity of Topological Calderbank--Shor--Steane Codes: From Koszul-Complex Models to Nonsplit Extensions

Hao Song

quant-phcond-mat.str-elmath-phSubmitted Aug 10, 2026• Announced Aug 11, 2026• 0 citations• Revised Oct 29, 2026 (v2)
v1 · Aug 10, 2026v2 · Oct 29, 2026
arXivHTMLPDF

Abstract

Can excitation structure classify topological quantum codes up to finite-depth local circuits? For translation-invariant topological Calderbank--Shor--Steane (CSS) codes in arbitrary dimensions, we introduce excitation superselection profiles $\mathscr E_σ$ ($σ=X,Z$). Their cohomology layers $E_σ^\ell:=H^\ell(\mathscr E_σ)$ encode excitation types, fusion rules, and translation action, while $\mathscr E_σ$ retains cross-degree gluing. Pointlike, looplike, and higher-dimensional excitations correspond to degrees $\ell=1,2,\ldots$, respectively. Our matrix-level Schanuel-lemma method proves single-degree superselection rigidity: if $\mathscr E_σ$ is supported in a single degree $\ell$, then $E_σ^\ell$ and $\ell$ fix the stable translation-invariant Clifford class under a finite-resolution hypothesis automatic for prime qudits. If $E_σ^\ell$ is also finite, prime-qudit codes decouple into toric-code stacks by Clifford circuits after coarse graining, with the exact minimal threshold set by the translation kernel. We develop a unified topological theory of Koszul-complex models (encompassing toric codes, bivariate-bicycle codes, and Haah's cubic code): for regular models, we compute $E_σ^\ell$, prove $\mathscr E_σ$ is single-degree, express finite-torus logical modules as $\mathrm{Tor}$ groups, and obtain coarse-grained toric-stack normal forms at full length. Two constructions extend this framework to realize any admissible single-degree profile and build multi-degree extensions. The latter yields eight 3D qubit toric-code extensions with identical layers in both Pauli sectors and trivial translation action, yet distinct size-dependent ground-state degeneracies. The seven nonsplit models require blocking to decouple. Thus, cross-degree gluing carries translation-symmetry-enriched topological information invisible to individual layers.

Comments
37 pages, 4 figures, 2 tables. v2: updated title, added one figure and references

Related papers

Toric codes all the way down: decoupling translation-invariant topological CSS codes in higher dimensions

Mingxin He, Yifei Wang, Hao Song +1 more

Topological Calderbank-Shor-Steane (CSS) codes in more than two spatial dimensions offer features useful for fault-tolerant quantum computation, such as transversal non-Clifford gates and single-shot decoding, but a systematic understanding of them is still lacking. One approach is to decouple a code: map it to a stack of higher-form toric codes by a finite-depth local CSS-preserving Clifford circuit, possibly after adding ancillas. For translation-invariant $p$-ary CSS codes, where $p$ is prime ($p=2$ for qubits), we require the circuit to commute with the translations of a superlattice. In two dimensions, such a decoupling exists once these translations act trivially on every anyon type. In higher dimensions, excitations are sorted by their dimension into superselection layers, which can remain glued together even when translations act trivially on each layer. We show that this gluing is the only remaining obstruction: a code can be decoupled on a superlattice exactly when, after coarse-graining to it, translations act trivially on every layer and the gluing vanishes. Moreover, for a code with finitely many excitation types in each layer and $m$ nonzero layers, once translations act trivially on every layer, further coarse-graining by a factor of $p^{m-1}$ in every direction removes the aforementioned gluing. Physically, the same criterion determines when the code encodes the maximal number of logical qudits on a finite torus. Finally, we give an explicit algorithm that constructs the decoupling as a circuit of SUM (qudit CNOT) and SWAP gates.

quant-pharXiv:2610.40592•Oct 30, 2026•0 citations

Topological quantum color code model on infinite lattice

Shiyu Cao, Zhian Jia, Sheng Tan

The color code model is a crucial instance of a Calderbank-Shor-Steane (CSS)-type topological quantum error-correcting code, which notably supports transversal implementation of the full Clifford group. Its robustness against local noise is rooted in the structure of its topological excitations. From the perspective of quantum phases of matter, it is essential to understand these excitations in the thermodynamic limit. In this work, we analyze the color code model on an infinite lattice within the quasi-local $C^{*}$-algebra framework, using a cone-localized Doplicher-Haag-Roberts (DHR) analysis. We classify its irreducible anyon superselection sectors and construct explicit string operators that generate anyonic excitations from the ground state. We further examine the fusion and braiding properties of these excitations. Our results show that the topological order of the color code is described by $\mathsf{Rep}(D(\mathbb{Z}_2 \times \mathbb{Z}_2)) \simeq \mathsf{Rep}(D(\mathbb{Z}_2)) \boxtimes \mathsf{Rep}(D(\mathbb{Z}_2))$, which is equivalent to a double layer of the toric code and consistent with established analyses on finite lattices. We also establish the existence and uniqueness of the KMS state at every finite inverse temperature and derive an explicit description of the corresponding thermal distribution of stabilizer excitations.

quant-pharXiv:2601.12409•Letters in Mathematical Physics•Jan 20, 2026•0 citations

Decoupling 2D translation-invariant topological CSS codes

Yifei Wang, Zhongyi Ni, Mingxin He +2 more

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.

quant-pharXiv:2608.09915•Aug 11, 2026•0 citations

Calderbank-Shor-Steane codes on group-valued qudits

Ben T. McDonough, Jian-Hao Zhang, Victor V. Albert +1 more

Calderbank-Shor-Steane (CSS) codes are a versatile quantum error-correcting family built out of commuting $X$- and $Z$-type checks. We introduce CSS-like codes on $G$-valued qudits for any finite group $G$ that reduce to qubit CSS codes for $G = \mathbb{Z}_2$ yet generalize the Kitaev quantum double model for general groups. The $X$-checks of our group-CSS codes correspond to left and/or right multiplication by group elements, while $Z$-checks project onto solutions to group word equations. We describe quantum-double models on oriented two-dimensional CW complexes (which need not cellulate a manifold) and prove that, when $G$ is non-Abelian and simple, every $G$-covariant group-CSS code with suitably upper-bounded $Z$-check weight and lower-bounded $Z$-distance reduces to a CW quantum double. We describe the codespace and logical operators of CW quantum doubles via the same intuition used to obtain logical structure of surface codes. We obtain distance bounds for codes on non-Abelian simple groups from the graph underlying the CW complex, and construct intrinsically non-Abelian code families with asymptotically optimal rate and distances. Adding "ghost vertices" to the CW complex generalizes quantum double models with defects and rough boundary conditions whose logical structure can be understood without reference to non-Abelian anyons or defects. Several non-invertible symmetry-protected topological states, both with ordinary and higher-form symmetries, are the unique codewords of simply-connected CW quantum doubles with a single ghost vertex.

quant-pharXiv:2602.19558•Feb 24, 2026•0 citations

Beyond transversality: structure of Clifford circuits for CSS codes

Victor V. Albert

We characterize four groups of Clifford circuits for Calderbank--Shor--Steane (CSS) codes that are relevant to fault-tolerant logical operations. First, we show that every code-preserving Clifford circuit is a product of Z-diagonal circuits, composed of S and CZ gates, and their X-basis analogues. Second, we define the two-fold transversal group, generated by depth-one two-local code-preserving circuits, and show that each of its elements can be expressed as a product of layers consisting of either Z-diagonal, X-diagonal, or CNOT gates. As a corollary, every transversal gate is a product of three transversal diagonal circuits; for connected non-self-dual codes, two such circuits suffice. We further show that every code-preserving automorphism circuit, consisting of single-qubit Clifford gates and permutations, has a normal form comprising a Hadamard layer, a permutation, and two diagonal circuits. We also define a two-fold automorphism group, in which a depth-one two-local circuit may be code-preserving up to a permutation, and show that its logical image can be larger than that of the two-fold transversal group. For 231 CSS codes, we provide explicit generators and determine the logical image of the two-fold transversal group. We tabulate 173 codes whose full logical Clifford group is generated by two-fold-transversal circuits, including codes of distances 3, 4, 5, 6, 8, 10, 12, and 13, with respective best rates 2/5, 3/4, 34/77, 17/28, 14/25, 1/27, 3/56, and 1/33. We construct families of CSS codes from bipartite grids, cut-complements, and quadrics, and census the self-dual codes invariant under rank-3 permutation groups. Many of these codes realize the full logical Clifford group in this way.

quant-pharXiv:2608.05688•Aug 7, 2026•0 citations

Classification of translation invariant topological Pauli stabilizer codes for prime dimensional qudits on two-dimensional lattices

Jeongwan Haah

We prove that on any two-dimensional lattice of qudits of a prime dimension, every translation invariant Pauli stabilizer group with local generators and with the code distance being the linear system size is decomposed by a local Clifford circuit of constant depth into a finite number of copies of the toric code stabilizer group (Abelian discrete gauge theory). This means that under local Clifford circuits, the number of toric code copies is the complete invariant of topological Pauli stabilizer codes. Previously, the same conclusion was obtained under the assumption of nonchirality for qubit codes or the Calderbank–Shor–Steane structure for prime qudit codes; we do not assume any of these.

arXiv:1812.11193•Journal of Mathematical Physics•Jan 1, 2021•35 citations
Can excitation structure classify topological quantum codes up to finite-depth local circuits? For translation-invariant topological Calderbank--Shor--Steane (CSS) codes in arbitrary dimensions, we introduce excitation superselection profiles Eσ\mathscr E_σEσ​ (σ=X,Zσ=X,Zσ=X,Z). Their cohomology layers Eσℓ:=Hℓ(Eσ)E_σ^\ell:=H^\ell(\mathscr E_σ)Eσℓ​:=Hℓ(Eσ​) encode excitation types, fusion rules, and translation action, while Eσ\mathscr E_σEσ​ retains cross-degree gluing. Pointlike, looplike, and higher-dimensional excitations correspond to degrees ℓ=1,2,…\ell=1,2,\ldotsℓ=1,2,…, respectively. Our matrix-level Schanuel-lemma method proves single-degree superselection rigidity: if Eσ\mathscr E_σEσ​ is supported in a single degree ℓ\ellℓ, then EσℓE_σ^\ellEσℓ​ and ℓ\ellℓ fix the stable translation-invariant Clifford class under a finite-resolution hypothesis automatic for prime qudits. If EσℓE_σ^\ellEσℓ​ is also finite, prime-qudit codes decouple into toric-code stacks by Clifford circuits after coarse graining, with the exact minimal threshold set by the translation kernel. We develop a unified topological theory of Koszul-complex models (encompassing toric codes, bivariate-bicycle codes, and Haah's cubic code): for regular models, we compute EσℓE_σ^\ellEσℓ​, prove Eσ\mathscr E_σEσ​ is single-degree, express finite-torus logical modules as Tor\mathrm{Tor}Tor groups, and obtain coarse-grained toric-stack normal forms at full length. Two constructions extend this framework to realize any admissible single-degree profile and build multi-degree extensions. The latter yields eight 3D qubit toric-code extensions with identical layers in both Pauli sectors and trivial translation action, yet distinct size-dependent ground-state degeneracies. The seven nonsplit models require blocking to decouple. Thus, cross-degree gluing carries translation-symmetry-enriched topological information invisible to individual layers.
Topological Calderbank-Shor-Steane (CSS) codes in more than two spatial dimensions offer features useful for fault-tolerant quantum computation, such as transversal non-Clifford gates and single-shot decoding, but a systematic understanding of them is still lacking. One approach is to decouple a code: map it to a stack of higher-form toric codes by a finite-depth local CSS-preserving Clifford circuit, possibly after adding ancillas. For translation-invariant ppp-ary CSS codes, where ppp is prime (p=2p=2p=2 for qubits), we require the circuit to commute with the translations of a superlattice. In two dimensions, such a decoupling exists once these translations act trivially on every anyon type. In higher dimensions, excitations are sorted by their dimension into superselection layers, which can remain glued together even when translations act trivially on each layer. We show that this gluing is the only remaining obstruction: a code can be decoupled on a superlattice exactly when, after coarse-graining to it, translations act trivially on every layer and the gluing vanishes. Moreover, for a code with finitely many excitation types in each layer and mmm nonzero layers, once translations act trivially on every layer, further coarse-graining by a factor of pm−1p^{m-1}pm−1 in every direction removes the aforementioned gluing. Physically, the same criterion determines when the code encodes the maximal number of logical qudits on a finite torus. Finally, we give an explicit algorithm that constructs the decoupling as a circuit of SUM (qudit CNOT) and SWAP gates.
The color code model is a crucial instance of a Calderbank-Shor-Steane (CSS)-type topological quantum error-correcting code, which notably supports transversal implementation of the full Clifford group. Its robustness against local noise is rooted in the structure of its topological excitations. From the perspective of quantum phases of matter, it is essential to understand these excitations in the thermodynamic limit. In this work, we analyze the color code model on an infinite lattice within the quasi-local C∗C^{*}C∗-algebra framework, using a cone-localized Doplicher-Haag-Roberts (DHR) analysis. We classify its irreducible anyon superselection sectors and construct explicit string operators that generate anyonic excitations from the ground state. We further examine the fusion and braiding properties of these excitations. Our results show that the topological order of the color code is described by Rep(D(Z2×Z2))≃Rep(D(Z2))⊠Rep(D(Z2))\mathsf{Rep}(D(\mathbb{Z}_2 \times \mathbb{Z}_2)) \simeq \mathsf{Rep}(D(\mathbb{Z}_2)) \boxtimes \mathsf{Rep}(D(\mathbb{Z}_2))Rep(D(Z2​×Z2​))≃Rep(D(Z2​))⊠Rep(D(Z2​)), which is equivalent to a double layer of the toric code and consistent with established analyses on finite lattices. We also establish the existence and uniqueness of the KMS state at every finite inverse temperature and derive an explicit description of the corresponding thermal distribution of stabilizer excitations.
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.
Calderbank-Shor-Steane (CSS) codes are a versatile quantum error-correcting family built out of commuting XXX- and ZZZ-type checks. We introduce CSS-like codes on GGG-valued qudits for any finite group GGG that reduce to qubit CSS codes for G=Z2G = \mathbb{Z}_2G=Z2​ yet generalize the Kitaev quantum double model for general groups. The XXX-checks of our group-CSS codes correspond to left and/or right multiplication by group elements, while ZZZ-checks project onto solutions to group word equations. We describe quantum-double models on oriented two-dimensional CW complexes (which need not cellulate a manifold) and prove that, when GGG is non-Abelian and simple, every GGG-covariant group-CSS code with suitably upper-bounded ZZZ-check weight and lower-bounded ZZZ-distance reduces to a CW quantum double. We describe the codespace and logical operators of CW quantum doubles via the same intuition used to obtain logical structure of surface codes. We obtain distance bounds for codes on non-Abelian simple groups from the graph underlying the CW complex, and construct intrinsically non-Abelian code families with asymptotically optimal rate and distances. Adding "ghost vertices" to the CW complex generalizes quantum double models with defects and rough boundary conditions whose logical structure can be understood without reference to non-Abelian anyons or defects. Several non-invertible symmetry-protected topological states, both with ordinary and higher-form symmetries, are the unique codewords of simply-connected CW quantum doubles with a single ghost vertex.
We characterize four groups of Clifford circuits for Calderbank--Shor--Steane (CSS) codes that are relevant to fault-tolerant logical operations. First, we show that every code-preserving Clifford circuit is a product of Z-diagonal circuits, composed of S and CZ gates, and their X-basis analogues. Second, we define the two-fold transversal group, generated by depth-one two-local code-preserving circuits, and show that each of its elements can be expressed as a product of layers consisting of either Z-diagonal, X-diagonal, or CNOT gates. As a corollary, every transversal gate is a product of three transversal diagonal circuits; for connected non-self-dual codes, two such circuits suffice. We further show that every code-preserving automorphism circuit, consisting of single-qubit Clifford gates and permutations, has a normal form comprising a Hadamard layer, a permutation, and two diagonal circuits. We also define a two-fold automorphism group, in which a depth-one two-local circuit may be code-preserving up to a permutation, and show that its logical image can be larger than that of the two-fold transversal group. For 231 CSS codes, we provide explicit generators and determine the logical image of the two-fold transversal group. We tabulate 173 codes whose full logical Clifford group is generated by two-fold-transversal circuits, including codes of distances 3, 4, 5, 6, 8, 10, 12, and 13, with respective best rates 2/5, 3/4, 34/77, 17/28, 14/25, 1/27, 3/56, and 1/33. We construct families of CSS codes from bipartite grids, cut-complements, and quadrics, and census the self-dual codes invariant under rank-3 permutation groups. Many of these codes realize the full logical Clifford group in this way.
We prove that on any two-dimensional lattice of qudits of a prime dimension, every translation invariant Pauli stabilizer group with local generators and with the code distance being the linear system size is decomposed by a local Clifford circuit of constant depth into a finite number of copies of the toric code stabilizer group (Abelian discrete gauge theory). This means that under local Clifford circuits, the number of toric code copies is the complete invariant of topological Pauli stabilizer codes. Previously, the same conclusion was obtained under the assumption of nonchirality for qubit codes or the Calderbank–Shor–Steane structure for prime qudit codes; we do not assume any of these.