Quantum Error Correction with the Semion Code
arXiv:1810.08204 · doi:10.1088/1367-2630/ab1ed8
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.
arXiv commentREVTeX 4 file, color figures
References in corpus (56)
- Fault-tolerant quantum computation by anyons
- Anyons in an exactly solved model and beyond
- Good Quantum Error-Correcting Codes Exist
- Topological quantum memory
- String-net condensation: A physical mechanism for topological phases
- Quantum Error Correction for Quantum Memories
- Multiple Particle Interference and Quantum Error Correction
- A Class of Quantum Error-Correcting Codes Saturating the Quantum Hamming Bound
- Quantum Error Correction and Orthogonal Geometry
- Topological Quantum Distillation
- Braiding statistics approach to symmetry-protected topological phases
- Information and Computation: Classical and Quantum Aspects
- Quantum codes on a lattice with boundary
- Fault-Tolerant Error Correction with Efficient Quantum Codes
- A classification of symmetry enriched topological phases with exactly solvable models
- Analytic and numerical demonstration of quantum self-correction in the 3D Cubic Code
- Fast Decoders for Topological Quantum Codes
- A Class of -Invariant Topological Phases of Interacting Electrons
- Almost-linear time decoding algorithm for topological codes
- Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
- Ultrahigh Error Threshold for Surface Codes with Biased Noise
- Towards practical classical processing for the surface code
- Topological Computation without Braiding
- Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
- Three-dimensional topological lattice models with surface anyons
- Strong Resilience of Topological Codes to Depolarization
- Fault-tolerant quantum computation
- High threshold error correction for the surface code
- Threshold Accuracy for Quantum Computation
- Homological Error Correction: Classical and Quantum Codes
- Linear-Time Maximum Likelihood Decoding of Surface Codes over the Quantum Erasure Channel
- Twisted Fracton Models in Three Dimensions
- Deep neural decoders for near term fault-tolerant experiments
- Efficient Decoders for Qudit Topological Codes
- Advantages of versatile neural-network decoding for topological codes
- An efficient Markov chain Monte Carlo algorithm for the surface code
- Cellular-automaton decoders for topological quantum memories
- Numerical study of a transition between Z2 topologically ordered phases
- Efficient Decoding of Topological Color Codes
- Scalable Neural Network Decoders for Higher Dimensional Quantum Codes
- Weyl points and Dirac lines protected by multiple screw rotations
- Experimental Identification of Non-Abelian Topological Orders on a Quantum Simulator
- Linear-time general decoding algorithm for the surface code
- Translation invariance, topology, and protection of criticality in chains of interacting anyons
- Cellular automaton decoders of topological quantum memories in the fault tolerant setting
- Fault-Tolerant Quantum Error Correction for non-Abelian Anyons
- Fault Tolerant Quantum Computation with Constant Error
- A Non-Commuting Stabilizer Formalism
- Geometric Entanglement in Topologically Ordered States
- A simple decoder for topological codes
- Double Semion Phase in an Exactly Solvable Quantum Dimer Model on the Kagome Lattice
- From Dirac semimetals to topological phases in three dimensions: a coupled wire construction
- Double-semion topological order from exactly solvable quantum dimer models
- Double semions in arbitrary dimension
- A bilayer Double Semion Model with Symmetry-Enriched Topological Order
- Fault-tolerant quantum computation
Cited by in corpus (11)
- Pauli stabilizer models of twisted quantum doubles
- Determination of the Semion Code Threshold using Neural Decoders
- Fracton Self-Statistics
- Topological error correcting processes from fixed-point path integrals
- Non-Pauli topological stabilizer codes from twisted quantum doubles
- Extracting topological orders of generalized Pauli stabilizer codes in two dimensions
- Low-overhead non-Clifford fault-tolerant circuits for all non-chiral abelian topological phases
- The low-energy TQFT of the generalized double semion model
- Statistical mechanical mapping and maximum-likelihood thresholds for the surface code under generic single-qubit coherent errors
- Many-body quantum catalysts for transforming between phases of matter
- Simulating Topological Order on Quantum Processors