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.02621

High-Rate Quantum Codes with Proven Distance and Low-Weight Measurements

Kishor Bharti, Tobias Haug, Runzhou Tao, Kevin Ye

quant-phSubmitted Oct 2, 2026• Announced Oct 5, 2026• 0 citations
arXivHTMLPDF

Abstract

We study a family of quantum subsystem codes defined on rectangular coordinate grids of any dimension, with even side lengths of at least four. The directly measured operators act along coordinate lines. For every member of the family, we derive the number of protected logical qubits and prove its dressed distance without a numerical search. To illustrate the resulting design choices, we impose a budget of at most 10,000 data qubits and determine the complete tradeoff between encoding rate and measurement weight within this family at distances 16, 32, and 64. At distance 16, one code protects 4,096 logical qubits among 10,000 data qubits using weight-ten measurements. At distances 32 and 64, codes with 7,776 and 9,216 data qubits protect 1,024 and 256 logical qubits, respectively, using weight-six measurements. We include and explain Lean code snippets throughout the paper to guide readers through the formal verification of our subsystem-code construction and its dressed and bare distances.

AI Summary

The paper asks how protected encoding rate and directly measured gauge weight trade off in coordinate-line subsystem codes. It extends subsystem many-hypercube constructions to rectangular grids with $L\ge1$ axes and arbitrary even side lengths $q_i\ge4$, measuring full-line $X$ and $Z$ gauges. For every tuple it derives $N=\prod_iq_i$, $K=\prod_i(q_i-2)$, $g=N+K-2\prod_i(q_i-1)$, and exact dressed and bare distances $D=2^L$, with maximum gauge weight $w=\max_iq_i$. Tensor-product linear algebra identifies the full stabilizer space and its rank. A quotient-space labeling argument bounds every nontrivial dressed representative below by $2^L$; a Cartesian-product corner operator attains the bound. The minimum nonidentity stabilizer weight is $2^{L-1}\min_iq_i$. Supplied Lean proofs independently establish both distances, but not the rank formulas, full-center equality, stabilizer-weight bound, or finite optimizations. Under $N\le10{,}000$, the complete rate–measurement-weight frontiers at distances $16,32,64$ have maximum-rate members $10^4$, $6^5$, and $4^46^2$, respectively. These encode $4096/10000$, $1024/7776$, and $256/9216$ protected qubits using maximum gauge weights $10,6,6$. These optima are family-specific static-code comparisons. At fixed side length, rate vanishes as dimension grows, data degree grows logarithmically, and stabilizers become heavy; the family is not conventional QLDPC. Connectivity is not assumed local. Ideal measurement schedules and ancilla counts do not establish fault-tolerant circuit distance or logical error rates; decoding and noisy extraction for the optimized rectangular codes remain open.

Little sign of AI-generated textIncremental

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

Comments
Several Lean snippets in main text. 18 pages

Related papers

Check-weight-constrained quantum codes: Bounds and examples

Lily Wang, Andy Zeyi Liu, Ray Li +2 more

Quantum low-density parity-check (qLDPC) codes can be implemented by measuring only low-weight checks, making them compatible with noisy quantum hardware and central to the quest to build noise-resilient quantum computers. A fundamental open question is how constraints on check weight limit the achievable parameters of qLDPC codes. Here, we study stabilizer and subsystem codes with constrained check weight, combining analytical arguments with numerical optimization to establish strong upper bounds on their parameters. We show that stabilizer codes with checks of weight at most three cannot have nontrivial distance. We also prove tight tradeoffs between rate and distance for broad families of CSS stabilizer and subsystem codes with checks of weight at most four and two, respectively. Notably, our bounds are applicable to general qLDPC codes, as they rely only on check-weight constraints without assuming geometric locality or special graph connectivity. In the finite-size regime, we derive numerical upper bounds using linear programming techniques and identify explicit code constructions that approach these limits, delineating the landscape of practically relevant qLDPC codes with tens or hundreds of physical qubits.

quant-pharXiv:2601.15446•Jan 23, 2026•14 citations

Design Principles for Ultra-High-Rate Quantum Codes

Jong Yeon Lee, Koki Okada, Nishad Maskara +2 more

Reducing the qubit overhead of quantum error correction is a central challenge for scalable fault-tolerant quantum computing. Recent ultra-high-rate quantum codes offer a promising route toward this goal, with some constructions requiring as few as two physical data qubits per logical qubit. However, systematic principles for navigating the tradeoffs among encoding rate, distance, check weight, and blocklength remain lacking. Here, we develop and analyze principles for exploring this design space, and use them to design compact code constructions with improved performance. We develop code templates based on a pair-partition construction and a halving transformation that further reduces blocklength. Motivated by ensemble analysis of the degree distributions, we identify column weight as a key design parameter: increasing the column weight enables larger distances at compact blocklengths, at the cost of heavier checks. We find that at physical error rates of 0.1%, the benefits of increased distance often outweigh the penalty associated with heavier checks. Applying this framework, we identify numerous compact codes with favorable parameters, including [[90,21,11]], [[140,31,15]], and [[200,43,20]] non-CSS codes with check weight 10. Moreover, we develop symmetry-informed strategies for identifying low-weight logical bases. These results provide systematic strategies for designing ultra-high-rate quantum codes and navigating their Pareto frontier.

quant-pharXiv:2609.30069•Sep 25, 2026•10 citations

Stabilizer subsystem codes with spatially local generators

Sergey B. Bravyi

We derive new tradeoffs for reliable quantum information storage in a 2D local architecture based on subsystem quantum codes. Our results apply to stabilizer subsystem codes, that is, stabilizer codes in which part of the logical qubits does not encode any information. A stabilizer subsystem code can be specified by its gauge group - a subgroup of the Pauli group that includes the stabilizers and the logical operators on the unused logical qubits. We assume that the physical qubits are arranged on a two-dimensional grid and the gauge group has spatially local generators such that each generator acts only on a few qubits located close to each other. Our main result is an upper bound kd = O(n), where k is the number of encoded qubits, d is the minimal distance, and n is the number of physical qubits. In the special case when both gauge group and the stabilizer group have spatially local generators, we derive a stronger bound kd2= O(n) which is tight up to a constant factor.

IEEE Information Theory Workshop (ITW)•Aug 1, 2010•4 citations

Designing Group-Valued Codes with Full Regular Low-Weight Bases

Jong Yeon Lee

Efficient fault-tolerant quantum computing architectures benefit from low-weight logical operators. However, reported canonical bases for high-rate, high-distance codes can be several times heavier than the code distance, and fundamental obstructions can prevent minimum-weight logical operators from forming a complete canonical basis. To address this issue, we develop design principles for group-valued quantum error-correcting codes with low-weight full regular canonical logical bases, generated by translating a set of seed operators. We introduce frame width $f$, the smallest weight cutoff that permits a complete canonical logical basis, as an additional code parameter alongside distance $d$ and check weight $w$. Cataloguing these parameters together with explicit logical bases can inform resource estimates and the compilation of fault-tolerant logical operations. First, we identify a structural obstruction: for fully populated binary monomial CSS checks over a group of odd order, full regularity forces distance two, while for groups of power-of-two order, full row rank of both check matrices after replacing every group element by $1$ guarantees full regularity. Second, we demonstrate our principles through explicit high-rate lifted-product (LP) and pair-partition (PP) codes: an $[[1088,128,22]]$ LP code with $f=22$ and an $[[1024,256,24]]$ PP code with $f \leq 27$, both at $w=10$. At $w=11$, our PP constructions attain either $d=25$ with $f \leq 27$ or $d=24$ with the proved optimum $f=25$, demonstrating both a tradeoff among these parameters and a strict separation between distance and frame width. Finally, we propose a method combining symmetry reduction and stabilizer-based pruning for exhaustive distance certification, and use it to efficiently establish exact distances for LP examples with more than a thousand qubits.

quant-pharXiv:2610.06820•Oct 6, 2026•1 citation

Distance-four quantum codes with combined postselection and error correction

Prithviraj Prabhu, Ben W. Reichardt

When storing encoded qubits, if single faults can be corrected and double faults can be postselected against, logical errors occur due to at least three faults. At current noise rates, having to restart when two errors are detected prevents very long-term storage, but that should not be an issue for low-depth computations. We consider distance-four efficient encodings of multiple qubits into a modified planar patch of the 16-qubit surface code. We simulate postselected error correction for up to 12 000 rounds of parallel stabilizer measurements and subsequently estimate the cumulative probability of logical error for up to 12 encoded qubits. Our results demonstrate a combination of low logical error rate and low physical overhead. For example, the distance-four surface code, using postselection, accumulates 25 times less error than its distance-five counterpart. For six encoded qubits, a distance-four code using 25 qubits protects as well as the distance-five surface code using 246 qubits. Hence, distance-four codes, using postselection in a planar geometry, are qubit-efficient candidates for fault-tolerant, moderate-depth computations.

arXiv:2112.03785•Physical Review A•Jul 8, 2024•12 citations

Majorana-XYZ subsystem code

Tobias Busse, Lauri Toikka

Building fault-tolerant quantum computers is a current priority for the quantum computing industry and academic counterparts. We present a quantum error correction code encoding a single logical qubit into $n=L^2$ physical qubits with distance $d = L$ as a subsystem code, and $n-O(\sqrt{n})$ logical qubits with distance $d=3$ as a standard stabiliser code. The logical single-qubit gates in the subsystem code are transversal. Under independent $X,Z$ noise we find a threshold of $1.4\% \pm 0.1\%$ for odd distance and $1.8\% \pm 0.2\%$ for even distance for the subsystem variant. The code detects every 1- and 2-qubit error, and additionally every error of weight 3 and higher (constrained by the distance) that is not a product of the 3-qubit check operations. These operations act on the gauge qubits leaving the subsystem code space invariant. The code can be implemented by qubits in a triangular configuration with the plaquettes as 3-qubit check operations.

quant-pharXiv:2603.26311•Mar 30, 2026•2 citations
We study a family of quantum subsystem codes defined on rectangular coordinate grids of any dimension, with even side lengths of at least four. The directly measured operators act along coordinate lines. For every member of the family, we derive the number of protected logical qubits and prove its dressed distance without a numerical search. To illustrate the resulting design choices, we impose a budget of at most 10,000 data qubits and determine the complete tradeoff between encoding rate and measurement weight within this family at distances 16, 32, and 64. At distance 16, one code protects 4,096 logical qubits among 10,000 data qubits using weight-ten measurements. At distances 32 and 64, codes with 7,776 and 9,216 data qubits protect 1,024 and 256 logical qubits, respectively, using weight-six measurements. We include and explain Lean code snippets throughout the paper to guide readers through the formal verification of our subsystem-code construction and its dressed and bare distances.
The paper asks how protected encoding rate and directly measured gauge weight trade off in coordinate-line subsystem codes. It extends subsystem many-hypercube constructions to rectangular grids with L≥1L\ge1L≥1 axes and arbitrary even side lengths qi≥4q_i\ge4qi​≥4, measuring full-line XXX and ZZZ gauges.
For every tuple it derives N=∏iqiN=\prod_iq_iN=∏i​qi​, K=∏i(qi−2)K=\prod_i(q_i-2)K=∏i​(qi​−2), g=N+K−2∏i(qi−1)g=N+K-2\prod_i(q_i-1)g=N+K−2∏i​(qi​−1), and exact dressed and bare distances D=2LD=2^LD=2L, with maximum gauge weight w=max⁡iqiw=\max_iq_iw=maxi​qi​. Tensor-product linear algebra identifies the full stabilizer space and its rank. A quotient-space labeling argument bounds every nontrivial dressed representative below by 2L2^L2L; a Cartesian-product corner operator attains the bound. The minimum nonidentity stabilizer weight is 2L−1min⁡iqi2^{L-1}\min_iq_i2L−1mini​qi​. Supplied Lean proofs independently establish both distances, but not the rank formulas, full-center equality, stabilizer-weight bound, or finite optimizations.
Under N≤10,000N\le10{,}000N≤10,000, the complete rate–measurement-weight frontiers at distances 16,32,6416,32,6416,32,64 have maximum-rate members 10410^4104, 656^565, and 44624^46^24462, respectively. These encode 4096/100004096/100004096/10000, 1024/77761024/77761024/7776, and 256/9216256/9216256/9216 protected qubits using maximum gauge weights 10,6,610,6,610,6,6.
These optima are family-specific static-code comparisons. At fixed side length, rate vanishes as dimension grows, data degree grows logarithmically, and stabilizers become heavy; the family is not conventional QLDPC. Connectivity is not assumed local. Ideal measurement schedules and ancilla counts do not establish fault-tolerant circuit distance or logical error rates; decoding and noisy extraction for the optimized rectangular codes remain open.
Quantum low-density parity-check (qLDPC) codes can be implemented by measuring only low-weight checks, making them compatible with noisy quantum hardware and central to the quest to build noise-resilient quantum computers. A fundamental open question is how constraints on check weight limit the achievable parameters of qLDPC codes. Here, we study stabilizer and subsystem codes with constrained check weight, combining analytical arguments with numerical optimization to establish strong upper bounds on their parameters. We show that stabilizer codes with checks of weight at most three cannot have nontrivial distance. We also prove tight tradeoffs between rate and distance for broad families of CSS stabilizer and subsystem codes with checks of weight at most four and two, respectively. Notably, our bounds are applicable to general qLDPC codes, as they rely only on check-weight constraints without assuming geometric locality or special graph connectivity. In the finite-size regime, we derive numerical upper bounds using linear programming techniques and identify explicit code constructions that approach these limits, delineating the landscape of practically relevant qLDPC codes with tens or hundreds of physical qubits.
Reducing the qubit overhead of quantum error correction is a central challenge for scalable fault-tolerant quantum computing. Recent ultra-high-rate quantum codes offer a promising route toward this goal, with some constructions requiring as few as two physical data qubits per logical qubit. However, systematic principles for navigating the tradeoffs among encoding rate, distance, check weight, and blocklength remain lacking. Here, we develop and analyze principles for exploring this design space, and use them to design compact code constructions with improved performance. We develop code templates based on a pair-partition construction and a halving transformation that further reduces blocklength. Motivated by ensemble analysis of the degree distributions, we identify column weight as a key design parameter: increasing the column weight enables larger distances at compact blocklengths, at the cost of heavier checks. We find that at physical error rates of 0.1%, the benefits of increased distance often outweigh the penalty associated with heavier checks. Applying this framework, we identify numerous compact codes with favorable parameters, including [[90,21,11]], [[140,31,15]], and [[200,43,20]] non-CSS codes with check weight 10. Moreover, we develop symmetry-informed strategies for identifying low-weight logical bases. These results provide systematic strategies for designing ultra-high-rate quantum codes and navigating their Pareto frontier.
We derive new tradeoffs for reliable quantum information storage in a 2D local architecture based on subsystem quantum codes. Our results apply to stabilizer subsystem codes, that is, stabilizer codes in which part of the logical qubits does not encode any information. A stabilizer subsystem code can be specified by its gauge group - a subgroup of the Pauli group that includes the stabilizers and the logical operators on the unused logical qubits. We assume that the physical qubits are arranged on a two-dimensional grid and the gauge group has spatially local generators such that each generator acts only on a few qubits located close to each other. Our main result is an upper bound kd = O(n), where k is the number of encoded qubits, d is the minimal distance, and n is the number of physical qubits. In the special case when both gauge group and the stabilizer group have spatially local generators, we derive a stronger bound kd2= O(n) which is tight up to a constant factor.
Efficient fault-tolerant quantum computing architectures benefit from low-weight logical operators. However, reported canonical bases for high-rate, high-distance codes can be several times heavier than the code distance, and fundamental obstructions can prevent minimum-weight logical operators from forming a complete canonical basis. To address this issue, we develop design principles for group-valued quantum error-correcting codes with low-weight full regular canonical logical bases, generated by translating a set of seed operators. We introduce frame width fff, the smallest weight cutoff that permits a complete canonical logical basis, as an additional code parameter alongside distance ddd and check weight www. Cataloguing these parameters together with explicit logical bases can inform resource estimates and the compilation of fault-tolerant logical operations. First, we identify a structural obstruction: for fully populated binary monomial CSS checks over a group of odd order, full regularity forces distance two, while for groups of power-of-two order, full row rank of both check matrices after replacing every group element by 111 guarantees full regularity. Second, we demonstrate our principles through explicit high-rate lifted-product (LP) and pair-partition (PP) codes: an [[1088,128,22]][[1088,128,22]][[1088,128,22]] LP code with f=22f=22f=22 and an [[1024,256,24]][[1024,256,24]][[1024,256,24]] PP code with f≤27f \leq 27f≤27, both at w=10w=10w=10. At w=11w=11w=11, our PP constructions attain either d=25d=25d=25 with f≤27f \leq 27f≤27 or d=24d=24d=24 with the proved optimum f=25f=25f=25, demonstrating both a tradeoff among these parameters and a strict separation between distance and frame width. Finally, we propose a method combining symmetry reduction and stabilizer-based pruning for exhaustive distance certification, and use it to efficiently establish exact distances for LP examples with more than a thousand qubits.
When storing encoded qubits, if single faults can be corrected and double faults can be postselected against, logical errors occur due to at least three faults. At current noise rates, having to restart when two errors are detected prevents very long-term storage, but that should not be an issue for low-depth computations. We consider distance-four efficient encodings of multiple qubits into a modified planar patch of the 16-qubit surface code. We simulate postselected error correction for up to 12 000 rounds of parallel stabilizer measurements and subsequently estimate the cumulative probability of logical error for up to 12 encoded qubits. Our results demonstrate a combination of low logical error rate and low physical overhead. For example, the distance-four surface code, using postselection, accumulates 25 times less error than its distance-five counterpart. For six encoded qubits, a distance-four code using 25 qubits protects as well as the distance-five surface code using 246 qubits. Hence, distance-four codes, using postselection in a planar geometry, are qubit-efficient candidates for fault-tolerant, moderate-depth computations.
Building fault-tolerant quantum computers is a current priority for the quantum computing industry and academic counterparts. We present a quantum error correction code encoding a single logical qubit into n=L2n=L^2n=L2 physical qubits with distance d=Ld = Ld=L as a subsystem code, and n−O(n)n-O(\sqrt{n})n−O(n​) logical qubits with distance d=3d=3d=3 as a standard stabiliser code. The logical single-qubit gates in the subsystem code are transversal. Under independent X,ZX,ZX,Z noise we find a threshold of 1.4%±0.1%1.4\% \pm 0.1\%1.4%±0.1% for odd distance and 1.8%±0.2%1.8\% \pm 0.2\%1.8%±0.2% for even distance for the subsystem variant. The code detects every 1- and 2-qubit error, and additionally every error of weight 3 and higher (constrained by the distance) that is not a product of the 3-qubit check operations. These operations act on the gauge qubits leaving the subsystem code space invariant. The code can be implemented by qubits in a triangular configuration with the plaquettes as 3-qubit check operations.