arXiv:2609.30069
Design Principles for Ultra-High-Rate Quantum Codes
Jong Yeon Lee, Koki Okada, Nishad Maskara, Kenta Kasai, Hengyun Zhou
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.
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