aiqbench analysis
This research introduces a new family of hyperbolic color codes that simultaneously achieve constant encoding rates and polynomial code distances, overcoming previous logarithmic distance limitations. By leveraging arithmetic hyperbolic manifolds in dimensions D≥4, the study provides a critical testbed for fault-tolerant quantum computation protocols requiring both high efficiency and robust error correction. These advances directly address current hardware constraints while preserving the structural advantages essential for single-shot error correction and self-correcting architectures.
Hyperbolic color codes with constant rate and polynomial distance
arXiv:2609.16125v1 Announce Type: new Abstract: Recent advances in quantum hardware relax the strict geometric-locality constraints traditionally imposed on quantum error-correcting codes, motivating interest in high-rate quantum low-density parity-check (qLDPC) codes. At the same time, color codes provide a particularly rich setting for fault-tolerant quantum computation, underlying protocols such as single-shot error correction and self-correcting quantum computation. Hyperbolic color codes provide a class of high-rate qLDPC codes that also retain the structural features of color codes relevant to fault-tolerant quantum computation. However, previous constructions of hyperbolic color codes have achieved at most logarithmic code distance. In this work, we construct hyperbolic color codes with both constant rate and polynomial distance by building on arithmetic hyperbolic manifolds that support polynomial-distance hyperbolic toric codes. Our construction applies in arbitrary dimension \(D\geq 4\). In even dimensions, the resulting type-\(D/2\) color codes have constant encoding rate and polynomial distance, while in other cases the number of logical qubits and the code distance both exhibit polynomial scaling. We further derive explicit exponents for polynomial lower bounds as functions of the dimension and code type. These results establish a family of hyperbolic color codes simultaneously achieving constant rate and polynomial distance and providing a testbed to explore fault-tolerant quantum computation protocols that combine high-rate quantum codes with the structural advantages of color codes.
Abstract:Recent advances in quantum hardware relax the strict geometric-locality constraints traditionally imposed on quantum error-correcting codes, motivating interest in high-rate quantum low-density parity-check (qLDPC) codes. At the same time, color codes provide a particularly rich setting for fault-tolerant quantum computation, underlying protocols such as single-shot error correction and self-correcting quantum computation. Hyperbolic color codes provide a class of high-rate qLDPC codes that also retain the structural features of color codes relevant to fault-tolerant quantum computation. However, previous constructions of hyperbolic color codes have achieved at most logarithmic code distance. In this work, we construct hyperbolic color codes with both constant rate and polynomial distance by building on arithmetic hyperbolic manifolds that support polynomial-distance hyperbolic toric codes. Our construction applies in arbitrary dimension \(D\geq 4\). In even dimensions, the resulting type-\(D/2\) color codes have constant encoding rate and polynomial distance, while in other cases the number of logical qubits and the code distance both exhibit polynomial scaling. We further derive explicit exponents for polynomial lower bounds as functions of the dimension and code type. These results establish a family of hyperbolic color codes simultaneously achieving constant rate and polynomial distance and providing a testbed to explore fault-tolerant quantum computation protocols that combine high-rate quantum codes with the structural advantages of color codes.
arXiv:2609.16125 [quant-ph]
(or arXiv:2609.16125v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2609.16125 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 300 words
Related coverage

Researchers Build Colour Codes with Polynomial Error Correction
Quantum Zeitgeist · Sep 19, 2026

Lattice-Based Cryptography Explained
Quantum Zeitgeist · Aug 15, 2026

Hyperbolic codes could quadruple efficiency of quantum error correction
Quantum Zeitgeist · Oct 13, 2026

NVIDIA Ising Decoding Cuts Color Code Logical Error Rates by Over 300x
NVIDIA · Jul 13, 2026