Constructions and Performance of Hyperbolic and Semi-Hyperbolic Floquet Codes
summary
Constructs Floquet codes from colour-code hyperbolic tilings and a fine-grained semi-hyperbolic family, yielding weight-two checks and degree‑three connectivity that decode with minimum‑weight perfect matching. Claims semi‑hyperbolic instances give √n distance scaling via fine‑graining and, under an EM3 pair‑measurement noise model, show up to ~48× improvement over planar honeycomb codes (over 100× vs surface‑code compilations) and a teraquop footprint as low as 32 physical qubits per logical qubit at 0.1% noise. Includes a 16‑qubit Bolza instance encoding four logical qubits and proposes biplanar/modular implementations.
AI-written summary · about
chapters (17)
- 0:00Hyperbolic Floquet codes intro
- 1:29LDPC codes in quantum error correction
- 3:37Hyperbolic surface code challenges
- 5:44Hyperbolic codes with Floquet circuits
- 7:08Floquet codes overview
- 11:26Hyperbolic Floquet code construction
- 13:54Distance in hyperbolic Floquet codes
- 15:30Bolza Floquet code example
- 16:55Logarithmic distance limitations
- 18:01Semi-hyperbolic Floquet codes
- 20:13Honeycomb vs hyperbolic codes
- 21:44Noise model simulations
- 24:17Hardware hyperbolic connectivity
- 27:11Recent LDPC code work
- 28:19Future directions and gates
- 29:25Conclusion
- 30:07Q&A on distances
