Quantum Error Correction with the Semion Code
Abstract
We present a full quantum error correcting procedure with the semion code: an off-shell extension of the double semion model. We construct open strings operators that recover the quantum memory from arbitrary errors and closed string operators that implement the basic logical operations for information processing. Physically, the new open string operators provide a detailed microscopic description of the creation of semions at their endpoints. Remarkably, topological properties of the string operators are determined using fundamental properties of the Hamiltonian, namely the fact that it is composed of commuting local terms squaring to the identity. In all, the semion code is a topological code that, unlike previously studied topological codes, it is of non-CSS type and fits into the stabilizer formalism. This is in sharp contrast with previous attempts yielding non-commutative codes.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.