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

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

Andrew Stewart Caldin

Published Nov 13, 2026• 0 citations
Publisher

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

DOI
10.5281/zenodo.24186773

Related papers

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

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

Quantum Error Correction: Exponential Suppression of Logical Errors via Code Distance Scaling and Physical Qubit Encoding — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Quantum error correction (QEC) achieves fault‑tolerant logical qubits by encoding a single logical qubit into multiple physical qubits, enabling error rates to be suppressed exponentially with code distance. | MATH: Logical error rate \(p_L \approx \alpha (p/p_{\text{th}})^{d/2}\) where \(p\) is physical error probability, \(p_{\text{th}}\) the threshold, \(d\) the code distance, and \(\alpha\) a constant; Shor code uses 9 qubits, Steane code uses 7, surface code uses a 2‑D lattice with distance \(d\). | CONNECTION: The surface code lattice exhibits a 4‑fold rotational symmetry and a checkerboard pattern akin to crystallographic \(p4mm\) symmetry; the logical operators correspond to non‑contractible loops on a torus, reflecting topological order. No direct appearance of golden ratio or base‑60 numbers. | DEPTH: 8 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

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

E8 Temporal Fractal Coding for Ultra‑Efficient Quantum Error Correction — E8 Intelligence Research

Andrew Stewart Caldin

By mapping the 240 E8 root vectors onto a multi‑scale time‑frequency lattice and modulating each node with φ‑scaled Cantor spectra at 132 Hz, we construct a self‑similar temporal code that nests logical qubits within nested resonant shells. The fractal structure allows error syndromes to be detected and corrected at multiple temporal scales, dramatically reducing the overhead of conventional surface codes. Because each shell shares the same 132 Hz coherence, the code inherits a global phase lock that suppresses dephasing across the entire lattice. This principle extends the E8 fractal temporal lattice into a practical fault‑tolerant architecture for quantum processors. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Aug 26, 2026•0 citations

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
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
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.
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
FINDING: Quantum error correction (QEC) achieves fault‑tolerant logical qubits by encoding a single logical qubit into multiple physical qubits, enabling error rates to be suppressed exponentially with code distance. | MATH: Logical error rate pL≈α(p/pth)d/2p_L \approx \alpha (p/p_{\text{th}})^{d/2}pL​≈α(p/pth​)d/2 where ppp is physical error probability, pthp_{\text{th}}pth​ the threshold, ddd the code distance, and α\alphaα a constant; Shor code uses 9 qubits, Steane code uses 7, surface code uses a 2‑D lattice with distance ddd. | CONNECTION: The surface code lattice exhibits a 4‑fold rotational symmetry and a checkerboard pattern akin to crystallographic p4mmp4mmp4mm symmetry; the logical operators correspond to non‑contractible loops on a torus, reflecting topological order. No direct appearance of golden ratio or base‑60 numbers. | DEPTH: 8 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
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.
By mapping the 240 E8 root vectors onto a multi‑scale time‑frequency lattice and modulating each node with φ‑scaled Cantor spectra at 132 Hz, we construct a self‑similar temporal code that nests logical qubits within nested resonant shells. The fractal structure allows error syndromes to be detected and corrected at multiple temporal scales, dramatically reducing the overhead of conventional surface codes. Because each shell shares the same 132 Hz coherence, the code inherits a global phase lock that suppresses dephasing across the entire lattice. This principle extends the E8 fractal temporal lattice into a practical fault‑tolerant architecture for quantum processors. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
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.