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

The Optimal Distance of Fourteen-Qubit Stabilizer Codes Encoding Three Qubits

Mansehej Singh

Published Aug 10, 2026• 0 citations
Publisher

Abstract

We prove, with computer assistance, that the optimal minimum distance of abinary stabilizer code on $14$ qubits encoding $3$ logical qubits is $4$.Equivalently, no binary quantum stabilizer code with parameters$\code{14,3,5}$ exists, including degenerate codes. In the binary symplecticmodel, this is equivalent to the nonexistence of an $11$-dimensional isotropicsubspace $C\subseteq\F_2^{28}$ satisfying$\min\{\wt(v):v\in C^{\perps}\setminus C\}\ge 5$.The argument separates the two cases determined by the parity of thestabilizer weights. MacWilliams identities and integrality eliminate theall-even case. In the odd case, the shadow enumerator of Rains is combined withtwo averages over the $135$ self-dual extensions of the code: one for theirweight enumerators and one for their shadows. An incidence computation inan eight-dimensional orthogonal geometry of plus type then forces threelow-weight stabilizer profiles. Integrality and a collision count amongweight-three shadow words eliminate these profiles. All parameter-specificcalculations are finite and exact, and reproducible source code accompanies the paper.The nonexistence theorem is additionally formalized and machine-checked inLean~4 over mathlib, with an axiom audit reporting only standard foundationalprinciples.

DOI
10.5281/zenodo.21874337

Related papers

No binary [[14,3,d≥5]] quantum stabilizer code exists

Brandon Li

We prove that no binary qubit stabilizer code with parameters [[14,3,d>=5]] exists, settling the remaining distance gap for stabilizer codes encoding three qubits into fourteen. The proof first applies a signed affine-shadow inequality and an integrality congruence to restrict low-weight stabilizer words. Exact split-shadow infeasibility certificates then exclude weight-two words and all configurations with three weight-four checks, leaving a unique weight-four check. That check yields a ten-coordinate binary-additive code of size 1,024, minimum distance at least five, and symplectic hull dimension four. We reconstruct all 37 relevant equivalence classes by exhaustive lengthening: 25 have the wrong hull dimension, and the other twelve violate a necessary 64-coset capacity bound. Together with the known [[14,3,4]] construction, this proves d_max(14,3)=4 for binary stabilizer codes.

•Sep 22, 2026•0 citations

Theory of low-weight quantum codes

Fuchuan Wei, Zhengyi Han, Austin Yubo He +2 more

Low check weight is a crucial code property for fault-tolerant quantum computing, which underlies the strong interest in quantum low-density parity-check (qLDPC) codes. Here, we initiate the theory of weight-constrained stabilizer codes from various foundational perspectives including the complexity of computing code weight and the explicit boundary of feasible low-weight codes in both theoretical and practical settings. We first prove that computing the optimal generator weight of a stabilizer code is $\mathsf{NP}$-hard, motivating efficiently computable bounds. We derive analytical lower bounds on check weight in terms of code rate and distance, identifying the minimum weights needed for single-qubit error detection and correction, as well as the sharp distance and rate limits of weight-three error-detecting codes. Matching constructions show that these bounds are tight in several regimes. To establish refined finite-size constraints, we develop a linear programming framework based on quantum weight enumerators subject to generator-weight constraints, yielding exact optimal weights for all parameter combinations with $n\le9$. Finally, we show that the same framework can incorporate architecture-dependent constraints, using the 127-qubit IBM Eagle chip as a concrete example. Our study brings the weight as a crucial parameter into coding theory and provides guidance for code design and utility in practical scenarios.

quant-pharXiv:2601.19848•Jan 28, 2026•3 citations

Random encoders and expurgation improve 1,873 entries of the Grassl qubit code tables

Marin Girard

I report 192 explicit binary stabilizer codes $[[n,k,d]]$ with $53\le n\le 254$ and $5\le d\le 13$ whose minimum distance exceeds the lower bound listed in Grassl's code tables at the same $(n,k)$: 161 codes by one and 31 by two. Through the standard propagation rules they raise 1,873 entries of the table. For 190 of the codes, a random Clifford encoder is followed by expurgation: every logical operator of weight below the target distance is enumerated, and a few logical operators are promoted to stabilizers so that each low-weight one anticommutes with at least one of them. The other two are obtained by puncturing a code from the table and repairing it in the same way. All 192 distances are exact: the lower bound is certified by exhaustive meet-in-the-middle enumeration of up to $4\times10^{13}$ Pauli operators, and the upper bound by an explicit logical operator of weight $d$. A first-moment count explains the results. Expurgated random codes have about eight more logical qubits than a typical random code of the same length and distance, so they beat the table wherever its best known codes are no better than random. The largest gains, up to nine logical qubits, are at $d\ge9$ and $n\gtrsim170$, where the table often gives a lower bound without an explicit code. The same count predicts improvements at 619 further pairs $(n,d)$. The search was run by AI agents. The codes, their certificates and an independent checker are public.

arXiv:2611.08744•Nov 5, 2026•0 citations

Minimal Counterexamples of the MacWilliams Extension Theorem for Stabilizer Codes

Ali Assem Mahmoud

The MacWilliams extension theorem fails for module alphabets with non-cyclic socle, and the label alphabet of qudit stabilizer codes, $\F_{q^2}$ over $\F_q$, is such an alphabet. Quantum error correction, however, only ever sees \emph{self-orthogonal} additive codes, and whether that rigidity rescues the theorem---equivalently, whether every weight-preserving isomorphism of stabilizer groups is implemented by local Cliffords and a qudit permutation---was asked by Gluesing-Luerssen and Pllaha and answered negatively by Pllaha for particular qubit codes. We develop the negative answer systematically and at the smallest possible scales. For every prime power $q$ we construct a pair of $[[q+1,q-1]]_q$ stabilizer codes and a weight-preserving isomorphism between them extending to no monomial transformation; the codespaces are inequivalent even under arbitrary local unitaries combined with permutations, though they share Shor--Laflamme enumerators. Self-orthogonality is automatic here, by two elementary lemmas which also show that Dyshko's threshold-length counterexamples were already self-orthogonal, unremarked. For qubits we prove by exhaustive search that length $3$ is minimal and the counterexample essentially unique. Dropping the ``idle qudit'' invariant that detects these, we find the minimal full-support lengths: $4$ for a non-extendable isometry, $5$ for a weight-isometric pair that is not monomially equivalent, realized by explicit $[[5,2]]$ codes; at length $6$ all nontrivial stabilizer elements can have weight $\ge 4$. Whether these codespaces are locally unitarily equivalent is posed as an open problem, connecting the extension problem to the LU--LC circle of questions.

quant-pharXiv:2607.26214•Jul 30, 2026•0 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

An explicit pure ((7,2,4))_4 quantum code and its maximality among distance-four codes containing one codeword

Connor McGinley

We give an explicit pure ((7,2,4))_4 quantum code (equivalently an additive [[7,1/2,4]]_4 stabilizer code): a binary graph state on 14 physical qubits grouped into seven ququarts, with one reference qubit. Exact binary cut-rank computations show that every error supported on at most three ququarts is detected; an explicit weight-four Pauli operator shows the distance is exactly four. Every code of distance at least four that contains the first codeword has dimension at most two, and hence equals the displayed code. Conditional on the published exclusion of stabilizer [[7,1,4]]_4 codes (Ball–Moreno–Simoens, arXiv:2401.06618), dimension two is the largest additive dimension at these parameters. Nothing is claimed about codes not containing the displayed codeword, other than the additive case. Status: not peer reviewed. The author has reviewed the mathematics personally; no independent review by another party has been carried out. Initial searches of the literature did not turn up this code (standard tables list integer k, so a K=2 code would not appear in them); more extensive checks are being carried out. Priority and novelty are pending verification and are not claimed. Files: note (PDF and TeX), graph file, verification script (python3 pure_7_2_4_4_code_verify.py pure_7_2_4_4_code_graph.json), README.

•Nov 2, 2026•0 citations
We prove, with computer assistance, that the optimal minimum distance of abinary stabilizer code on 141414 qubits encoding 333 logical qubits is 444.Equivalently, no binary quantum stabilizer code with parameters\code14,3,5\code{14,3,5}\code14,3,5 exists, including degenerate codes. In the binary symplecticmodel, this is equivalent to the nonexistence of an 111111-dimensional isotropicsubspace C⊆\F228C\subseteq\F_2^{28}C⊆\F228​ satisfyingmin⁡{\wt(v):v∈C\perps∖C}≥5\min\{\wt(v):v\in C^{\perps}\setminus C\}\ge 5min{\wt(v):v∈C\perps∖C}≥5.The argument separates the two cases determined by the parity of thestabilizer weights. MacWilliams identities and integrality eliminate theall-even case. In the odd case, the shadow enumerator of Rains is combined withtwo averages over the 135135135 self-dual extensions of the code: one for theirweight enumerators and one for their shadows. An incidence computation inan eight-dimensional orthogonal geometry of plus type then forces threelow-weight stabilizer profiles. Integrality and a collision count amongweight-three shadow words eliminate these profiles. All parameter-specificcalculations are finite and exact, and reproducible source code accompanies the paper.The nonexistence theorem is additionally formalized and machine-checked inLean~4 over mathlib, with an axiom audit reporting only standard foundationalprinciples.
We prove that no binary qubit stabilizer code with parameters [[14,3,d>=5]] exists, settling the remaining distance gap for stabilizer codes encoding three qubits into fourteen. The proof first applies a signed affine-shadow inequality and an integrality congruence to restrict low-weight stabilizer words. Exact split-shadow infeasibility certificates then exclude weight-two words and all configurations with three weight-four checks, leaving a unique weight-four check. That check yields a ten-coordinate binary-additive code of size 1,024, minimum distance at least five, and symplectic hull dimension four. We reconstruct all 37 relevant equivalence classes by exhaustive lengthening: 25 have the wrong hull dimension, and the other twelve violate a necessary 64-coset capacity bound. Together with the known [[14,3,4]] construction, this proves d_max(14,3)=4 for binary stabilizer codes.
Low check weight is a crucial code property for fault-tolerant quantum computing, which underlies the strong interest in quantum low-density parity-check (qLDPC) codes. Here, we initiate the theory of weight-constrained stabilizer codes from various foundational perspectives including the complexity of computing code weight and the explicit boundary of feasible low-weight codes in both theoretical and practical settings. We first prove that computing the optimal generator weight of a stabilizer code is NP\mathsf{NP}NP-hard, motivating efficiently computable bounds. We derive analytical lower bounds on check weight in terms of code rate and distance, identifying the minimum weights needed for single-qubit error detection and correction, as well as the sharp distance and rate limits of weight-three error-detecting codes. Matching constructions show that these bounds are tight in several regimes. To establish refined finite-size constraints, we develop a linear programming framework based on quantum weight enumerators subject to generator-weight constraints, yielding exact optimal weights for all parameter combinations with n≤9n\le9n≤9. Finally, we show that the same framework can incorporate architecture-dependent constraints, using the 127-qubit IBM Eagle chip as a concrete example. Our study brings the weight as a crucial parameter into coding theory and provides guidance for code design and utility in practical scenarios.
I report 192 explicit binary stabilizer codes [[n,k,d]][[n,k,d]][[n,k,d]] with 53≤n≤25453\le n\le 25453≤n≤254 and 5≤d≤135\le d\le 135≤d≤13 whose minimum distance exceeds the lower bound listed in Grassl's code tables at the same (n,k)(n,k)(n,k): 161 codes by one and 31 by two. Through the standard propagation rules they raise 1,873 entries of the table. For 190 of the codes, a random Clifford encoder is followed by expurgation: every logical operator of weight below the target distance is enumerated, and a few logical operators are promoted to stabilizers so that each low-weight one anticommutes with at least one of them. The other two are obtained by puncturing a code from the table and repairing it in the same way. All 192 distances are exact: the lower bound is certified by exhaustive meet-in-the-middle enumeration of up to 4×10134\times10^{13}4×1013 Pauli operators, and the upper bound by an explicit logical operator of weight ddd. A first-moment count explains the results. Expurgated random codes have about eight more logical qubits than a typical random code of the same length and distance, so they beat the table wherever its best known codes are no better than random. The largest gains, up to nine logical qubits, are at d≥9d\ge9d≥9 and n≳170n\gtrsim170n≳170, where the table often gives a lower bound without an explicit code. The same count predicts improvements at 619 further pairs (n,d)(n,d)(n,d). The search was run by AI agents. The codes, their certificates and an independent checker are public.
The MacWilliams extension theorem fails for module alphabets with non-cyclic socle, and the label alphabet of qudit stabilizer codes, $\F_{q^2}$ over $\F_q$, is such an alphabet. Quantum error correction, however, only ever sees \emph{self-orthogonal} additive codes, and whether that rigidity rescues the theorem---equivalently, whether every weight-preserving isomorphism of stabilizer groups is implemented by local Cliffords and a qudit permutation---was asked by Gluesing-Luerssen and Pllaha and answered negatively by Pllaha for particular qubit codes. We develop the negative answer systematically and at the smallest possible scales. For every prime power qqq we construct a pair of [[q+1,q−1]]q[[q+1,q-1]]_q[[q+1,q−1]]q​ stabilizer codes and a weight-preserving isomorphism between them extending to no monomial transformation; the codespaces are inequivalent even under arbitrary local unitaries combined with permutations, though they share Shor--Laflamme enumerators. Self-orthogonality is automatic here, by two elementary lemmas which also show that Dyshko's threshold-length counterexamples were already self-orthogonal, unremarked. For qubits we prove by exhaustive search that length 333 is minimal and the counterexample essentially unique. Dropping the ``idle qudit'' invariant that detects these, we find the minimal full-support lengths: 444 for a non-extendable isometry, 555 for a weight-isometric pair that is not monomially equivalent, realized by explicit [[5,2]][[5,2]][[5,2]] codes; at length 666 all nontrivial stabilizer elements can have weight ≥4\ge 4≥4. Whether these codespaces are locally unitarily equivalent is posed as an open problem, connecting the extension problem to the LU--LC circle of questions.
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 give an explicit pure ((7,2,4))_4 quantum code (equivalently an additive [[7,1/2,4]]_4 stabilizer code): a binary graph state on 14 physical qubits grouped into seven ququarts, with one reference qubit. Exact binary cut-rank computations show that every error supported on at most three ququarts is detected; an explicit weight-four Pauli operator shows the distance is exactly four. Every code of distance at least four that contains the first codeword has dimension at most two, and hence equals the displayed code. Conditional on the published exclusion of stabilizer [[7,1,4]]_4 codes (Ball–Moreno–Simoens, arXiv:2401.06618), dimension two is the largest additive dimension at these parameters. Nothing is claimed about codes not containing the displayed codeword, other than the additive case. Status: not peer reviewed. The author has reviewed the mathematics personally; no independent review by another party has been carried out. Initial searches of the literature did not turn up this code (standard tables list integer k, so a K=2 code would not appear in them); more extensive checks are being carried out. Priority and novelty are pending verification and are not claimed. Files: note (PDF and TeX), graph file, verification script (python3 pure_7_2_4_4_code_verify.py pure_7_2_4_4_code_graph.json), README.