We study a broad class of qudit stabilizer codes, termed $\mathbb{Z}_N$ bivariate-bicycle (BB) codes, arising either as two-dimensional realizations of modulated gauge theories or as $\mathbb{Z}_N$ generalizations of binary BB codes. Our central finding, derived from the polynomial representation, is that the essential topological properties of these $\mathbb{Z}_N$ codes can be determined by the properties of their $\mathbb{Z}_p$ counterparts, where $p$ are the prime factors of $N$, even when $N$ contains prime powers ($N = \prod_i p_i^{k_i}$). This result yields a significant simplification by leveraging the well-studied framework of codes with prime qudit dimensions. In particular, this insight directly enables the generalization of the algebraic-geometric methods (e.g., the Bernstein-Khovanskii-Kushnirenko theorem) to determine anyon fusion rules in the general qudit situation. Moreover, we elucidate the symmetry-enriched topological (SET) order underlying the quasifractonic behavior in qudit BB codes (including the Delfino-Chamon-You model), resolving the associated anyon mobility puzzle. We also develop an efficient computational algebraic method, based on Gröbner bases over the ring of integers, to determine both the topological order and its SET properties.
Symmetry-enriched topological order and quasifractonic behavior in ZN stabilizer codes
We study a broad class of qudit stabilizer codes, termed ZN bivariate-bicycle (BB) codes, arising either as two-dimensional realizations of modulated gauge theories or as ZN generalizations of binary BB codes. Our central finding, derived from the polynomial representation, is that the essential topological properties of these ZN codes can be determined by the properties of their Zp counterparts, where p are the prime factors of N, even when N contains prime powers (N=∏ipiki). This result yields a significant simplification by leveraging the well-studied framework of codes with prime qudit dimensions. In particular, this insight directly enables the generalization of the algebraic-geometric methods (e.g., the Bernstein-Khovanskii-Kushnirenko theorem) to determine anyon fusion rules in the general qudit situation. Moreover, we elucidate the symmetry-enriched topological (SET) order underlying the quasifractonic behavior in qudit BB codes (including the Delfino-Chamon-You model), resolving the associated anyon mobility puzzle. We also develop an efficient computational algebraic method, based on Gröbner bases over the ring of integers, to determine both the topological order and its SET properties.
Quantum low-density parity-check (QLDPC) codes offer a promising path to low-overhead fault-tolerant quantum computation but lack systematic strategies for exploration. In this Letter, we establish a topological framework for studying the bivariate-bicycle codes, a prominent class of QLDPC codes tailored for real-world quantum hardware. Our framework enables the investigation of these codes through universal properties of topological orders. In addition to efficient characterizations using Gröbner bases, we also introduce a novel algebraic-geometric approach based on the Bernstein-Khovanskii-Kushnirenko theorem. This approach allows us to analytically determine how the topological order varies with the generic choices of bivariate-bicycle codes under toric layouts. Novel phenomena are unveiled, including topological frustration, where ground-state degeneracy on a torus deviates from the total anyon number, and quasifractonic mobility, where anyon movement violates energy conservation. We demonstrate their intrinsic link to symmetry-enriched topological orders and derive an efficient method for generating finite-size codes. Furthermore, we extend the connection between anyons and logical operators using Koszul complex theory. Our Letter provides a rigorous theoretical basis for exploring the fault tolerance of QLDPC codes and deepens the interplay among topological order, quantum error correction, and advanced algebraic structures.
The Kitaev toric code is widely considered one of the leading candidates for error correction in fault-tolerant quantum computation. However, direct methods to increase its logical dimensions, such as lattice surgery or introducing punctures, often incur prohibitive overheads. In this work, we introduce a ring-theoretic approach for efficiently analyzing topological CSS codes in two dimensions, enabling the exploration of generalized toric codes with larger logical dimensions on twisted tori. Using Gröbner bases, we simplify stabilizer syndromes to efficiently identify anyon excitations and their geometric periodicities, even under twisted periodic boundary conditions. Since the properties of the codes are determined by the anyons, this approach allows us to directly compute the logical dimensions without constructing large parity-check matrices. Our approach provides a unified method for finding new quantum error-correcting codes and exhibiting their underlying topological orders via the Laurent polynomial ring. This framework naturally applies to bivariate bicycle codes. For example, we construct optimal weight-6 generalized toric codes on twisted tori with parameters [ [ n , k , d ] ] for n ≤ 400 , yielding novel codes such as [ [ 120 , 8 , 12 ] ] , [ [ 186 , 10 , 14 ] ] , [ [ 210 , 10 , 16 ] ] , [ [ 248 , 10 , 18 ] ] , [ [ 254 , 14 , 16 ] ] , [ [ 294 , 10 , 20 ] ] , [ [ 310 , 10 , ≤ 22 ] ] , and [ [ 340 , 16 , 18 ] ] . Moreover, we present a new realization of the [ [ 360 , 12 , ≤ 24 ] ] quantum code using the ( 3 , 3 ) -bivariate bicycle code on a twisted torus defined by the basis vectors ( 0 , 30 ) and ( 6 , 6 ) , improving stabilizer locality relative to the previous construction. These results highlight the power of the topological order perspective in advancing the design and theoretical understanding of quantum low-density parity-check (LDPC) codes.
We study finite-length qudit quantum low-density parity-check (LDPC) codes from translation-invariant CSS constructions on two-dimensional tori with twisted boundary conditions. Recent qubit work [PRX Quantum 6, 020357 (2025)] showed that, within the bivariate-bicycle viewpoint, twisting generalized toric patterns can significantly improve the finite-size distance of qubit codes. Building on this insight, we extend the construction and the search to qudit codes over finite fields. Using algebraic methods based on Laurent-polynomial ideals and Gröbner-basis computations over Fq, we compute the number of logical qudits on any twisted torus and identify compact codes with favorable rate--distance tradeoffs. Overall, for the finite sizes explored, twisted-torus qudit constructions typically achieve larger estimated distances than their untwisted counterparts and, at the same number of physical and logical qudits, larger estimated distances than previously reported twisted qubit instances. The best new codes are tabulated.
Stabilizer codes provide exact lattice realizations of bosonic topological orders. In contrast, systematic stabilizer descriptions of intrinsically fermionic topological phases remain much less developed. In this work, we introduce Majorana-Pauli stabilizer codes, a class of exactly solvable fermionic lattice models whose stabilizers are built from both generalized Pauli operators and Majorana operators. As a main example, we construct an exactly solvable stabilizer realization of the fermionic toric code: an intrinsically fermionic Z2 topological order in (2+1) dimensions, using Z8 Pauli operators coupled to Majorana modes. Within this stabilizer framework, the anyons, string operators, fusion rules, and braiding statistics all follow naturally from the stabilizer algebra. More broadly, we show that the fermionic toric code belongs to a duality web generated by anyon condensation and by gauging or ungauging bosonic or fermionic symmetries. This web connects bosonic topological orders, symmetry-enriched topological (SET) phases, and both bosonic and fermionic symmetry-protected topological (SPT) phases, all within a common stabilizer description. We extend this construction to all Abelian fermionic topological orders with gapped boundaries and to fermionic SPT phases whose fully gauged theories are Abelian. Going beyond Majorana operators, we introduce fermionic versions of the clock and shift operators and use them to construct an exact bosonization map for ZDF symmetries for D even. Using this, we realize a stabilizer model for a nontrivial Z8F fermionic SPT phase with no free-fermion analog. Altogether, these results extend the stabilizer-code paradigm to a broad class of intrinsically fermionic phases bridging fermionic quantum many-body physics to quantum error correction.
Quantum low-density parity-check codes, such as the Kitaev toric code and bivariate bicycle codes, are often defined with periodic boundary conditions, which are difficult to realize in physical systems. In this paper, we present an algorithm for constructing all gapped boundaries and defects of two-dimensional Pauli stabilizer codes. Using the operator algebra formalism, we establish a one-to-one correspondence between the topological data, such as anyon fusion rules and topological spins, of two-dimensional bulk stabilizer codes and one-dimensional boundary anomalous subsystem codes. To make the operator algebra computationally accessible, we adapt Laurent polynomials and convert the tasks into matrix operations, e.g., the Hermite normal form for obtaining boundary anyons and the Smith normal form for determining fusion rules. This approach enables computers to automatically generate all possible gapped boundaries and defects for topological Pauli stabilizer codes through boundary anyon condensation and topological order completion. This streamlines the analysis of surface codes and associated logical operations for fault-tolerant quantum computation. Our algorithm applies to Zd qudits for both prime and nonprime d, enabling exploration of topological phases beyond the Kitaev toric code. We have applied the algorithm and explicitly demonstrated the lattice constructions of 2 boundaries and 6 defects in the Z2 toric code, 3 boundaries and 22 defects in the Z4 toric code, 1 boundary and 2 defects in the double semion code, 1 boundary and 22 defects in the six-semion code, 6 boundaries and 270 defects in the color code, and 6 defects in the anomalous three-fermion code. Finally, we study the boundaries of bivariate bicycle codes, showing that they exhibit large logical dimensions and anyons with long translation periods.
High-rate bivariate bicycle (BB) codes are promising low-overhead quantum memories, but their stabilizer checks typically have weight 6 or higher, making syndrome extraction challenging. We introduce subsystem bivariate bicycle (SBB) codes, a translation-invariant CSS subsystem construction that realizes BB-code logical structure using local weight-4 gauge measurements. Their stabilizer syndromes are inferred by multiplying the corresponding gauge outcomes. We further show that nonlocal stabilizers in translation-invariant CSS subsystem codes can be detected using a determinantal-ideal criterion based on the gauge-operator commutation matrix. When this criterion excludes nonlocal stabilizers, a finite-depth Clifford circuit decouples gauge qubits and identifies the protected subsystem with a corresponding BB stabilizer code. An SBB code is topological, meaning that it has no nontrivial local logical operators, if and only if the corresponding BB code is topological. A finite search yields low-overhead examples including [[27,6,3]], [[75,10,5]], and [[108,12,6]]; the latter encodes six times more logical qubits than a subsystem surface code at the same block length and distance. These results show how gauge degrees of freedom can make high-rate BB logical structure compatible with local weight-4 syndrome extraction.