Hyperbolic and Semi-Hyperbolic Floquet Codes for Photonic Quantum Computing
Aygul Azatovna Galimova

TL;DR
This paper introduces new hyperbolic Floquet codes suitable for photonic quantum computing, demonstrating their thresholds under various noise models and showing advantages over traditional codes in certain scenarios.
Contribution
The authors construct novel hyperbolic and semi-hyperbolic Floquet codes from specific tessellations, evaluate their performance under multiple noise models, and establish the first photon loss and SPOQC-2 thresholds for these codes.
Findings
All code families achieve ~1.5% threshold under EM3 noise.
The {8,3} code exceeds planar honeycomb photon loss threshold (~8.5-9%).
The {8,3} codes outperform surface codes in fault-tolerant area in SPOQC-2 model.
Abstract
Hyperbolic Floquet codes use only weight-2 measurements and can be implemented directly on hardware with native pair measurements. We construct hyperbolic and semi-hyperbolic Floquet codes from , , and tessellations via the Wythoff kaleidoscopic construction with the Low-Index Normal Subgroups (LINS) algorithm. The and families are new to hyperbolic Floquet codes. We evaluate these codes under four noise models. Under ancilla-based Entangling Measurement (EM3) noise, all three families achieve a threshold of . With a native pair-measurement depolarizing model (SDEM3), thresholds are --. For heralded photon loss, the family achieves --, exceeding the planar honeycomb threshold of . In the multi-parameter SPOQC-2 noise model, the codes achieve a 2D…
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
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Neural Networks and Reservoir Computing
