Papers › A Systematic Approach to Hyperbolic Quantum Error Correction Codes
A Systematic Approach to Hyperbolic Quantum Error Correction Codes
Ahmed Adel Mahmoud, Kamal Mohamed Ali, Steven Rayan
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Quantum error correction codes defined on hyperbolic lattices leverage the unique geometric properties of the hyperbolic space to enhance the performance of quantum error correction. By embedding qubits in hyperbolic lattices, these codes achieve higher encoding rates and lower qubit overhead compared to those defined on conventional Euclidean lattices. Building on recent advances in hyperbolic crystallography, we introduce a unified framework for the systematic construction and scalable benchmarking of CSS quantum error correction codes on hyperbolic lattices. A central component of this framework is the Hyperbolic Cycle Basis algorithm, which employs graph-theoretic methods to efficiently identify all plaquette cycles (parity-check supports) and nontrivial cycles (logical operators). This enables scalable and automated benchmarking of a broad class of CSS codes defined on hyperbolic geometries. We apply this framework to construct and simulate two representative hyperbolic quantum error correction codes (HQECCs), evaluating key performance metrics such as encoding rate, error threshold, and code distance for different sublattices. While HQECCs serve as concrete examples, the framework can be adapted to a wide range of CSS codes, including those with more intricate stabilizer structures such as Floquet codes. This work establishes a foundation for systematic exploration and benchmarking of CSS codes on hyperbolic lattices, paving the way toward practical, high-performance quantum error correction.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections