Quick Navigation
Topics
Quantum Error Correction Fault Tolerance
Quantum Machine Learning
Entanglement Theory Quantum Correlations
Distributed Hyperbolic Floquet Codes under Depolarizing and Erasure Noise
arXiv
Authors: Aygul Azatovna Galimova
Year
2026
Paper ID
10348
Status
Preprint
Abstract Read
~2 min
Abstract Words
159
Citations
N/A
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 $plocal = 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\}.
Why This Paper Matters
- This paper contributes to the Quantum Machine Learning research area in the Quantum Articles archive.
- It adds a 2026 reference point for readers tracking recent quantum research.
- Distributing qubits across quantum processing units (QPUs) connected by shared entanglement enables scaling beyond monolithic architectures.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.