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

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

Marin Girard

Published Nov 5, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2611.08744

Related papers

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

Mansehej Singh

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.

•Aug 10, 2026•0 citations

Good Stabilizer Codes from Shallow Clifford Circuits with Random Matchings

Emile Anand, Elia Gorokhovsky, Jennifer Hritz +1 more

Encoding quantum information with low circuit overhead is a fundamental challenge in fault-tolerant quantum computation. Random circuits provide a natural mechanism for rapidly spreading logical information through simple gates applied in parallel. Brown and Fawzi showed that random Clifford circuits on two-qubit Clifford gates provide such encoders that achieve the quantum Gilbert-Varshamov rate-distance tradeoff with depth $O(\log^3 n)$. We show that the same asymptotic tradeoff is attained in optimal $O(\log n)$ depth under a gate distribution with a more restricted support. For every fixed $δ>0$ and sufficiently large $n$, if $\frac kn < 1 - H(\frac{d}{n}) - \frac{d}{n}\log_2 3 - δ$, we can construct random circuits of depth $O(\log n)$ which define, with high probability, an $[n,k]$ stabilizer code of distance at least $d+1$, which matches the $Ω(\log n)$ light-cone lower bound for linear distance encoders. Our ensemble employs a random matching circuit architecture consisting of $T$ independent permutation-invariant layers. In each layer, the qubits are paired up by a uniformly random perfect matching, and a random independent two-qubit Clifford gate is applied to each pair. The gate distribution need not be uniform over, or even have full support on, the two-qubit Clifford group; rather, we allow for very general distributions on Clifford gates satisfying three regularity conditions. In particular, the construction can be implemented using $n/2$ CNOT gates on randomly matched pairs in each layer, with parallel one-qubit Clifford twirls. These regularity conditions allow us to reduce the second-moment dynamics of our random circuits to a reversible Markov chain on binary support strings. We establish logarithmic hitting-time bounds for this Markov chain and comparisons of its stationary distribution to prove the coding properties of the circuits.

quant-pharXiv:2608.18536•Aug 20, 2026•1 citation

Low-weight high-distance error-correcting fermionic encodings

Fedor Šimkovic, Martin Leib, Francisco Revson F. Pereira

We perform an extended numerical search for practical fermion-to-qubit encodings with error-correcting properties. Ideally, encodings should strike a balance between a number of the seemingly incompatible attributes, such as having a high minimum distance, low-weight fermionic logical operators, a small qubit to fermionic mode ratio and a simple qubit connectivity graph including ancilla qubits for the measurement of stabilizers. Our strategy consists of a three-step procedure in which we: First generate encodings with code distances up to d ≤ 4 by a brute-force enumeration technique; subsequently, we use these encodings as starting points and apply Clifford deformations to them which allows us to identify higher-distance codes with d ≤ 7 ; finally, we optimize the hardware connectivity graphs of resulting encodings in terms of the graph thickness and the number of connections per qubit. We report multiple promising high-distance encodings which significantly improve the weights of stabilizers and logical operators compared to previously reported alternatives. Published by the American Physical Society 2024

arXiv:2402.15386•Physical Review Research•Nov 12, 2024•5 citations

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

Optimal, Best-Known Divisible Binary Codes and Related Quantum Codes

Hao Chen, Cong Yu, Yaqi Chen +3 more

Divisible codes have been studied for many years, since the divisibility theorem on binary cyclic codes was proved by R. J. McEliece in 1972 and divisible codes were introduced by H. N. Ward in 1981. It is well-known that doubly even (4-divisible) binary codes can be used to construct stabilizer quantum codes. Triorthogonal binary codes and CSS-T pairs of binary codes were introduced to construct CSS-T quantum codes. In this paper, we show that 8-divisible (triply even) binary linear codes are triorthogonal codes and CSS-T pairs of codes can be obtained from 8-divisible codes directly. Infinitely many infinite families of$2^{r}$-divisible optimal binary codes are presented, for an arbitrarily large positive integer$r$. Seventeen doubly even (self-orthogonal) binary cyclic codes and five triply even binary cyclic codes with their minimum weights equal to the minimum weights of best-known linear codes are found. An infinite family of rate around$\frac {1}{2}$explicit doubly even (self-orthogonal) binary cyclic codes with the lower bound$\frac {n_{i}}{\log n_{i}}$on their minimum distances and the lower bound$\sqrt {\frac {n_{i}}{2}}$on their dual distances is constructed. This is much stronger than the main results in two previous papers published in IEEE Transactions on Information Theory, 2022 and 2024 by C. Ding, C. Tang, Z. Sun and C. Li. Many CSS-T quantum codes with new parameters are constructed. Many stabilizer quantum codes given in this paper have distances close to the best-known ones documented in Grassl’s database.

IEEE Transactions on Information Theory•Aug 4, 2026•0 citations

Transversal Clifford and T -Gate Codes of Short Length and High Distance

Shubham P. Jain, Victor V. Albert

The non-local interactions in several quantum device architectures allow for the realization of more compact quantum encodings while retaining the same degree of protection against noise. Anticipating that short to medium-length codes will soon be realizable, it is important to construct stabilizer codes that, for a given code distance, admit fault-tolerant implementations of logical gates with the fewest number of physical qubits. To this aim, we construct three kinds of codes encoding a single logical qubit for distances up to 31. First, we construct the smallest known doubly even codes, all of which admit a transversal implementation of the Clifford group. Applying a doubling procedure arXiv:1509.03239 to such codes yields the smallest known weak triply even codes for the same distances and number of encoded qubits. This second family of codes admit a transversal implementation of the logical T-gate. Relaxing the triply even property, we obtain our third family of triorthogonal codes with an even lower overhead at the cost of requiring additional Clifford gates to achieve the same logical operation. To our knowledge, these are the smallest known triorthogonal codes for their respective distances. While not qLDPC, the stabilizer generator weights of the code families with transversal T-gates scale roughly as the square root of their lengths.

arXiv:2408.12752•IEEE Journal on Selected Areas in Information Theory•Jan 1, 2025•19 citations
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.
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$\code{14,3,5}$ exists, including degenerate codes. In the binary symplecticmodel, this is equivalent to the nonexistence of an 111111-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 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.
Encoding quantum information with low circuit overhead is a fundamental challenge in fault-tolerant quantum computation. Random circuits provide a natural mechanism for rapidly spreading logical information through simple gates applied in parallel. Brown and Fawzi showed that random Clifford circuits on two-qubit Clifford gates provide such encoders that achieve the quantum Gilbert-Varshamov rate-distance tradeoff with depth O(log⁡3n)O(\log^3 n)O(log3n). We show that the same asymptotic tradeoff is attained in optimal O(log⁡n)O(\log n)O(logn) depth under a gate distribution with a more restricted support. For every fixed δ>0δ>0δ>0 and sufficiently large nnn, if kn<1−H(dn)−dnlog⁡23−δ\frac kn < 1 - H(\frac{d}{n}) - \frac{d}{n}\log_2 3 - δnk​<1−H(nd​)−nd​log2​3−δ, we can construct random circuits of depth O(log⁡n)O(\log n)O(logn) which define, with high probability, an [n,k][n,k][n,k] stabilizer code of distance at least d+1d+1d+1, which matches the Ω(log⁡n)Ω(\log n)Ω(logn) light-cone lower bound for linear distance encoders. Our ensemble employs a random matching circuit architecture consisting of TTT independent permutation-invariant layers. In each layer, the qubits are paired up by a uniformly random perfect matching, and a random independent two-qubit Clifford gate is applied to each pair. The gate distribution need not be uniform over, or even have full support on, the two-qubit Clifford group; rather, we allow for very general distributions on Clifford gates satisfying three regularity conditions. In particular, the construction can be implemented using n/2n/2n/2 CNOT gates on randomly matched pairs in each layer, with parallel one-qubit Clifford twirls. These regularity conditions allow us to reduce the second-moment dynamics of our random circuits to a reversible Markov chain on binary support strings. We establish logarithmic hitting-time bounds for this Markov chain and comparisons of its stationary distribution to prove the coding properties of the circuits.
We perform an extended numerical search for practical fermion-to-qubit encodings with error-correcting properties. Ideally, encodings should strike a balance between a number of the seemingly incompatible attributes, such as having a high minimum distance, low-weight fermionic logical operators, a small qubit to fermionic mode ratio and a simple qubit connectivity graph including ancilla qubits for the measurement of stabilizers. Our strategy consists of a three-step procedure in which we: First generate encodings with code distances up to d ≤ 4 by a brute-force enumeration technique; subsequently, we use these encodings as starting points and apply Clifford deformations to them which allows us to identify higher-distance codes with d ≤ 7 ; finally, we optimize the hardware connectivity graphs of resulting encodings in terms of the graph thickness and the number of connections per qubit. We report multiple promising high-distance encodings which significantly improve the weights of stabilizers and logical operators compared to previously reported alternatives. Published by the American Physical Society 2024
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.
Divisible codes have been studied for many years, since the divisibility theorem on binary cyclic codes was proved by R. J. McEliece in 1972 and divisible codes were introduced by H. N. Ward in 1981. It is well-known that doubly even (4-divisible) binary codes can be used to construct stabilizer quantum codes. Triorthogonal binary codes and CSS-T pairs of binary codes were introduced to construct CSS-T quantum codes. In this paper, we show that 8-divisible (triply even) binary linear codes are triorthogonal codes and CSS-T pairs of codes can be obtained from 8-divisible codes directly. Infinitely many infinite families of2r2^{r}2r-divisible optimal binary codes are presented, for an arbitrarily large positive integerrrr. Seventeen doubly even (self-orthogonal) binary cyclic codes and five triply even binary cyclic codes with their minimum weights equal to the minimum weights of best-known linear codes are found. An infinite family of rate around12\frac {1}{2}21​explicit doubly even (self-orthogonal) binary cyclic codes with the lower boundnilog⁡ni\frac {n_{i}}{\log n_{i}}logni​ni​​on their minimum distances and the lower boundni2\sqrt {\frac {n_{i}}{2}}2ni​​​on their dual distances is constructed. This is much stronger than the main results in two previous papers published in IEEE Transactions on Information Theory, 2022 and 2024 by C. Ding, C. Tang, Z. Sun and C. Li. Many CSS-T quantum codes with new parameters are constructed. Many stabilizer quantum codes given in this paper have distances close to the best-known ones documented in Grassl’s database.
The non-local interactions in several quantum device architectures allow for the realization of more compact quantum encodings while retaining the same degree of protection against noise. Anticipating that short to medium-length codes will soon be realizable, it is important to construct stabilizer codes that, for a given code distance, admit fault-tolerant implementations of logical gates with the fewest number of physical qubits. To this aim, we construct three kinds of codes encoding a single logical qubit for distances up to 31. First, we construct the smallest known doubly even codes, all of which admit a transversal implementation of the Clifford group. Applying a doubling procedure arXiv:1509.03239 to such codes yields the smallest known weak triply even codes for the same distances and number of encoded qubits. This second family of codes admit a transversal implementation of the logical T-gate. Relaxing the triply even property, we obtain our third family of triorthogonal codes with an even lower overhead at the cost of requiring additional Clifford gates to achieve the same logical operation. To our knowledge, these are the smallest known triorthogonal codes for their respective distances. While not qLDPC, the stabilizer generator weights of the code families with transversal T-gates scale roughly as the square root of their lengths.