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

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

Ahmed Adel Mahmoud, Steven Rayan

quant-phmath-phSubmitted Oct 7, 2026• Announced Oct 9, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

AI Summary

The paper asks how periodic identifications and hardware partitioning affect the efficiency and implementability of hyperbolic surface-code memories. It exhaustively searches a restricted class of closed, self-dual $\{p,p\}$ codes with prime-field $\operatorname{PSL}(2,q)$ quotients, $p\in\{5,6,7,8\}$ and $q<60$, obtaining 38 algebraic classes and computing their homological distances. The largest efficiency $\eta=kd^2/n$ found is $33.34$ for a weight-six $[[51330,17112,10]]$ code; a weight-five instance has parameters $[[51330,10268,12]]$. Different identifications at fixed tiling and quotient size can change distance from four to eight, quadrupling $\eta$ without changing qubit count or check weight. Selected four- and five-instance sequences exhibit growth consistent with the surface-code bound $\eta=O((\log k)^2)$; this is finite-size evidence, not an asymptotic construction guarantee. A heuristic topology-aware compiler partitions codes into connected planar modules of at most 80 data-plus-ancilla qubits. All 20 tested layouts satisfy the capacity and geometry constraints. Communication improves over tested load-feasible spectral partitions, while Mt-KaHyPar obtains fewer remote interactions but fails some geometric constraints. Circuit-level simulations with correlated matching evaluate one selected logical $Z$ memory over four weight-five code sizes. Tripling remote-CNOT error probabilities lowers estimated crossings from $0.22\%$ to $0.17\%$ for modular layouts and $0.18\%$ for monolithic layouts. Circuit-fault distances are $4,5,7,8$, below homological distances $6,8,10,12$. Remote gates are effective noisy CNOTs: link-generation, routing latency and port overheads are not modeled. Thresholds are finite-size estimates, and logical-gate integration remains future work.

Little sign of AI-generated textOverclaimsStrong assumptions

Central claim may not hold: The reported finite-size fits support consistency with optimal logarithmic-squared efficiency growth, but do not establish that the constructed codes attain this scaling asymptotically, as the abstract's wording can suggest.

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

Comments
14 pages, 6 figures, 4 tables

Related papers

Low-Overhead Quantum Error Correction with Boundary-Connected Planar Modules

Oscar Higgott, Hasan Sayginel, Francisco J. H. Heras +11 more

Realizing practical quantum computers requires quantum error correction, but the most widely implemented approach, the planar surface code, demands a substantial physical qubit overhead. Here, we demonstrate that partitioning quantum processors into manageable, flat modules with non-local inter-module connections provides a natural solution. By wiring sparse, static boundary connections between Euclidean planar modules, we construct modular hyperbolic surface and color codes, based on new families of semi-hyperbolic codes. Using modular syndrome extraction circuits and efficient neural network and matching decoders, our circuit-level simulations show that this modular memory design can reduce the physical qubit overhead by tenfold or more compared to the surface code, even under elevated inter-module seam error rates. Projecting to larger system sizes, we find modular codes with encoding rate $k/n=1/16$ and distance $d\geq 22$, exceeding both the rate and distance of the $[[288,12,18]]$ two-gross bivariate bicycle code while using mostly nearest-neighbor gates within planar modules, and implying an over $30\times$ overhead reduction relative to surface codes. We develop fault-tolerant walking circuits for implementing logic via code automorphisms, which we co-design with low-weight, highly symmetrical logical bases and a modular extractor system that is $\approx 4.5\times$ smaller than the code itself. Combining these methods, our modular memory can be used as dense storage in a universal fault-tolerant architecture, unlocking the efficiency of high-rate codes without sacrificing the fabrication advantages of planar modules.

quant-pharXiv:2610.03682•Oct 5, 2026•3 citations

Fault-tolerant hyperbolic Floquet quantum error correcting codes

Ali Fahimniya, Hossein Dehghani, Kishor Bharti +4 more

A central goal in quantum error correction is to reduce the overhead of fault-tolerant quantum computing by increasing noise thresholds and reducing the number of physical qubits required to sustain a logical qubit. We introduce a potential path towards this goal based on a family of dynamically generated quantum error correcting codes that we call "hyperbolic Floquet codes.'' These codes are defined by a specific sequence of non-commuting two-body measurements arranged periodically in time that stabilize a topological code on a hyperbolic manifold with negative curvature. We focus on a family of lattices for n qubits that, according to our prescription that defines the code, provably achieve a finite encoding rate ( 1 / 8 + 2 / n ) while still requiring only two-body measurements. Similar to hyperbolic surface codes, the distance of the code at each time-step scales at most logarithmically in n . The family of lattices we choose indicates that this scaling is achievable in practice. We develop and benchmark an efficient matching-based decoder that provides evidence of a threshold near 0.1% in a phenomenological noise model and 0.25% in an entangling measurements noise model. Utilizing weight-two check operators and a qubit connectivity of 3, one of our hyperbolic Floquet codes uses 400 physical qubits to encode 52 logical qubits with a code distance of 8, i.e., it is a [ [ 400 , 52 , 8 ] ] code. At small error rates, comparable logical error suppression to this code requires 5x as many physical qubits (1924) when using the honeycomb Floquet code with the same noise model and decoder.

arXiv:2309.10033•Quantum•Sep 5, 2025•34 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

Lower overhead fault-tolerant building blocks for noisy quantum computers

Prithviraj Prabhu

Quantum computation holds the promise of solving certain complex problems exponentially faster than classical computers. However, the high prevalent noise in current quantum devices impedes the accurate execution of even basic algorithms. This can be remedied by protecting quantum information with a quantum error-correcting code, where the logical information of an algorithmic qubit is spread across multiple physical qubits. Individual quantum errors are then located and corrected by the fault-tolerant measurement of multi-qubit stabilizer operators (parity checks). Unfortunately, error correction and fault tolerance both impose large demands on the qubit overhead: hundreds to thousands of physical qubits per logical qubit. We reduce the spacetime cost of fault tolerance by redesigning key building blocks of an error-corrected quantum computer. First, we develop a combinatorial proof with flag fault tolerance that exponentially reduces the extra qubits needed to measure a stabilizer of any size, while tolerating one fault. We leverage these proofs to then design state preparation circuits for the Steane and Golay codes with 100% yield. Next, we improve error correction on a planar layout by showing that a distance-four code encoding six logical qubits protects information as well as the distance-five surface code, using one-tenth as many physical qubits. Finally, we optimize the time overhead of logical gates in surface code quantum computers by protecting measurement results with a classical code, cutting computation time by a factor of two to six. Our hardware-agnostic optimizations of fault tolerance overheads thus suggest new routes to advance the timeline of error-free quantum computing.

quant-pharXiv:2605.12385•May 13, 2026•0 citations

Hyperbolic Quantum Error Correction in Mycelial Networks: Beyond Planar Toric Codes

Zubair E Chowdhury

While planar toric codes provide fault tolerant quantum memory on flat two dimensional surfaces, mycelial networks naturally grow in hyperbolic three dimensional architectures with negative curvature. We extend bio topological quantum memory theory to hyperbolic surface codes, demonstrating four critical advantages. First, exponentially increased stabiliser to qubit ratios emerge from hyperbolic growth geometry. Second, code distances scale as exponential functions of radius rather than linear functions seen in planar codes. Third, error thresholds exceed two per cent compared to approximately one per cent for toric codes. Fourth, natural fault tolerance arises through geometric redundancy inherent to hyperbolic tessellations. Mycelial networks in Basidiomycota exhibit hyperbolic branching patterns that map directly to hyperbolic tessellations such as seven triangle and eight triangle tilings. Physical qubits encoded at junction points form logical qubits protected by genus g surface codes, where network topology determines code parameters. We calculate threshold improvements for code distances three, five, and seven in hyperbolic geometries and demonstrate thermodynamic syndrome extraction remains viable despite increased connectivity. This framework suggests room temperature quantum computing may achieve superior error correction by exploiting biological hyperbolic geometries rather than engineered planar architectures. Combined with recent experimental validation of mycelial bioelectronics at ambient temperatures, hyperbolic codes may provide the geometric advantage necessary to cross error correction thresholds that remain inaccessible to planar implementations.

•Dec 20, 2025•0 citations

Fault-tolerant quantum computing with three-dimensional surface codes

Michael Vasmer

Quantum computers are far more error-prone than their classical counterparts. Therefore, to build a quantum computer capable of running large-scale quantum algorithms, we must use the techniques of quantum error correction to ensure that the computer produces the correct output even when its components are unreliable. However, the resource requirements of building such a fault-tolerant quantum computer are currently prohibitive. Here, we examine the utility of using three-dimensional (3D) surface codes in a fault-tolerant quantum computer. This family of topological error-correcting codes is a generalization of the well-known 2D surface code to three spatial dimensions. We show that certain 3D surface codes have a transversal logical non-Clifford gate. In a quantum computing architecture, a non-Clifford gate is required to achieve computational universality. Transversal gates do not entangle qubits in different codes, so they are naturally fault tolerant because they do not spread errors. Next, we consider the problem of decoding 3D surface codes. In a quantum error-correcting code, we cannot observe the qubits directly, so we measure parity-check operators to gain information about the state of the code. Decoding is the problem of estimating what error has occurred given a list of unsatisfied parity checks. We observe that 3D surface codes offer asymmetric protection against bit-flip and phase-flip errors, but in both cases, we find that a threshold error rate exists below which we can suppress logical errors by increasing the size of the code. We use our results about logical gates and decoding to propose two fault-tolerant quantum computing architectures that utilize 3D surface codes. Finally, we compare the resource requirements of our architectures with the requirements of leading quantum computing architectures based on topological codes. We find that one of our architectures may be competitive with the leading architectures, depending on the properties of the physical systems used to build the qubits.

•Dec 28, 2019•3 citations
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.
The paper asks how periodic identifications and hardware partitioning affect the efficiency and implementability of hyperbolic surface-code memories. It exhaustively searches a restricted class of closed, self-dual {p,p}\{p,p\}{p,p} codes with prime-field PSL⁡(2,q)\operatorname{PSL}(2,q)PSL(2,q) quotients, p∈{5,6,7,8}p\in\{5,6,7,8\}p∈{5,6,7,8} and q<60q<60q<60, obtaining 38 algebraic classes and computing their homological distances.
The largest efficiency η=kd2/n\eta=kd^2/nη=kd2/n found is 33.3433.3433.34 for a weight-six [[51330,17112,10]][[51330,17112,10]][[51330,17112,10]] code; a weight-five instance has parameters [[51330,10268,12]][[51330,10268,12]][[51330,10268,12]]. Different identifications at fixed tiling and quotient size can change distance from four to eight, quadrupling η\etaη without changing qubit count or check weight. Selected four- and five-instance sequences exhibit growth consistent with the surface-code bound η=O((log⁡k)2)\eta=O((\log k)^2)η=O((logk)2); this is finite-size evidence, not an asymptotic construction guarantee.
A heuristic topology-aware compiler partitions codes into connected planar modules of at most 80 data-plus-ancilla qubits. All 20 tested layouts satisfy the capacity and geometry constraints. Communication improves over tested load-feasible spectral partitions, while Mt-KaHyPar obtains fewer remote interactions but fails some geometric constraints.
Circuit-level simulations with correlated matching evaluate one selected logical ZZZ memory over four weight-five code sizes. Tripling remote-CNOT error probabilities lowers estimated crossings from 0.22%0.22\%0.22% to 0.17%0.17\%0.17% for modular layouts and 0.18%0.18\%0.18% for monolithic layouts. Circuit-fault distances are 4,5,7,84,5,7,84,5,7,8, below homological distances 6,8,10,126,8,10,126,8,10,12. Remote gates are effective noisy CNOTs: link-generation, routing latency and port overheads are not modeled. Thresholds are finite-size estimates, and logical-gate integration remains future work.
Realizing practical quantum computers requires quantum error correction, but the most widely implemented approach, the planar surface code, demands a substantial physical qubit overhead. Here, we demonstrate that partitioning quantum processors into manageable, flat modules with non-local inter-module connections provides a natural solution. By wiring sparse, static boundary connections between Euclidean planar modules, we construct modular hyperbolic surface and color codes, based on new families of semi-hyperbolic codes. Using modular syndrome extraction circuits and efficient neural network and matching decoders, our circuit-level simulations show that this modular memory design can reduce the physical qubit overhead by tenfold or more compared to the surface code, even under elevated inter-module seam error rates. Projecting to larger system sizes, we find modular codes with encoding rate k/n=1/16k/n=1/16k/n=1/16 and distance d≥22d\geq 22d≥22, exceeding both the rate and distance of the [[288,12,18]][[288,12,18]][[288,12,18]] two-gross bivariate bicycle code while using mostly nearest-neighbor gates within planar modules, and implying an over 30×30\times30× overhead reduction relative to surface codes. We develop fault-tolerant walking circuits for implementing logic via code automorphisms, which we co-design with low-weight, highly symmetrical logical bases and a modular extractor system that is ≈4.5×\approx 4.5\times≈4.5× smaller than the code itself. Combining these methods, our modular memory can be used as dense storage in a universal fault-tolerant architecture, unlocking the efficiency of high-rate codes without sacrificing the fabrication advantages of planar modules.
A central goal in quantum error correction is to reduce the overhead of fault-tolerant quantum computing by increasing noise thresholds and reducing the number of physical qubits required to sustain a logical qubit. We introduce a potential path towards this goal based on a family of dynamically generated quantum error correcting codes that we call "hyperbolic Floquet codes.'' These codes are defined by a specific sequence of non-commuting two-body measurements arranged periodically in time that stabilize a topological code on a hyperbolic manifold with negative curvature. We focus on a family of lattices for n qubits that, according to our prescription that defines the code, provably achieve a finite encoding rate ( 1 / 8 + 2 / n ) while still requiring only two-body measurements. Similar to hyperbolic surface codes, the distance of the code at each time-step scales at most logarithmically in n . The family of lattices we choose indicates that this scaling is achievable in practice. We develop and benchmark an efficient matching-based decoder that provides evidence of a threshold near 0.1% in a phenomenological noise model and 0.25% in an entangling measurements noise model. Utilizing weight-two check operators and a qubit connectivity of 3, one of our hyperbolic Floquet codes uses 400 physical qubits to encode 52 logical qubits with a code distance of 8, i.e., it is a [ [ 400 , 52 , 8 ] ] code. At small error rates, comparable logical error suppression to this code requires 5x as many physical qubits (1924) when using the honeycomb Floquet code with the same noise model and decoder.
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 computation holds the promise of solving certain complex problems exponentially faster than classical computers. However, the high prevalent noise in current quantum devices impedes the accurate execution of even basic algorithms. This can be remedied by protecting quantum information with a quantum error-correcting code, where the logical information of an algorithmic qubit is spread across multiple physical qubits. Individual quantum errors are then located and corrected by the fault-tolerant measurement of multi-qubit stabilizer operators (parity checks). Unfortunately, error correction and fault tolerance both impose large demands on the qubit overhead: hundreds to thousands of physical qubits per logical qubit. We reduce the spacetime cost of fault tolerance by redesigning key building blocks of an error-corrected quantum computer. First, we develop a combinatorial proof with flag fault tolerance that exponentially reduces the extra qubits needed to measure a stabilizer of any size, while tolerating one fault. We leverage these proofs to then design state preparation circuits for the Steane and Golay codes with 100% yield. Next, we improve error correction on a planar layout by showing that a distance-four code encoding six logical qubits protects information as well as the distance-five surface code, using one-tenth as many physical qubits. Finally, we optimize the time overhead of logical gates in surface code quantum computers by protecting measurement results with a classical code, cutting computation time by a factor of two to six. Our hardware-agnostic optimizations of fault tolerance overheads thus suggest new routes to advance the timeline of error-free quantum computing.
While planar toric codes provide fault tolerant quantum memory on flat two dimensional surfaces, mycelial networks naturally grow in hyperbolic three dimensional architectures with negative curvature. We extend bio topological quantum memory theory to hyperbolic surface codes, demonstrating four critical advantages. First, exponentially increased stabiliser to qubit ratios emerge from hyperbolic growth geometry. Second, code distances scale as exponential functions of radius rather than linear functions seen in planar codes. Third, error thresholds exceed two per cent compared to approximately one per cent for toric codes. Fourth, natural fault tolerance arises through geometric redundancy inherent to hyperbolic tessellations. Mycelial networks in Basidiomycota exhibit hyperbolic branching patterns that map directly to hyperbolic tessellations such as seven triangle and eight triangle tilings. Physical qubits encoded at junction points form logical qubits protected by genus g surface codes, where network topology determines code parameters. We calculate threshold improvements for code distances three, five, and seven in hyperbolic geometries and demonstrate thermodynamic syndrome extraction remains viable despite increased connectivity. This framework suggests room temperature quantum computing may achieve superior error correction by exploiting biological hyperbolic geometries rather than engineered planar architectures. Combined with recent experimental validation of mycelial bioelectronics at ambient temperatures, hyperbolic codes may provide the geometric advantage necessary to cross error correction thresholds that remain inaccessible to planar implementations.
Quantum computers are far more error-prone than their classical counterparts. Therefore, to build a quantum computer capable of running large-scale quantum algorithms, we must use the techniques of quantum error correction to ensure that the computer produces the correct output even when its components are unreliable. However, the resource requirements of building such a fault-tolerant quantum computer are currently prohibitive. Here, we examine the utility of using three-dimensional (3D) surface codes in a fault-tolerant quantum computer. This family of topological error-correcting codes is a generalization of the well-known 2D surface code to three spatial dimensions. We show that certain 3D surface codes have a transversal logical non-Clifford gate. In a quantum computing architecture, a non-Clifford gate is required to achieve computational universality. Transversal gates do not entangle qubits in different codes, so they are naturally fault tolerant because they do not spread errors. Next, we consider the problem of decoding 3D surface codes. In a quantum error-correcting code, we cannot observe the qubits directly, so we measure parity-check operators to gain information about the state of the code. Decoding is the problem of estimating what error has occurred given a list of unsatisfied parity checks. We observe that 3D surface codes offer asymmetric protection against bit-flip and phase-flip errors, but in both cases, we find that a threshold error rate exists below which we can suppress logical errors by increasing the size of the code. We use our results about logical gates and decoding to propose two fault-tolerant quantum computing architectures that utilize 3D surface codes. Finally, we compare the resource requirements of our architectures with the requirements of leading quantum computing architectures based on topological codes. We find that one of our architectures may be competitive with the leading architectures, depending on the properties of the physical systems used to build the qubits.