arXiv:2610.10948
Geometry-optimized hyperbolic codes for modular fault-tolerant quantum architectures
Ahmed Adel Mahmoud, Steven Rayan
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.
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