We study two-dimensional translation-invariant CSS stabilizer codes over prime-dimensional qudits on the square lattice under twisted boundary conditions, generalizing the Kitaev $\mathbb{Z}_p$ toric code by augmenting each stabilizer with two additional qudits. Using the Laurent-polynomial formalism, we adapt the Gröbner basis to compute the logical dimension $k$ efficiently, without explicitly constructing large parity-check matrices. We then perform a systematic search over various stabilizer realizations and lattice geometries for $p\in\{3,5,7,11\}$, identifying qudit low-density parity-check codes with the optimal finite-size performance. Representative examples include $[[242,10,22]]_3$ and $[[120,6,20]]_{11}$, both achieving $k d^{2}/n=20$. Across the searched regime, the best observed $k d^{2}$ at fixed $n$ increases with $p$, with an empirical relation $k d^{2} = 0.0541 \, n^{2}\ln p + 3.84 \, n$, compatible with a Bravyi--Poulin--Terhal-type tradeoff when the interaction range grows with system size.
Generalized Zp toric codes as qudit low-density parity-check codes
We study two-dimensional translation-invariant CSS stabilizer codes over prime-dimensional qudits on the square lattice under twisted boundary conditions, generalizing the Kitaev Zp toric code by augmenting each stabilizer with two additional qudits. Using the Laurent-polynomial formalism, we adapt the Gröbner basis to compute the logical dimension k efficiently, without explicitly constructing large parity-check matrices. We then perform a systematic search over various stabilizer realizations and lattice geometries for p∈{3,5,7,11}, identifying qudit low-density parity-check codes with the optimal finite-size performance. Representative examples include [[242,10,22]]3 and [[120,6,20]]11, both achieving kd2/n=20. Across the searched regime, the best observed kd2 at fixed n increases with p, with an empirical relation kd2=0.0541n2lnp+3.84n, compatible with a Bravyi--Poulin--Terhal-type tradeoff when the interaction range grows with system size.
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.
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.
The protection of quantum information in systems leveraging more than two basis states (qudits) is an ongoing challenge. A tool for transforming the plethora of qubit stabilizer codes into qudit stabilizer codes is the local-dimension-invariant (LDI) extension to the stabilizer formalism. A drawback of the LDI method is that generally in order to ensure the distance of the resultant code is at least preserved the newly selected local-dimension will need to be any prime bigger than a large cutoff value. In this work we consider the repercussions of this large cutoff value, then by focusing on quantum low-density parity-check (qLDPC) codes we are able to bring down this cutoff value. Notably, we are able to reduce it in some cases to the initial local-dimension and for arbitrary CSS qubit-derived codes to singly exponential in d with no dependence on the number of logicals k. This reduces the size of the caveat in LDI forms in their distance preservation condition.
Recent work has shown that quantum double models can be used to circumvent the Bravyi-Koenig bound. In particular, this is achieved through code-switching protocols in which non-Pauli stabilizer phases appear as intermediate codes. We introduce the XCd(k) stabilizer formalism, which generalizes the Pauli stabilizer formalism by combining Pauli-X operators with diagonal operators drawn from a fixed level k of the Clifford hierarchy on prime-dimensional qudits. This yields a natural class of beyond-Pauli stabilizer models, including many twisted quantum double phases. We classify a large class of these XCd(k) stabilizer states, showing that they are uniform superpositions over affine-linear subspaces with diagonal phases. In particular, when the stabilizers of a state require operators from level k of the Clifford hierarchy, we show that the diagonal gates required to produce the phases in the wavefunction sit one level higher. We further show that every 2D twisted quantum double Dω(Zpn) with ω a product of type-III cocycles and p an odd prime admits a realization using only Clifford (k=2) stabilizers, and we conjecture that phases where ω contains a type-I or type-II cocycle require level-p Clifford-hierarchy stabilizers for p-dimensional qudits. Finally, we demonstrate that a pair of qudit toric codes may be deterministically prepared in a logical magic state by measuring XCd(k) stabilizers. Together, these results provide a concrete stabilizer framework for topological codes beyond Pauli stabilizer models and their logical gates.
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.
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 XYZ2 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.