Ladder Floquet code[1]
Description
Floquet code defined on a ladder qubit geometry, with one qubit per vertex. The check operators consist of \(ZZ\) checks on each rung and alternating \(XX\) and \(YY\) check on the legs.Decoding
Period-four measurement sequence utilizing two-qubit measurements [1].Cousin
- \([[4,2,2]]\) Four-qubit code— The smallest example of the ladder Floquet code is a dynamical version of the \([[4,2,2]]\) code [2,3]. The \([[4,2,2]]\) can be Floquetified in various ways [4,5].
Primary Hierarchy
Parents
The ladder Floquet code is the first 1D Floquet code.
Ladder Floquet code
References
- [1]
- M. B. Hastings and J. Haah, “Dynamically Generated Logical Qubits”, Quantum 5, 564 (2021) arXiv:2107.02194 DOI
- [2]
- Arpit Dua, “Subsystem Codes”, (2022) DOI
- [3]
- V. V. Albert, Boulder School 2023 Lecture notes
- [4]
- A. Townsend-Teague, J. Magdalena de la Fuente, and M. Kesselring, “Floquetifying the Colour Code”, Electronic Proceedings in Theoretical Computer Science 384, 265 (2023) arXiv:2307.11136 DOI
- [5]
- B. Rodatz, B. Poór, and A. Kissinger, “Floquetifying stabiliser codes with distance-preserving rewrites”, (2024) arXiv:2410.17240
Page edit log
- Victor V. Albert (2024-06-07) — most recent
Cite as:
“Ladder Floquet code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2024. https://errorcorrectionzoo.org/c/ladder