Planar Floquet Codes
arXiv:2110.05348
Abstract
A protocol called the "honeycomb code", or generically a "Floquet code", was introduced by Hastings and Haah in \cite{hastings_dynamically_2021}. The honeycomb code is a subsystem code based on the honeycomb lattice with zero logical qubits but such that there exists a schedule for measuring two-body gauge checks leaving enough room at all times for two protected logical qubits. In this work we show a way to introduce boundaries to the system which curiously presents a rotating dynamics but has constant distance and is therefore not fault-tolerant.
arXiv comment16 pages, 14 figures, 1 table
References in corpus (12)
- Fault-tolerant quantum computation by anyons
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Anyons in an exactly solved model and beyond
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Topological Quantum Distillation
- Instantaneous non-local computation of low T-depth quantum circuits
- The Heisenberg Representation of Quantum Computers
- Quantum codes on a lattice with boundary
- A Fault-Tolerant Honeycomb Memory
- Calibrated decoders for experimental quantum error correction
- Constructions and Noise Threshold of Topological Subsystem Codes
- Generalized surface codes and packing of logical qubits