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:2606.19873

Random Local Stabilizer Codes in Three Dimensions without String or Self-Similar Fractal Logical Operators

Han Yan

quant-phcond-mat.str-elSubmitted Jun 18, 2026• Announced Jun 19, 2026• 0 citations• Revised Jun 19, 2026 (v2)
v1 · Jun 18, 2026v2 · Jun 19, 2026
arXivHTMLPDF

Abstract

Quantum error-correcting codes (QECs) are essential components of quantum computation and have deep connections to quantum phases of matter. A key obstruction to passive self-correcting QECs is the presence of string logical operators, which can generate logical errors through constant-energy-barrier processes. Haah's Codes (fracton codes) showed that three-dimensional stabilizer codes can forbid such string logical operators, but their translation-invariant structure supports self-similar fractal logical operators with a logarithmic energy barrier. We introduce the qutrit random cubic codes, a family of local qutrit Calderbank-Shor-Steane stabilizer Hamiltonians with similar cube-check structure as Haah's Code 1 but built from spatially varying stabilizers. We prove that these models retain the no-string property and numerically observe that they have properties distinct from translation-invariant fracton codes: the smallest ground-state degeneracy exponent is $k=2$ for odd $L$ and $k=4$ for even $L$; noncontractible plane-logical operators span the entire logical space; and charge-push diagnostics show that the self-similar fractal operators are absent. These results demonstrate that constrained randomness can fundamentally change the nature of stabilizer codes and improve their self-correction properties. They further point to broader families of quantum error-correcting codes and quantum phases beyond canonical topological and fracton orders.

Comments
20 pages, 11 figures. Repository for data: https://github.com/hanyanphysics/QTRCC

Related papers

3D local qupit quantum code without string logical operator

Isaac H. Kim

Recently Haah introduced a new quantum error correcting code embedded on a cubic lattice. One of the defining properties of this code is the absence of string logical operator. We present new codes with similar properties by relaxing the condition on the local particle dimension. The resulting code is well-defined when the local Hilbert space dimension is prime. These codes can be divided into two different classes: the local stabilizer generators are either symmetric or antisymmetric with respect to the inversion operation. These is a nontrivial correspondence between these two classes. For any symmetric code without string logical operator, there exists a complementary antisymmetric code with the same property and vice versa. We derive a sufficient condition for the absence of string logical operator in terms of the algebraic constraints on the defining parameters of the code. Minimal number of local particle dimension which satisfies the condition is 5. These codes have logarithmic energy barrier for any logical error.

arXiv:1202.0052•Jan 1, 2011•41 citations

Z N generalizations of three-dimensional stabilizer codes

Chanbeen Lee, Yaozong Hu, Gil Young Cho +1 more

The authors generalize here three-dimensional \ensuremath{\mathbb{Z}}${}_{2}$ stabilizer models---the X-cube, toric code, and Haah's code---to their \ensuremath{\mathbb{Z}}${}_{N}$ counterparts, revealing size-dependent ground-state degeneracy and novel excitations. They demonstrate that the generalized X-cube hosts quasi-fractons that remain immobile under local operations but become mobile via global ones. In the toric code, both closed-loop and open-string excitations emerge, while Haah's code features new fracton tripole and monopole excitations. These findings uncover unconventional topological orders and broaden the understanding of fracton phases beyond the conventional \ensuremath{\mathbb{Z}}${}_{2}$ framework.

arXiv:2504.09847•Physical review. B./Physical review. B•Sep 24, 2025•2 citations

Ungauging quantum error-correcting codes

Aleksander Kubica, Beni Yoshida

We develop the procedures of gauging and ungauging, reveal their operational meaning and propose their generalization in a systematic manner within the framework of quantum error-correcting codes. We demonstrate with an example of the subsystem Bacon-Shor code that the ungauging procedure can result in models with unusual symmetry operators constrained to live on lower-dimensional structures. We apply our formalism to the three-dimensional gauge color code (GCC) and show that its codeword space is equivalent to the Hilbert space of six copies of $\mathbb{Z}_2$ lattice gauge theory with $1$-form symmetries. We find that three different stabilizer Hamiltonians associated with the GCC correspond to distinct thermal symmetry-protected topological (SPT) phases in the presence of the stabilizer symmetries of the GCC. One of the considered Hamiltonians describes the Raussendorf-Bravyi-Harrington model, which is universal for measurement-based quantum computation at non-zero temperature. We also propose a general procedure of creating $D$-dimensional SPT Hamiltonians from $(D+1)$-dimensional CSS stabilizer Hamiltonians by exploiting a relation between gapped domain walls and transversal logical gates. As a result, we find an explicit two-dimensional realization of a non-trivial fracton SPT phase protected by fractal-like symmetries.

arXiv:1805.01836•May 4, 2018•117 citations

Quantum XYZ Stabilizer Codes

Alessio Baldelli, Davide Orsucci, Francisco Lázaro +1 more

Stabilizer codes are often constructed within the Calderbank--Shor--Steane (CSS) framework, where two mutually orthogonal binary classical codes define $X$ and $Z$-type stabilizer generators. While this structure is algebraically convenient, additional non-CSS constraints may help suppress low-weight logical operators and improve decoding performance in the finite-length regime. We thus introduce quantum XYZ stabilizer codes, whose parity-check matrix (PCM) is built from three pairwise orthogonal binary PCMs associated with $X$-, $Y$-, and $Z$-type stabilizer generators. A nontrivial point is that an XYZ code instance is not automatically genuinely non-CSS: the same stabilizer group may admit a CSS generating set. We characterize this collapse, obtaining algebraic and rank conditions for deciding when the $Y$-type checks are redundant and when they define genuinely non-CSS stabilizer constraints. We also derive upper and lower bounds on the quantum minimum distance, including bounds for mixed Pauli logical operators. The novel framework includes a known non-CSS topological code, namely the XYZ$^2$ hexagonal code, and yields also sparse finite-length quantum low-density parity-check (qLDPC) constructions from intersecting-subset and quasi-dyadic code families. Simulations under depolarizing code-capacity noise and quaternary belief propagation decoding show that the proposed XYZ qLDPC instances can outperform representative CSS qLDPC instances with similar finite-length parameters.

cs.ITCross-listedarXiv:2607.14988•Jul 17, 2026•1 citation

Local stabilizer codes in three dimensions without string logical operators

Jeongwan Haah

We suggest concrete models for self-correcting quantum memory by reporting examples of local stabilizer codes in 3D that have no string logical operators. Previously known local stabilizer codes in 3D all have stringlike logical operators, which make the codes non-self-correcting. We introduce a notion of ``logical string segments'' to avoid difficulties in defining one-dimensional objects in discrete lattices. We prove that every stringlike logical operator of our code can be deformed to a disjoint union of short segments, each of which is in the stabilizer group. The code has surfacelike logical operators whose partial implementation has unsatisfied stabilizers along its boundary.

arXiv:1101.1962•Physical Review A•Apr 22, 2011•747 citations

Layer Codes as Partially Self-Correcting Quantum Memories

Shouzhen Gu, Libor Caha, Shin Ho Choe +3 more

We investigate layer codes, a family of three-dimensional stabilizer codes that achieves optimal scaling of code parameters and energy barrier, as candidates for self-correcting quantum memories. First, we introduce two decoding algorithms for layer codes with provable guarantees for local stochastic and adversarial noise, respectively. We then prove that layer codes constitute partially self-correcting quantum memories which outperform previously analyzed models such as the cubic and welded solid codes. Notably, we argue that partial self-correction without the requirement of efficient decoding is more common than expected, as it arises solely from a diverging energy barrier. This draws a sharp distinction between partially self-correcting systems and partially self-correcting memories. Another novel aspect of our work is an analysis of layer codes constructed from random Calderbank-Shor-Steane codes. We show that these random layer codes have optimal scaling (up to logarithmic corrections) of code parameters and energy barrier. Finally, we present numerical studies of their memory times and report behavior consistent with partial self-correction.

arXiv:2510.06659•Physical Review Letters•Apr 9, 2026•9 citations
Quantum error-correcting codes (QECs) are essential components of quantum computation and have deep connections to quantum phases of matter. A key obstruction to passive self-correcting QECs is the presence of string logical operators, which can generate logical errors through constant-energy-barrier processes. Haah's Codes (fracton codes) showed that three-dimensional stabilizer codes can forbid such string logical operators, but their translation-invariant structure supports self-similar fractal logical operators with a logarithmic energy barrier. We introduce the qutrit random cubic codes, a family of local qutrit Calderbank-Shor-Steane stabilizer Hamiltonians with similar cube-check structure as Haah's Code 1 but built from spatially varying stabilizers. We prove that these models retain the no-string property and numerically observe that they have properties distinct from translation-invariant fracton codes: the smallest ground-state degeneracy exponent is k=2k=2k=2 for odd LLL and k=4k=4k=4 for even LLL; noncontractible plane-logical operators span the entire logical space; and charge-push diagnostics show that the self-similar fractal operators are absent. These results demonstrate that constrained randomness can fundamentally change the nature of stabilizer codes and improve their self-correction properties. They further point to broader families of quantum error-correcting codes and quantum phases beyond canonical topological and fracton orders.
Recently Haah introduced a new quantum error correcting code embedded on a cubic lattice. One of the defining properties of this code is the absence of string logical operator. We present new codes with similar properties by relaxing the condition on the local particle dimension. The resulting code is well-defined when the local Hilbert space dimension is prime. These codes can be divided into two different classes: the local stabilizer generators are either symmetric or antisymmetric with respect to the inversion operation. These is a nontrivial correspondence between these two classes. For any symmetric code without string logical operator, there exists a complementary antisymmetric code with the same property and vice versa. We derive a sufficient condition for the absence of string logical operator in terms of the algebraic constraints on the defining parameters of the code. Minimal number of local particle dimension which satisfies the condition is 5. These codes have logarithmic energy barrier for any logical error.
The authors generalize here three-dimensional \ensuremath{\mathbb{Z}}2{}_{2}2​ stabilizer models---the X-cube, toric code, and Haah's code---to their \ensuremath{\mathbb{Z}}N{}_{N}N​ counterparts, revealing size-dependent ground-state degeneracy and novel excitations. They demonstrate that the generalized X-cube hosts quasi-fractons that remain immobile under local operations but become mobile via global ones. In the toric code, both closed-loop and open-string excitations emerge, while Haah's code features new fracton tripole and monopole excitations. These findings uncover unconventional topological orders and broaden the understanding of fracton phases beyond the conventional \ensuremath{\mathbb{Z}}2{}_{2}2​ framework.
We develop the procedures of gauging and ungauging, reveal their operational meaning and propose their generalization in a systematic manner within the framework of quantum error-correcting codes. We demonstrate with an example of the subsystem Bacon-Shor code that the ungauging procedure can result in models with unusual symmetry operators constrained to live on lower-dimensional structures. We apply our formalism to the three-dimensional gauge color code (GCC) and show that its codeword space is equivalent to the Hilbert space of six copies of Z2\mathbb{Z}_2Z2​ lattice gauge theory with 111-form symmetries. We find that three different stabilizer Hamiltonians associated with the GCC correspond to distinct thermal symmetry-protected topological (SPT) phases in the presence of the stabilizer symmetries of the GCC. One of the considered Hamiltonians describes the Raussendorf-Bravyi-Harrington model, which is universal for measurement-based quantum computation at non-zero temperature. We also propose a general procedure of creating DDD-dimensional SPT Hamiltonians from (D+1)(D+1)(D+1)-dimensional CSS stabilizer Hamiltonians by exploiting a relation between gapped domain walls and transversal logical gates. As a result, we find an explicit two-dimensional realization of a non-trivial fracton SPT phase protected by fractal-like symmetries.
Stabilizer codes are often constructed within the Calderbank--Shor--Steane (CSS) framework, where two mutually orthogonal binary classical codes define XXX and ZZZ-type stabilizer generators. While this structure is algebraically convenient, additional non-CSS constraints may help suppress low-weight logical operators and improve decoding performance in the finite-length regime. We thus introduce quantum XYZ stabilizer codes, whose parity-check matrix (PCM) is built from three pairwise orthogonal binary PCMs associated with XXX-, YYY-, and ZZZ-type stabilizer generators. A nontrivial point is that an XYZ code instance is not automatically genuinely non-CSS: the same stabilizer group may admit a CSS generating set. We characterize this collapse, obtaining algebraic and rank conditions for deciding when the YYY-type checks are redundant and when they define genuinely non-CSS stabilizer constraints. We also derive upper and lower bounds on the quantum minimum distance, including bounds for mixed Pauli logical operators. The novel framework includes a known non-CSS topological code, namely the XYZ2^22 hexagonal code, and yields also sparse finite-length quantum low-density parity-check (qLDPC) constructions from intersecting-subset and quasi-dyadic code families. Simulations under depolarizing code-capacity noise and quaternary belief propagation decoding show that the proposed XYZ qLDPC instances can outperform representative CSS qLDPC instances with similar finite-length parameters.
We suggest concrete models for self-correcting quantum memory by reporting examples of local stabilizer codes in 3D that have no string logical operators. Previously known local stabilizer codes in 3D all have stringlike logical operators, which make the codes non-self-correcting. We introduce a notion of ``logical string segments'' to avoid difficulties in defining one-dimensional objects in discrete lattices. We prove that every stringlike logical operator of our code can be deformed to a disjoint union of short segments, each of which is in the stabilizer group. The code has surfacelike logical operators whose partial implementation has unsatisfied stabilizers along its boundary.
We investigate layer codes, a family of three-dimensional stabilizer codes that achieves optimal scaling of code parameters and energy barrier, as candidates for self-correcting quantum memories. First, we introduce two decoding algorithms for layer codes with provable guarantees for local stochastic and adversarial noise, respectively. We then prove that layer codes constitute partially self-correcting quantum memories which outperform previously analyzed models such as the cubic and welded solid codes. Notably, we argue that partial self-correction without the requirement of efficient decoding is more common than expected, as it arises solely from a diverging energy barrier. This draws a sharp distinction between partially self-correcting systems and partially self-correcting memories. Another novel aspect of our work is an analysis of layer codes constructed from random Calderbank-Shor-Steane codes. We show that these random layer codes have optimal scaling (up to logarithmic corrections) of code parameters and energy barrier. Finally, we present numerical studies of their memory times and report behavior consistent with partial self-correction.