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:2610.02392 · IEEE Open Journal of the Communications Society

Singer-Difference-Set Qudit Stabilizer Codes from Non-Degenerate Quadrics in PG(d,q)PG(d,q): Construction, Structural Theorems, and Monte-Carlo Performance

Michel Kulhandjian, Lajos Hanzo

quant-phcs.ITSubmitted Oct 1, 2026• Announced Oct 5, 2026• 0 citations
arXivHTMLPDF

Abstract

We propose Q(q,d), a family of q-ary non-CSS qudit stabilizer codes with prime power q and dimension d >= 2, constructed from Singer difference sets and non-degenerate quadrics in PG(d,q). The parity check H = (A | M_Q A) couples the Singer-circulant incidence matrix A with the quadric circulant M_Q, and a Cancellation Lemma uses the identity (k - lambda) = q^{d-1} = 0 mod p to make H symplectic-isotropic over F_q. Five structural theorems carry the novelty: a cross-correlation modular-constancy identity nu = 1 mod q at q odd, d >= 3, with a two-value pattern that proves a 2-torsion distance ceiling; a CRT zero-count identity; an explicit Clifford bridge identifying Q(q,2) as a graph-state encoding of the trivial Singer CSS code, with the 2021 low-density-spreading (LDS) sign-flip pattern realised by a symmetric circulant; a paired column-rigidity equality d_min = R_P + 1; and a lower bound d_min(Q(7,2)) >= 8 from an exhaustive Singer-Frobenius search. A Hamada-Smith specialisation yields the closed-form logical dimension k(p,d) = theta_d(p) - C(p+d-1, d) - 1, and the flagship Q(p,2) = [[p^2 + p + 1, p(p+1)/2, d_min]]_p attains asymptotic rate one-half. We conjecture d_min(Q(p,2)) = p + 1 for odd primes, proven at p = 5 and lower-bounded to >= 8 at p = 7. Instances include Q(3,2) = [[13,6,3]]_3, Q(5,2) = [[31,15,6]]_5, Q(7,2) = [[57,28, d>=8]]_7, and Q(3,4) = [[121,105,3]]_3. Monte-Carlo over 1.5 x 10^6 trials shows Q(5,2) achieves a 70-fold per-logical-qudit improvement over Steane [[7,1,3]]_2 at depolarising rate 10^-3 with zero silent logical errors. A textbook bounded-distance decoder is used; Berlekamp-Massey-style cyclic decoding is left as the natural sequel.

AI Summary

The paper studies whether Singer difference sets and trace-defined quadrics in projective geometry can generate structured qudit stabilizer codes. It constructs $\mathcal Q(q,d)$ with check matrix $H=(A\mid M_QA)$, where $A$ is the Singer-circulant point–hyperplane incidence matrix and $M_Q$ is a circulant quadric indicator. Symplectic isotropy follows from the difference-set identity and $q^{d-1}=0$ in characteristic $p$. For prime $q=p$, a Hamada–Smith rank formula gives $k=\theta_d(p)-\binom{p+d-1}{d}-1$; the $d=2$ family has length $p^2+p+1$ and rate approaching $1/2$. Reported instances include $[[13,6,3]]_3$, $[[31,15,6]]_5$, and $[[57,28,d\ge8]]_7$. Distances are investigated through support-restricted centralizer kernels, with exhaustive cyclic/Frobenius symmetry-reduced searches. Further results concern modular cross-correlations, a claimed weight-two logical obstruction for odd $q$ and odd $d\ge3$, CRT zero patterns, and an explicit symmetric-circulant Clifford encoding at $d=2$. Bounded-distance decoding simulations report agreement with binomial failure bounds and no observed silent logical errors for $\mathcal Q(5,2)$. The advertised $70$-fold comparison with Steane at depolarising probability $10^{-3}$ uses block-failure bounds divided by logical dimension, across different qudit dimensions. The general flagship distance remains conjectural, the $p=7$ result lacks a matching upper bound, and efficient structure-specific decoding is deferred. The manuscript also contains incompatible statements about CSS status and some distance bounds; its universal paired-rigidity equality does not account for low-weight stabilizers in degenerate codes.

Almost certainly largely AI-generatedOverclaimsMissing comparisonUnclear writingPossible error

Central claim may not hold: The claimed universal equality d_min=R_P+1 incorrectly counts low-weight stabilizers as logical operators and is false for degenerate stabilizer codes such as the Shor code. The modular-constancy proof substitutes correlation for the construction's convolution, whose values recomputed from the supplied (3,3) trace table already contradict the claimed constant residue, while the two-value corollary also conflicts with the paper's (3,5) data. The paper asserts both a universal distance bound yielding [[40,29,≥4]]_3 and the incompatible distance-2 result for that same instance, and its appendix supplies trace indicators inconsistent with its own construction recipe. The advertised 70-fold per-logical-qudit improvement uses analytical block-failure estimates divided by k, a quantity that is not generally a single-logical-qudit error probability and is not resolved by the reported low-rate Monte-Carlo data. The claimed structural absence of silent logical errors is false because nontrivial logical Pauli errors have zero syndrome and positive probability under the specified depolarising channel.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
Accepted for publication in IEEE Open Journal of the Communications Society

Related papers

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

Active Stabilizers In Reed–Muller CSS Codes From Cayley–Dickson Zero-Divisors

Giovanni Levratti

We establish three results connecting the zero-divisor structure of the Cayley–Dickson algebras Aₙ to the stabilizer formalism of quantum error-correcting codes. Step 1 (Bijection, n=4). The 7 lo-flats of ZD(4) — weight-4 subsets {a,b,c,d} ⊂ {1,...,7} with a⊕b⊕c⊕d=0 — are in explicit bijection with the 7 non-identity elements of the X-stabilizer group of the Steane [[7,1,3]] code. All 7 lo-flats carry identical sign-parity pattern: π(EE|FF)=−1 (inactive), π(EF₁)=π(EF₂)=+1 (active). Step 2 (Operator translation). For every mixed flat F={i,j,8+k,8+l} in A₄, the algebraic identity π_A·π_B·π_C=−1 translates into the Clifford-group identity (Z_αZ_β)(X_αX_γ)(X_βX_γ) = −Y_αY_β. The global phase −1 is the precise Clifford avatar of π_Aπ_Bπ_C=−1. The operator −Y_αY_β is a detectable error with full-group syndrome weight 2^(n−2), proved for all n≥4 and verified on QPU. Step 3 (Extension to n=5, verified on QPU). The 15 Fano planes of PG(3,F₂) are in explicit bijection with the 15 non-identity elements of the X-stabilizer group S_X ≅ (Z/2Z)⁴ of the [[15,7,3]] code (4 generators, 2⁴−1=15 non-identity elements). The phase identity and syndrome formula extend to all n≥4 (Universal Phase Lemma). Syndrome structure verified on ibm_kingston (156-qubit QPU, job d8bm67ijki0s73aq6idg, 27 May 2026). The Type-A/Type-B criterion for Fano planes in PG(3,F₂) is resolved: a plane W is Type-B if and only if 8∈W or W={1,...,7}, where 8=(1,0,0,0)∈F₂⁴ is the bridge element between A₃ and A₄ in the Cayley–Dickson tower. All algebraic results are cited from the companion papers (doi:10.5281/zenodo.20315751, doi:10.5281/zenodo.20417859).Every claim is labelled [VERIFIED], [THEOREM], or [OPEN] throughout.

•May 28, 2026•0 citations

Moderate-length lifted quantum Tanner codes

Virgile Guémard, Gilles Zémor

We introduce new families of quantum Tanner codes, a class of quantum codes that first appeared in the work of Leverrier and Zémor (FOCS 2022). These codes are built from two classical Tanner codes, for which the underlying graphs are extracted from coverings of 2D geometrical complexes, and the local linear codes are tensor-products of cyclic or double-circulant linear codes. The advantage of code lifting is that, for any lift of odd index $t$ of an $[[n,k,d]]$-code, we can adapt the study of the transfer homomorphism arising in cellular homology to describe symmetries of its logical operators and to establish that its dimension is lower bounded by $k$, and its distance is upper bounded by $t\cdot d$. Moreover, when the dimension of the lifted code is equal to $k$, its distance is lower bounded by $d$. These parameter bounds also apply to the previous methods of code lifting of Guémard (IEEE Trans. Inf. Theory, 2025). Finally, We present several explicit families, and identify instances of moderate length quantum codes which are degenerate, have low check weight, and whose distance surpasses the square root of the code length. Among them, we report the existence of a $[[96,2,12]]$-code whose distance growth saturates our bound, and for which half of the checks are of weight 8 and the other half of weight 4.

arXiv:2502.20297•Feb 27, 2025•10 citations

Generalized $\mathbb{Z}_p$ toric codes as qudit low-density parity-check codes

Zijian Liang, Yu-An Chen

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.

quant-pharXiv:2602.20158•Feb 24, 2026•3 citations

Quasi-Cyclic Qudit Lifted Product Codes with Almost Linear Minimum Distance

Shantom Kumar Borah, Abhinav Vaishya, V. Lalitha +3 more

Quantum low-density parity-check (QLDPC) codes are a promising route to fault-tolerant quantum computation with low overhead, and qudits offer advantages over qubits including more efficient information representation, improved magic state distillation, and richer algebraic structure for code design. Asymptotically good QLDPC codes arise from the lifted product (LP) construction with non-abelian lifts, but cyclic lifts remain attractive in practice because the resulting quasi-cyclic codes have circulant structure that hardware decoders exploit, which matters especially for non-binary decoders with costly check node operations. We introduce a qudit generalization of the LP construction over cyclic group algebras, which extends hypergraph product and LP codes to arbitrary prime-power dimensions and yields quasi-cyclic qudit CSS codes for every stacking order. We bound encoding rates via a connection to additive codes, and show that in the fully stacked case, qudit LP codes built from lifted Tanner codes on expander graphs form families with $Θ(\log N)$ logical qudits and almost linear minimum distance $Θ(N/\log N)$, via a distance bound that holds for a general class of LP factors. We also study an additive decoder for general qudit codes and a linear merged-syndrome decoder for fully stacked codes. Monte Carlo simulations under a depolarizing channel with equal symbol error probability show that qudit codes achieve lower frame error rates than comparable qubit codes, and that the linear decoder gives further gains for fully stacked codes.

arXiv:2611.15952•Nov 11, 2026•0 citations

Quantum Tanner Codes at Moderate Blocklength

Feroz Ahmed Mian, Vaishnavi L. Addala, Arman Meraj +2 more

We present explicit constructions of quantum Tanner (QT) codes with good rate and distance, obtained through two complementary approaches: the left-right Cayley complex (LRCC) description and the "lifting" perspective, in which a seed Calderbank-Shor-Steane (CSS) code is lifted by commuting left-right regular actions of a finite group $\mathcal{G}$. Through an extensive search over non-abelian groups from GAP's SmallGrp library, we investigate the moderate-blocklength regime ($n \in [500,1000]$) and identify several new code instances with distance upper bounds exceeding $20$. These include $[[480,8,(\leq 21,\leq 21)]]$, $[[504,4,(\leq 36,\leq 27)]]$, $[[672,4,(\leq 48,\leq 28)]]$, $[[720,6,(\leq 30,\leq 30)]]$, and $[[864,8,(\leq 39,\leq 31)]]$, with these bounds obtained using up to $350$ million trials of sQetch, a randomized distance estimator. The code instances presented have check weights ranging from $9$ to $20$. Using the Tesseract decoder, we estimate pseudo-thresholds of $3.6\%$-$4.6\%$ under phenomenological noise and $0.14\%$-$0.27\%$ under circuit-level noise, comparable to prior results at shorter code lengths. We also provide QuantumExpanders$.$jl, an open-source Julia library for constructing QT codes and explicit constructions of Ramanujan graphs.

quant-pharXiv:2608.12509•Aug 14, 2026•0 citations
We propose Q(q,d), a family of q-ary non-CSS qudit stabilizer codes with prime power q and dimension d >= 2, constructed from Singer difference sets and non-degenerate quadrics in PG(d,q). The parity check H = (A | M_Q A) couples the Singer-circulant incidence matrix A with the quadric circulant M_Q, and a Cancellation Lemma uses the identity (k - lambda) = q^{d-1} = 0 mod p to make H symplectic-isotropic over F_q.
Five structural theorems carry the novelty: a cross-correlation modular-constancy identity nu = 1 mod q at q odd, d >= 3, with a two-value pattern that proves a 2-torsion distance ceiling; a CRT zero-count identity; an explicit Clifford bridge identifying Q(q,2) as a graph-state encoding of the trivial Singer CSS code, with the 2021 low-density-spreading (LDS) sign-flip pattern realised by a symmetric circulant; a paired column-rigidity equality d_min = R_P + 1; and a lower bound d_min(Q(7,2)) >= 8 from an exhaustive Singer-Frobenius search.
A Hamada-Smith specialisation yields the closed-form logical dimension k(p,d) = theta_d(p) - C(p+d-1, d) - 1, and the flagship Q(p,2) = [[p^2 + p + 1, p(p+1)/2, d_min]]_p attains asymptotic rate one-half. We conjecture d_min(Q(p,2)) = p + 1 for odd primes, proven at p = 5 and lower-bounded to >= 8 at p = 7. Instances include Q(3,2) = [[13,6,3]]_3, Q(5,2) = [[31,15,6]]_5, Q(7,2) = [[57,28, d>=8]]_7, and Q(3,4) = [[121,105,3]]_3. Monte-Carlo over 1.5 x 10^6 trials shows Q(5,2) achieves a 70-fold per-logical-qudit improvement over Steane [[7,1,3]]_2 at depolarising rate 10^-3 with zero silent logical errors. A textbook bounded-distance decoder is used; Berlekamp-Massey-style cyclic decoding is left as the natural sequel.
The paper studies whether Singer difference sets and trace-defined quadrics in projective geometry can generate structured qudit stabilizer codes. It constructs Q(q,d)\mathcal Q(q,d)Q(q,d) with check matrix H=(A∣MQA)H=(A\mid M_QA)H=(A∣MQ​A), where AAA is the Singer-circulant point–hyperplane incidence matrix and MQM_QMQ​ is a circulant quadric indicator. Symplectic isotropy follows from the difference-set identity and qd−1=0q^{d-1}=0qd−1=0 in characteristic ppp. For prime q=pq=pq=p, a Hamada–Smith rank formula gives k=θd(p)−(p+d−1d)−1k=\theta_d(p)-\binom{p+d-1}{d}-1k=θd​(p)−(dp+d−1​)−1; the d=2d=2d=2 family has length p2+p+1p^2+p+1p2+p+1 and rate approaching 1/21/21/2.
Reported instances include [[13,6,3]]3[[13,6,3]]_3[[13,6,3]]3​, [[31,15,6]]5[[31,15,6]]_5[[31,15,6]]5​, and [[57,28,d≥8]]7[[57,28,d\ge8]]_7[[57,28,d≥8]]7​. Distances are investigated through support-restricted centralizer kernels, with exhaustive cyclic/Frobenius symmetry-reduced searches. Further results concern modular cross-correlations, a claimed weight-two logical obstruction for odd qqq and odd d≥3d\ge3d≥3, CRT zero patterns, and an explicit symmetric-circulant Clifford encoding at d=2d=2d=2.
Bounded-distance decoding simulations report agreement with binomial failure bounds and no observed silent logical errors for Q(5,2)\mathcal Q(5,2)Q(5,2). The advertised 707070-fold comparison with Steane at depolarising probability 10−310^{-3}10−3 uses block-failure bounds divided by logical dimension, across different qudit dimensions.
The general flagship distance remains conjectural, the p=7p=7p=7 result lacks a matching upper bound, and efficient structure-specific decoding is deferred. The manuscript also contains incompatible statements about CSS status and some distance bounds; its universal paired-rigidity equality does not account for low-weight stabilizers in degenerate codes.
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 establish three results connecting the zero-divisor structure of the Cayley–Dickson algebras Aₙ to the stabilizer formalism of quantum error-correcting codes. Step 1 (Bijection, n=4). The 7 lo-flats of ZD(4) — weight-4 subsets {a,b,c,d} ⊂ {1,...,7} with a⊕b⊕c⊕d=0 — are in explicit bijection with the 7 non-identity elements of the X-stabilizer group of the Steane [[7,1,3]] code. All 7 lo-flats carry identical sign-parity pattern: π(EE|FF)=−1 (inactive), π(EF₁)=π(EF₂)=+1 (active). Step 2 (Operator translation). For every mixed flat F={i,j,8+k,8+l} in A₄, the algebraic identity π_A·π_B·π_C=−1 translates into the Clifford-group identity (Z_αZ_β)(X_αX_γ)(X_βX_γ) = −Y_αY_β. The global phase −1 is the precise Clifford avatar of π_Aπ_Bπ_C=−1. The operator −Y_αY_β is a detectable error with full-group syndrome weight 2^(n−2), proved for all n≥4 and verified on QPU. Step 3 (Extension to n=5, verified on QPU). The 15 Fano planes of PG(3,F₂) are in explicit bijection with the 15 non-identity elements of the X-stabilizer group S_X ≅ (Z/2Z)⁴ of the [[15,7,3]] code (4 generators, 2⁴−1=15 non-identity elements). The phase identity and syndrome formula extend to all n≥4 (Universal Phase Lemma). Syndrome structure verified on ibm_kingston (156-qubit QPU, job d8bm67ijki0s73aq6idg, 27 May 2026). The Type-A/Type-B criterion for Fano planes in PG(3,F₂) is resolved: a plane W is Type-B if and only if 8∈W or W={1,...,7}, where 8=(1,0,0,0)∈F₂⁴ is the bridge element between A₃ and A₄ in the Cayley–Dickson tower. All algebraic results are cited from the companion papers (doi:10.5281/zenodo.20315751, doi:10.5281/zenodo.20417859).Every claim is labelled [VERIFIED], [THEOREM], or [OPEN] throughout.
We introduce new families of quantum Tanner codes, a class of quantum codes that first appeared in the work of Leverrier and Zémor (FOCS 2022). These codes are built from two classical Tanner codes, for which the underlying graphs are extracted from coverings of 2D geometrical complexes, and the local linear codes are tensor-products of cyclic or double-circulant linear codes. The advantage of code lifting is that, for any lift of odd index ttt of an [[n,k,d]][[n,k,d]][[n,k,d]]-code, we can adapt the study of the transfer homomorphism arising in cellular homology to describe symmetries of its logical operators and to establish that its dimension is lower bounded by kkk, and its distance is upper bounded by t⋅dt\cdot dt⋅d. Moreover, when the dimension of the lifted code is equal to kkk, its distance is lower bounded by ddd. These parameter bounds also apply to the previous methods of code lifting of Guémard (IEEE Trans. Inf. Theory, 2025). Finally, We present several explicit families, and identify instances of moderate length quantum codes which are degenerate, have low check weight, and whose distance surpasses the square root of the code length. Among them, we report the existence of a [[96,2,12]][[96,2,12]][[96,2,12]]-code whose distance growth saturates our bound, and for which half of the checks are of weight 8 and the other half of weight 4.
Generalized Zp\mathbb{Z}_pZp​ 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\mathbb{Z}_pZp​ 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 kkk 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}p\in\{3,5,7,11\}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[[242,10,22]]_3[[242,10,22]]3​ and [[120,6,20]]11[[120,6,20]]_{11}[[120,6,20]]11​, both achieving kd2/n=20k d^{2}/n=20kd2/n=20. Across the searched regime, the best observed kd2k d^{2}kd2 at fixed nnn increases with ppp, with an empirical relation kd2=0.0541 n2ln⁡p+3.84 nk d^{2} = 0.0541 \, n^{2}\ln p + 3.84 \, nkd2=0.0541n2lnp+3.84n, compatible with a Bravyi--Poulin--Terhal-type tradeoff when the interaction range grows with system size.
Quantum low-density parity-check (QLDPC) codes are a promising route to fault-tolerant quantum computation with low overhead, and qudits offer advantages over qubits including more efficient information representation, improved magic state distillation, and richer algebraic structure for code design. Asymptotically good QLDPC codes arise from the lifted product (LP) construction with non-abelian lifts, but cyclic lifts remain attractive in practice because the resulting quasi-cyclic codes have circulant structure that hardware decoders exploit, which matters especially for non-binary decoders with costly check node operations. We introduce a qudit generalization of the LP construction over cyclic group algebras, which extends hypergraph product and LP codes to arbitrary prime-power dimensions and yields quasi-cyclic qudit CSS codes for every stacking order. We bound encoding rates via a connection to additive codes, and show that in the fully stacked case, qudit LP codes built from lifted Tanner codes on expander graphs form families with Θ(log⁡N)Θ(\log N)Θ(logN) logical qudits and almost linear minimum distance Θ(N/log⁡N)Θ(N/\log N)Θ(N/logN), via a distance bound that holds for a general class of LP factors. We also study an additive decoder for general qudit codes and a linear merged-syndrome decoder for fully stacked codes. Monte Carlo simulations under a depolarizing channel with equal symbol error probability show that qudit codes achieve lower frame error rates than comparable qubit codes, and that the linear decoder gives further gains for fully stacked codes.
We present explicit constructions of quantum Tanner (QT) codes with good rate and distance, obtained through two complementary approaches: the left-right Cayley complex (LRCC) description and the "lifting" perspective, in which a seed Calderbank-Shor-Steane (CSS) code is lifted by commuting left-right regular actions of a finite group G\mathcal{G}G. Through an extensive search over non-abelian groups from GAP's SmallGrp library, we investigate the moderate-blocklength regime (n∈[500,1000]n \in [500,1000]n∈[500,1000]) and identify several new code instances with distance upper bounds exceeding 202020. These include [[480,8,(≤21,≤21)]][[480,8,(\leq 21,\leq 21)]][[480,8,(≤21,≤21)]], [[504,4,(≤36,≤27)]][[504,4,(\leq 36,\leq 27)]][[504,4,(≤36,≤27)]], [[672,4,(≤48,≤28)]][[672,4,(\leq 48,\leq 28)]][[672,4,(≤48,≤28)]], [[720,6,(≤30,≤30)]][[720,6,(\leq 30,\leq 30)]][[720,6,(≤30,≤30)]], and [[864,8,(≤39,≤31)]][[864,8,(\leq 39,\leq 31)]][[864,8,(≤39,≤31)]], with these bounds obtained using up to 350350350 million trials of sQetch, a randomized distance estimator. The code instances presented have check weights ranging from 999 to 202020. Using the Tesseract decoder, we estimate pseudo-thresholds of 3.6%3.6\%3.6%-4.6%4.6\%4.6% under phenomenological noise and 0.14%0.14\%0.14%-0.27%0.27\%0.27% under circuit-level noise, comparable to prior results at shorter code lengths. We also provide QuantumExpanders...jl, an open-source Julia library for constructing QT codes and explicit constructions of Ramanujan graphs.