The code distance of Floquet codes
Abstract
For fault-tolerant quantum memory defined by periodic Pauli measurements, called Floquet codes, we prove that every correctable, undetectable spacetime error occurring during the steady stage is a product of (i) measurement operators inserted at the time of the measurement and (ii) pairs of identical Pauli operators sandwiching a measurement that commutes with the operator. We call such errors benign; they define a binary vector subspace of spacetime errors which properly generalize stabilizers of static Pauli stabilizer codes. Hence, the code distance of a Floquet code is the minimal weight of an undetectable spacetime Pauli error that is not benign. Our results apply more generally to families of dynamical codes for which every instantaneous stabilizer is inferred from measurements in a time interval of bounded length.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.