[Jump to code hierarchy]

Hyperbolic Floquet code [1–3]

Description

Floquet code whose check operators correspond to edges of a trivalent, face-3-colorable tiling of a closed hyperbolic surface, such as an \(\{8,3\}\) tessellation. Qubits sit on vertices, and each edge takes the color missing from its two adjacent faces. \(XX\), \(YY\), and \(ZZ\) checks are measured on the three edge colors in turn [2,4].

The product of the edge checks around a \(p\)-gon face is an inferred weight-\(p\) stabilizer, and a genus-\(g\) surface yields \(k=2g\) logical qubits [2,4]. Semi-hyperbolic Floquet codes are obtained by fine-graining, i.e., subdividing each triangle of the dual lattice into \(\ell^2\) triangles, which multiplies \(n\) by \(\ell^2\) while preserving \(k\) [2,4].

Protection

Code distance is at most \(O(\log n)\) due to the hyperbolic qubit geometry [1], but semi-hyperbolic lattices yield \(O(\sqrt{n})\) distance [2].

The embedded distance is the distance of the stabilizer code inside the subspace fixed by the outcomes of the weight-two checks [2]. It equals the minimum weight of a homologically nontrivial cycle or cocycle in the three restricted lattices, each obtained from the dual triangulation by deleting the vertices of one color [2,4]. Level-five fine-graining turns the 16-qubit, \(k=4\) Bolza-surface code with embedded distance two into a 400-qubit code with embedded distance seven [2,4].

Rate

Finite encoding rate whose value depends on the hyperbolic lattice. The asymptotic rate is \(1/8\) for \(\{8,3\}\) tessellations [3], and \(1/5\) and \(1/4\) for \(\{10,3\}\) and \(\{12,3\}\) tessellations [4].

Decoding

Syndrome structure allows for MWPM decoding [2,4].

Threshold

EM3 noise (correlated Pauli and measurement-flip errors on each pair measurement): \(1.5\%\) to \(2\%\) for semi-hyperbolic families on \(\{8,3\}\) tessellations [2], and \(\sim 1.5\%\) for semi-hyperbolic families on \(\{10,3\}\) and \(\{12,3\}\) tessellations [4].SDEM3 noise (EM3 with Pauli and measurement-flip errors sampled independently): \(1.0\%\) to \(1.2\%\) for semi-hyperbolic families on all three tessellations [4].SPOQC-2 heralded photon-loss model [5] with erasure-aware MWPM decoding: single-photon loss rate of \(8.5\%\) to \(9\%\) for the semi-hyperbolic \(\{8,3\}\) family [4]. The semi-hyperbolic \(\{10,3\}\) and \(\{12,3\}\) families reach \(7\%\) to \(8\%\) and \(6.5\%\) to \(8\%\), respectively [4].Phenomenological noise with depolarizing and measurement errors: \(0.1\%\) for \(\{8,3\}\) base codes [3], and \(1.0\%\) to \(1.3\%\) for semi-hyperbolic families on \(\{8,3\}\), \(\{10,3\}\), and \(\{12,3\}\) tessellations [4].

Notes

Performance in distributed settings is studied in Refs. [6,7].See Ref. [4; Tables 2 and 3] for parameters of explicit codes on \(\{8,3\}\), \(\{10,3\}\), and \(\{12,3\}\) tessellations and of their fine-grained variants.

Cousins

  • Honeycomb Floquet code— Hyperbolic Floquet codes are defined on hyperbolic color-code tilings in the same way that the honeycomb Floquet code, up to local Clifford gates, is defined on the 6.6.6 tiling [2].
  • 2D hyperbolic surface code— After the checks of one color are measured, the ISG of a hyperbolic Floquet code embeds a 2D hyperbolic surface code on the restricted lattice, obtained from the dual triangulation by deleting the vertices of that color [2]. For an \(\{8,3\}\) tiling, the restricted lattice is an \(\{8,4\}\) tessellation [2]. The fine-graining that yields semi-hyperbolic surface codes [8] also yields semi-hyperbolic Floquet codes [2].

References

  1. [1]

    C. Vuillot, “Planar Floquet Codes”, (2021) arXiv:2110.05348

  2. [2]

    O. Higgott and N. P. Breuckmann, “Constructions and Performance of Hyperbolic and Semi-Hyperbolic Floquet Codes”, PRX Quantum 5, (2024) arXiv:2308.03750 DOI

  3. [3]

    A. Fahimniya, H. Dehghani, K. Bharti, S. Mathew, A. J. Kollár, A. V. Gorshkov, and M. J. Gullans, “Fault-tolerant hyperbolic Floquet quantum error correcting codes”, Quantum 9, 1849 (2025) arXiv:2309.10033 DOI

  4. [4]

    A. A. Galimova, “Hyperbolic and Semi-Hyperbolic Floquet Codes for Photonic Quantum Computing”, (2026) arXiv:2602.22906

  5. [5]

    T. Dessertaine, B. Bourdoncle, A. Denys, G. de Gliniasty, P. C. d’Istria, G. Valentí-Rojas, S. Mansfield, and P. Hilaire, “Enhanced Fault-tolerance in Photonic Quantum Computing: Comparing the Honeycomb Floquet Code and the Surface Code in Tailored Architecture”, (2026) arXiv:2410.07065

  6. [6]

    E. Sutcliffe, B. Jonnadula, C. Le Gall, A. E. Moylett, and C. M. Westoby, “Distributed Quantum Error Correction Based on Hyperbolic Floquet Codes”, 2025 IEEE International Conference on Quantum Computing and Engineering (QCE) 649 (2025) arXiv:2501.14029 DOI

  7. [7]

    A. A. Galimova, “Distributed Hyperbolic Floquet Codes under Depolarizing and Erasure Noise”, (2026) arXiv:2602.17969

  8. [8]

    N. P. Breuckmann, C. Vuillot, E. Campbell, A. Krishna, and B. M. Terhal, “Hyperbolic and semi-hyperbolic surface codes for quantum storage”, Quantum Science and Technology 2, 035007 (2017) arXiv:1703.00590 DOI

Page edit log

Your contribution is welcome!

on github.com (edit & pull request)

— see instructions

Zoo Code ID: hyperbolic_floquet

Cite as:
“Hyperbolic Floquet code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/hyperbolic_floquet, arXiv:2606.11484
BibTeX:
@incollection{eczoo_hyperbolic_floquet,
title={Hyperbolic Floquet code},
booktitle={The Error Correction Zoo},
year={2026},
editor={Albert, Victor V. and Faist, Philippe},
eprint={2606.11484},
doi={10.48550/arXiv.2606.11484},
url={https://errorcorrectionzoo.org/c/hyperbolic_floquet}
}
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:
https://errorcorrectionzoo.org/c/hyperbolic_floquet

Cite as:

“Hyperbolic Floquet code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/hyperbolic_floquet, arXiv:2606.11484

Github: https://github.com/errorcorrectionzoo/eczoo_data/edit/main/codes/quantum/qubits/dynamic/floquet/hyperbolic_floquet.yml.