University of Saskatchewan Researchers Achieve Record Hyperbolic Surface Code Efficiency for Modular Fault-Tolerant Architectures

In a research paper published on arXiv, researchers Ahmed Adel Mahmoud and Dr. Steven Rayan from the Centre for Quantum Topology and Its Applications (quanTA) at the University of Saskatchewan have demonstrated explicit finite families of geometry-optimized hyperbolic surface codes that attain the optimal efficiency scaling limit set by Delfosse’s bound (η = kd²/n ∝ (log k)²).

By embedding quantum low-density parity-check (qLDPC) interactions onto compactified hyperbolic surfaces and optimizing periodic boundary conditions, the team doubled code distance and quadrupled efficiency without increasing qubit counts or check weights. Among the discovered families, the optimal {6, 6} code [[51330, 17112, 10]] encodes 17,112 logical qubits into 51,330 physical qubits with a record efficiency of η ≈ 33.34—a 33-fold gain over standard 2D toric codes.

To address physical hardware limits, the authors created a compiler that partitions these codes into planar modules of 80 or fewer qubits per chip. Circuit-level simulations under an SI1000-like noise model showed robust thresholds of approximately 0.22%, holding at 0.17% even when inter-module CNOT error rates were tripled.

What This Discovery Means in Plain English