Back to News
quantum-computing

Distributed Hyperbolic Floquet Codes under Depolarizing and Erasure Noise

arXiv Quantum Physics
Loading...
3 min read
0 likes
⚡ Quantum Brief
Aygul Azatovna Galimova introduces new distributed hyperbolic Floquet codes using {8,3}, {10,3}, and {12,3} tessellations, marking the first application of {10,3} and {12,3} families in this context. These codes leverage weight-2 measurements for scalable quantum error correction. The study employs Wythoff kaleidoscopic construction and the LINS algorithm to partition codes across quantum processing units via spectral bisection, enabling modular quantum computing architectures beyond monolithic designs. Under depolarizing noise (0.03% local error), fine-grained codes achieve pseudo-thresholds of 3.0% for {8,3} and {10,3}, and 1.75% for {12,3}, demonstrating resilience in distributed settings. Correlated EM3 and SDEM3 noise models yield lower thresholds (0.5–1.75%), while erasure noise—relevant to spin-optical systems—shows high tolerance (25–40% thresholds at 1% local loss). This work advances fault-tolerant quantum computing by validating hyperbolic codes’ performance under diverse noise conditions, offering a path toward scalable, distributed quantum error correction.
Distributed Hyperbolic Floquet Codes under Depolarizing and Erasure Noise

Summarize this article with:

Quantum Physics arXiv:2602.17969 (quant-ph) [Submitted on 20 Feb 2026] Title:Distributed Hyperbolic Floquet Codes under Depolarizing and Erasure Noise Authors:Aygul Azatovna Galimova View a PDF of the paper titled Distributed Hyperbolic Floquet Codes under Depolarizing and Erasure Noise, by Aygul Azatovna Galimova View PDF HTML (experimental) Abstract:Distributing qubits across quantum processing units (QPUs) connected by shared entanglement enables scaling beyond monolithic architectures. Hyperbolic Floquet codes use only weight-2 measurements and are good candidates for distributed quantum error correcting codes. We construct hyperbolic and semi-hyperbolic Floquet codes from $\{8,3\}$, $\{10,3\}$, and $\{12,3\}$ tessellations via the Wythoff kaleidoscopic construction with the Low-Index Normal Subgroups (LINS) algorithm and distribute them across QPUs via spectral bisection. The $\{10,3\}$ and $\{12,3\}$ families are new to hyperbolic Floquet codes. We simulate these distributed codes under four noise models: depolarizing, SDEM3, correlated EM3, and erasure. With depolarizing noise ($p_{\text{local}} = 0.03\%$), fine-grained codes achieve non-local pseudo-thresholds up to 3.0\% for $\{8,3\}$, 3.0\% for $\{10,3\}$, and 1.75\% for $\{12,3\}$. Correlated EM3 yields pseudo-thresholds up to 0.75\% for $\{8,3\}$, 0.75\% for $\{10,3\}$, and 0.50\% for $\{12,3\}$; crossing-based thresholds from same-$k$ families are ${\sim}1.75$--$2.9\%$ across all tessellations. Using the SDEM3 model, fine-grained codes achieve distributed pseudo-thresholds of 1.75\% for $\{8,3\}$, 1.25\% for $\{10,3\}$, and 1.00\% for $\{12,3\}$. Under erasure noise motivated by spin-optical architectures, thresholds at 1\% local loss are 35--40\% for $\{8,3\}$, 30--35\% for $\{10,3\}$, and 25--30\% for $\{12,3\}$. Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2602.17969 [quant-ph] (or arXiv:2602.17969v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2602.17969 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Aygul Galimova [view email] [v1] Fri, 20 Feb 2026 03:55:23 UTC (18 KB) Full-text links: Access Paper: View a PDF of the paper titled Distributed Hyperbolic Floquet Codes under Depolarizing and Erasure Noise, by Aygul Azatovna GalimovaView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-02 References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) Links to Code Toggle Papers with Code (What is Papers with Code?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Read Original

Tags

quantum-hardware
quantum-error-correction

Source Information

Source: arXiv Quantum Physics