Erasure Thresholds for Hyperbolic and Semi-Hyperbolic Surface Codes
Aygul Azatovna Galimova

TL;DR
This paper extends erasure noise models to hyperbolic surface codes, demonstrating that they maintain an erasure advantage with thresholds up to 4.7%, similar to planar codes, under various noise models.
Contribution
It introduces a generalized noise model for hyperbolic surface codes and quantifies their erasure thresholds, showing they outperform Pauli noise ratios similar to planar codes.
Findings
Hyperbolic codes achieve thresholds up to 4.7%.
Erasure-to-Pauli ratios are consistent with surface code values.
Erasure advantage extends to hyperbolic surface codes.
Abstract
We extend the circuit-level erasure noise model and Wang et al.\ quadratic expansion fitting of Chang et al.\ from planar surface codes to hyperbolic CSS surface codes. Under Chang et al.'s noise models, the Bolza fine-grained family threshold reaches under the general-Pauli models (which coincide at temporal resolution ) and under the tailored spatially perfect model at (pure erasure). The corresponding erasure-to-Pauli ratios ( and ) match the surface code values to within . Per-observable crossing-point analysis at (Models 1--3) independently yields an erasure-to-Pauli ratio of . These results establish that the erasure advantage extends to hyperbolic codes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications · Advanced Data Storage Technologies · Coding theory and cryptography
