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:1301.6588 · IEEE International Symposium on Information Theory (ISIT)

Tradeoffs for reliable quantum information storage in surface codes and color codes

Nicolas Delfosse

Published Jul 1, 2013• 60 citations
arXivHTMLPDF

Abstract

The family of hyperbolic surface codes is one of the rare families of quantum LDPC codes with non-zero rate and unbounded minimum distance. First, we introduce a family of hyperbolic color codes. This produces a new family of quantum LDPC codes with non-zero rate and with minimum distance logarithmic in the blocklength. Second, we show that the parameters [[n, k, d]] of surface codes and color codes satisfy kd2≤ C(log k)2n, where C is a constant that depends only on the row weight of the parity-check matrix. Our results prove that the best asymptotic minimum distance of LDPC surface codes and color codes with non-zero rate is logarithmic in the length.

DOI
10.1109/isit.2013.6620360

Related papers

Hyperbolic quantum color codes

Waldir Silva Soares, Eduardo Brandani da Silva

Current work presents a new approach to quantum color codes on compact surfaces with genus g\geq2 using the identification of these surfaces with hyperbolic polygons and hyperbolic tessellations. We show that this method may give rise to color codes with a very good parameters and we present tables with several examples of these codes whose parameters had not been shown before. We also present a family of codes with minimum distance d=4 and the encoding rate asymptotically going to 1 while n\rightarrow\infty.

arXiv:1804.06382•Quantum Information and Computation•Mar 1, 2018•10 citations

Hyperbolic color codes with constant rate and polynomial distance

Shun Hasegawa, Hayata Yamasaki

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.

quant-pharXiv:2609.16125•Sep 16, 2026•0 citations

Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength

Jean–Pierre Tillich, Gilles Zémor

The current best asymptotic lower bound on the minimum distance of quantum LDPC codes with a fixed non-zero rate is logarithmic in the blocklength. We propose a construction of quantum LDPC codes with fixed non-zero rate and prove that the minimum distance grows proportionally to the square root of the blocklength.

arXiv:0903.0566•IEEE Transactions on Information Theory•Jan 24, 2014•423 citations

Quantum LDPC codes with positive rate and minimum distance proportional to n½

Jean–Pierre Tillich, Gilles Zémor

The current best asymptotic lower bound on the minimum distance of quantum LDPC codes with fixed non-zero rate is logarithmic in the block length. We build quantum LDPC codes with fixed non-zero rate and prove that their minimum distance grows proportionally to the square root of the block length.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2009•54 citations

Geometry-optimized hyperbolic codes for modular fault-tolerant quantum architectures

Ahmed Adel Mahmoud, Steven Rayan

Quantum fault tolerance is a prerequisite to harness the full potential of quantum computers. However, achieving fault tolerance remains a major challenge since it requires optimizing tradeoffs between several intertwined theoretical and experimental parameters, including the encoding rate, code distance, parity-check weights, code planarity, and routing. Surface codes remain strong candidates for fault tolerance due to their simple geometric structure, established decoding methods, locality, and experimental attainability. In this work, we present finite families of hyperbolic surface codes that leverage the optimal efficiency scaling $kd^2/n = C (\log{k})^2$ attainable by surface codes with bounded local geometry. We show that optimizing the periodic identifications can double the code distance and thereby increase the code's efficiency by a factor of four, at fixed qubit count, encoding rate, and parity-check weight. We also address the routing problem of hyperbolic surface codes by introducing a topology-aware algorithm that partitions a hyperbolic code into bounded planar modules while reducing long-range communications demand. Circuit-level Monte Carlo simulations yield finite-size threshold estimates for both modular and monolithic layouts, showing that tripling the long-range gate error probability mildly lowers, but does not eliminate, the estimated error-correction thresholds. Together, these results strengthen the case for hyperbolic surface codes as structured and highly efficient large-scale quantum error correction codes for future fault-tolerant architectures.

quant-pharXiv:2610.10948•Oct 9, 2026•0 citations

Construction of New Quantum Color Codes

Avaz Naghipour, Duc Manh Nguyen

Abstract This paper presents a hyperbolic geometry approach to the construction of new quantum color codes. The families of quantum color codes are constructed based on the identification of compact surfaces by hyperbolic tessellations. Codes of these families have 4 and 6 minimum distances and their encoding rate are near to 1. We also provide some quantum color codes with minimum distance of at least eight and a comparison table of quantum codes.

Quantum Physics Letters•Dec 1, 2022•0 citations
The family of hyperbolic surface codes is one of the rare families of quantum LDPC codes with non-zero rate and unbounded minimum distance. First, we introduce a family of hyperbolic color codes. This produces a new family of quantum LDPC codes with non-zero rate and with minimum distance logarithmic in the blocklength. Second, we show that the parameters [[n, k, d]] of surface codes and color codes satisfy kd2≤ C(log k)2n, where C is a constant that depends only on the row weight of the parity-check matrix. Our results prove that the best asymptotic minimum distance of LDPC surface codes and color codes with non-zero rate is logarithmic in the length.
Current work presents a new approach to quantum color codes on compact surfaces with genus g\geq2 using the identification of these surfaces with hyperbolic polygons and hyperbolic tessellations. We show that this method may give rise to color codes with a very good parameters and we present tables with several examples of these codes whose parameters had not been shown before. We also present a family of codes with minimum distance d=4 and the encoding rate asymptotically going to 1 while n\rightarrow\infty.
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≥4D\geq 4D≥4. In even dimensions, the resulting type-D/2D/2D/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.
Quantum fault tolerance is a prerequisite to harness the full potential of quantum computers. However, achieving fault tolerance remains a major challenge since it requires optimizing tradeoffs between several intertwined theoretical and experimental parameters, including the encoding rate, code distance, parity-check weights, code planarity, and routing. Surface codes remain strong candidates for fault tolerance due to their simple geometric structure, established decoding methods, locality, and experimental attainability. In this work, we present finite families of hyperbolic surface codes that leverage the optimal efficiency scaling kd2/n=C(log⁡k)2kd^2/n = C (\log{k})^2kd2/n=C(logk)2 attainable by surface codes with bounded local geometry. We show that optimizing the periodic identifications can double the code distance and thereby increase the code's efficiency by a factor of four, at fixed qubit count, encoding rate, and parity-check weight. We also address the routing problem of hyperbolic surface codes by introducing a topology-aware algorithm that partitions a hyperbolic code into bounded planar modules while reducing long-range communications demand. Circuit-level Monte Carlo simulations yield finite-size threshold estimates for both modular and monolithic layouts, showing that tripling the long-range gate error probability mildly lowers, but does not eliminate, the estimated error-correction thresholds. Together, these results strengthen the case for hyperbolic surface codes as structured and highly efficient large-scale quantum error correction codes for future fault-tolerant architectures.