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

Design Principles for Ultra-High-Rate Quantum Codes

Jong Yeon Lee, Koki Okada, Nishad Maskara, Kenta Kasai, Hengyun Zhou

quant-phSubmitted Sep 24, 2026• Announced Sep 25, 2026• 10 citations
arXivHTMLPDF

Abstract

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.

AI Summary

The paper studies finite-blocklength tradeoffs among rate, distance, check weight, and syndrome-extraction performance in high-rate quantum codes. It separates construction templates, degree distributions, and lift size, using incidence counting to relate design rate to average qubit degree and check weight. Classical density-evolution and weight-enumerator calculations provide heuristic guidance for selecting degrees. A pair-partition template enforces CSS commutation through paired circulant contributions. Incorporating fixed-point-free $ZX$ dualities into the search enables symplectic halving into non-CSS codes, preserving rate and halving blocklength, with $\lceil d_{\mathrm{parent}}/2\rceil\leq d_{\mathrm{fold}}\leq d_{\mathrm{parent}}$. Reported exact-distance, weight-10 instances include $[[90,21,11]]$, $[[140,31,15]]$, and $[[200,43,20]]$. Distances are established through logical witnesses and exhaustive symmetry-informed branch-and-bound searches; other catalogue entries have only upper bounds. At matched degree parameters, halved instances show a median best blocklength improvement of approximately $1.6$ over CSS instances. Circuit-level memory simulations at $p=0.1\%$ give a per-logical-per-round error rate of $6.1\times10^{-11}$ for $[[95,22,11]]$ and a 95% upper bound of $4.1\times10^{-12}$ for $[[186,65,14]]$. A separate comparison finds that increased distance can compensate for heavier checks. Packet-based logical-module decomposition also supports searches for low-weight canonical logical bases. Limitations include ensemble heuristics that omit commutation constraints and stabilizer quotients, circulant-family distance ceilings under stated assumptions, and simulations without idling errors or noisy non-CSS preparation/readout. Decoding uses integer-programming fallback, which becomes costly at higher error rates; logical-operation and architectural overheads remain unassessed.

Little sign of AI-generated textStrong assumptions

Error found: The abstract's assertion that increased distance 'often' outweighs heavier checks at 0.1% physical error is broader than the single directly simulated code-pair comparison establishes. The introduction attributes circuit-level performance to three headline non-CSS instances, whereas the reported simulations concern two different non-CSS instances. Section 3.3 states an unconditional CPM-PP distance ceiling, but Appendix A establishes the quantum bound only under additional lift-size, protograph-size, and rank assumptions.

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

Comments
20 + 16 pages. This work also subsumes the earlier results of arXiv preprint 2607.14091

Related papers

Design Principles for Ultra-High-Rate Quantum Codes — E8 Intelligence Research

Andrew Stewart Caldin

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 increas Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 13, 2026•0 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

Towards Ultra-High-Rate Quantum Error Correction with Reconfigurable Atom Arrays

Chen Zhao, Casey Duckering, Andi Gu +2 more

Quantum error correction is widely believed to be essential for large-scale quantum computation, but the required qubit overhead remains a central challenge. Quantum low-density parity-check codes can substantially reduce this overhead through high-rate encodings, yet finite-size instances with practical logical error rates often achieve encoding rates only around or below $1/10$. Here, building on a recent ultra-high-rate construction by Kasai, we identify new structural conditions on the underlying affine permutation matrices that make encoding rates exceeding $1/2$ compatible with efficient implementation on reconfigurable neutral atom arrays. These conditions define a co-designed family of ultra-high-rate quantum codes that supports efficient syndrome extraction and atom rearrangement under realistic parallel control constraints. Using a hierarchical decoder with high accuracy and good throughput, we study the performance under a circuit-level noise model with $p=0.1\%$, achieving per-logical-per-round error rates of $1.3_{-0.9}^{+3.0} \times 10^{-13}$ with a $[[2304,1156,\leq 14]]$ code and $2.9_{-1.5}^{+3.1} \times 10^{-11}$ with a $[[1152,580,\leq 12]]$ code. We compare these codes against a heuristic Pareto frontier for finite-blocklength codes relating block length, encoding rate, and logical error rates, and find that our codes lie near the frontier. These results approach the teraquop regime, highlighting the promise of this code family for practical ultra-high-rate quantum error correction.

quant-pharXiv:2604.16209•Apr 20, 2026•53 citations

Efficient Logic with Ultra-High-Rate Quantum Codes

Nishad Maskara, Rohan Mehta, Zhiyang He +4 more

Quantum low-density parity-check (qLDPC) codes offer a promising route to reducing the qubit overhead of fault tolerance, with recent ultra-high-rate constructions achieving encoding rates above one half. In this work, we develop fast and parallel logical computation methods for ultra-high-rate codes. We first utilize the group symmetries of the codes to partition the logical qubits into orbits, and then apply parallel surgery methods to implement group-invariant collections of logical Pauli-product measurements. These measurements are highly programmable, as we may arbitrarily couple logical orbits as long as each measurement is repeated across the whole orbit(s). To reduce the space and time overheads, we develop a technique called chain-map convolution, which uses the group structure to boost both the spatial and temporal distances of our protocol in a highly efficient manner. As case studies, we construct distance-preserving parallel measurement gadgets for the [[256, 68, 12]], [[576, 148, 18]] pair-partition codes, and a [[1152, 580, 12]] rate-$1/2$ code, with only around $2.5\times$ space overhead and 3-4 rounds of syndrome extraction each. The same methods also enable parallel injection of cultivated magic states into high-rate codes. Finally, we extend programmability through subgroup restrictions, revealing a tradeoff between logical control and the spacetime resources required for fault tolerance and highlighting the crucial role structured parallelism plays in reducing overhead. These results provide new methods for designing qLDPC logical operations with low spacetime overhead, opening a route toward more efficient fault-tolerant quantum architectures.

quant-pharXiv:2610.06749•Oct 6, 2026•2 citations

MERLIN SCIENCE — Design Principles for Ultra-High-Rate Quantum Codes — E8 Intelligence Research

Andrew Stewart Caldin

Today's breakthrough illuminates the design principles for ultra-high-rate quantum codes, which significantly reduce the qubit overhead required for quantum error correction. As we progress towards scalable fault-tolerant quantum computing, minimising the resources needed for error correction has become increasingly crucial. The challenge lies in effectively balancing encoding rate, distance, check weight, and blocklength, but our work provides clarity in this complex design space. Our approach is grounded in an analysis of pair-partition constructions, combined with a halving transformation that further optimises blocklengths. By delving into ensemble analysis, we identified column weight as a pivotal design parameter. Increasing column weight allows us to achieve larger distances while maintaining compact blocklengths, although this does introduce heavier checks. However, our findings suggest that when physical error rates are around 0.1%, the advantages gained from heightened dista Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 15, 2026•0 citations

Entangling logical qubits without physical operations

Jin Ming Koh, Anqi Gong, Andrei C. Diaconu +6 more

Fault-tolerant logical entangling gates are essential for scalable quantum computing, but are limited by the error rates and overheads of physical two-qubit gates and measurements. To address this limitation, we introduce phantom codes-quantum error-correcting codes that realize entangling gates between all logical qubits in a code block purely through relabelling of physical qubits during compilation, yielding perfect fidelity with no spatial or temporal overhead. We present a systematic study of such codes. First, we identify phantom codes using complementary numerical and analytical approaches. We exhaustively enumerate all $2.71 \times 10^{10}$ inequivalent CSS codes up to $n=14$ and identify additional instances up to $n=21$ via SAT-based methods. We then construct higher-distance phantom-code families using quantum Reed-Muller codes and the binarization of qudit codes. Across all identified codes, we characterize other supported fault-tolerant logical Clifford and non-Clifford operations. Second, through end-to-end noisy simulations with state preparation, full QEC cycles, and realistic physical error rates, we demonstrate scalable advantages of phantom codes over the surface code across multiple tasks. We observe a one-to-two order-of-magnitude reduction in logical infidelity at comparable qubit overhead for GHZ-state preparation and Trotterized many-body simulation tasks, given a modest preselection acceptance rate. Our work establishes phantom codes as a viable architectural route to fault-tolerant quantum computation with scalable benefits for workloads with dense local entangling structure, and introduces general tools for systematically exploring the broader landscape of quantum error-correcting codes.

quant-pharXiv:2601.20927•Jan 30, 2026•27 citations
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.
The paper studies finite-blocklength tradeoffs among rate, distance, check weight, and syndrome-extraction performance in high-rate quantum codes. It separates construction templates, degree distributions, and lift size, using incidence counting to relate design rate to average qubit degree and check weight. Classical density-evolution and weight-enumerator calculations provide heuristic guidance for selecting degrees.
A pair-partition template enforces CSS commutation through paired circulant contributions. Incorporating fixed-point-free ZXZXZX dualities into the search enables symplectic halving into non-CSS codes, preserving rate and halving blocklength, with ⌈dparent/2⌉≤dfold≤dparent\lceil d_{\mathrm{parent}}/2\rceil\leq d_{\mathrm{fold}}\leq d_{\mathrm{parent}}⌈dparent​/2⌉≤dfold​≤dparent​. Reported exact-distance, weight-10 instances include [[90,21,11]][[90,21,11]][[90,21,11]], [[140,31,15]][[140,31,15]][[140,31,15]], and [[200,43,20]][[200,43,20]][[200,43,20]]. Distances are established through logical witnesses and exhaustive symmetry-informed branch-and-bound searches; other catalogue entries have only upper bounds. At matched degree parameters, halved instances show a median best blocklength improvement of approximately 1.61.61.6 over CSS instances.
Circuit-level memory simulations at p=0.1%p=0.1\%p=0.1% give a per-logical-per-round error rate of 6.1×10−116.1\times10^{-11}6.1×10−11 for [[95,22,11]][[95,22,11]][[95,22,11]] and a 95% upper bound of 4.1×10−124.1\times10^{-12}4.1×10−12 for [[186,65,14]][[186,65,14]][[186,65,14]]. A separate comparison finds that increased distance can compensate for heavier checks. Packet-based logical-module decomposition also supports searches for low-weight canonical logical bases.
Limitations include ensemble heuristics that omit commutation constraints and stabilizer quotients, circulant-family distance ceilings under stated assumptions, and simulations without idling errors or noisy non-CSS preparation/readout. Decoding uses integer-programming fallback, which becomes costly at higher error rates; logical-operation and architectural overheads remain unassessed.
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 increas Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
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.
Quantum error correction is widely believed to be essential for large-scale quantum computation, but the required qubit overhead remains a central challenge. Quantum low-density parity-check codes can substantially reduce this overhead through high-rate encodings, yet finite-size instances with practical logical error rates often achieve encoding rates only around or below 1/101/101/10. Here, building on a recent ultra-high-rate construction by Kasai, we identify new structural conditions on the underlying affine permutation matrices that make encoding rates exceeding 1/21/21/2 compatible with efficient implementation on reconfigurable neutral atom arrays. These conditions define a co-designed family of ultra-high-rate quantum codes that supports efficient syndrome extraction and atom rearrangement under realistic parallel control constraints. Using a hierarchical decoder with high accuracy and good throughput, we study the performance under a circuit-level noise model with p=0.1%p=0.1\%p=0.1%, achieving per-logical-per-round error rates of 1.3−0.9+3.0×10−131.3_{-0.9}^{+3.0} \times 10^{-13}1.3−0.9+3.0​×10−13 with a [[2304,1156,≤14]][[2304,1156,\leq 14]][[2304,1156,≤14]] code and 2.9−1.5+3.1×10−112.9_{-1.5}^{+3.1} \times 10^{-11}2.9−1.5+3.1​×10−11 with a [[1152,580,≤12]][[1152,580,\leq 12]][[1152,580,≤12]] code. We compare these codes against a heuristic Pareto frontier for finite-blocklength codes relating block length, encoding rate, and logical error rates, and find that our codes lie near the frontier. These results approach the teraquop regime, highlighting the promise of this code family for practical ultra-high-rate quantum error correction.
Quantum low-density parity-check (qLDPC) codes offer a promising route to reducing the qubit overhead of fault tolerance, with recent ultra-high-rate constructions achieving encoding rates above one half. In this work, we develop fast and parallel logical computation methods for ultra-high-rate codes. We first utilize the group symmetries of the codes to partition the logical qubits into orbits, and then apply parallel surgery methods to implement group-invariant collections of logical Pauli-product measurements. These measurements are highly programmable, as we may arbitrarily couple logical orbits as long as each measurement is repeated across the whole orbit(s). To reduce the space and time overheads, we develop a technique called chain-map convolution, which uses the group structure to boost both the spatial and temporal distances of our protocol in a highly efficient manner. As case studies, we construct distance-preserving parallel measurement gadgets for the [[256, 68, 12]], [[576, 148, 18]] pair-partition codes, and a [[1152, 580, 12]] rate-1/21/21/2 code, with only around 2.5×2.5\times2.5× space overhead and 3-4 rounds of syndrome extraction each. The same methods also enable parallel injection of cultivated magic states into high-rate codes. Finally, we extend programmability through subgroup restrictions, revealing a tradeoff between logical control and the spacetime resources required for fault tolerance and highlighting the crucial role structured parallelism plays in reducing overhead. These results provide new methods for designing qLDPC logical operations with low spacetime overhead, opening a route toward more efficient fault-tolerant quantum architectures.
Today's breakthrough illuminates the design principles for ultra-high-rate quantum codes, which significantly reduce the qubit overhead required for quantum error correction. As we progress towards scalable fault-tolerant quantum computing, minimising the resources needed for error correction has become increasingly crucial. The challenge lies in effectively balancing encoding rate, distance, check weight, and blocklength, but our work provides clarity in this complex design space. Our approach is grounded in an analysis of pair-partition constructions, combined with a halving transformation that further optimises blocklengths. By delving into ensemble analysis, we identified column weight as a pivotal design parameter. Increasing column weight allows us to achieve larger distances while maintaining compact blocklengths, although this does introduce heavier checks. However, our findings suggest that when physical error rates are around 0.1%, the advantages gained from heightened dista Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Fault-tolerant logical entangling gates are essential for scalable quantum computing, but are limited by the error rates and overheads of physical two-qubit gates and measurements. To address this limitation, we introduce phantom codes-quantum error-correcting codes that realize entangling gates between all logical qubits in a code block purely through relabelling of physical qubits during compilation, yielding perfect fidelity with no spatial or temporal overhead. We present a systematic study of such codes. First, we identify phantom codes using complementary numerical and analytical approaches. We exhaustively enumerate all 2.71×10102.71 \times 10^{10}2.71×1010 inequivalent CSS codes up to n=14n=14n=14 and identify additional instances up to n=21n=21n=21 via SAT-based methods. We then construct higher-distance phantom-code families using quantum Reed-Muller codes and the binarization of qudit codes. Across all identified codes, we characterize other supported fault-tolerant logical Clifford and non-Clifford operations. Second, through end-to-end noisy simulations with state preparation, full QEC cycles, and realistic physical error rates, we demonstrate scalable advantages of phantom codes over the surface code across multiple tasks. We observe a one-to-two order-of-magnitude reduction in logical infidelity at comparable qubit overhead for GHZ-state preparation and Trotterized many-body simulation tasks, given a modest preselection acceptance rate. Our work establishes phantom codes as a viable architectural route to fault-tolerant quantum computation with scalable benefits for workloads with dense local entangling structure, and introduces general tools for systematically exploring the broader landscape of quantum error-correcting codes.