Quantum Error Correcting Subsystem Codes From Two Classical Linear Codes
arXiv:quant-ph/0610088
Abstract
The essential insight of quantum error correction was that quantum information can be protected by suitably encoding this quantum information across multiple independently erred quantum systems. Recently it was realized that, since the most general method for encoding quantum information is to encode it into a subsystem, there exists a novel form of quantum error correction beyond the traditional quantum error correcting subspace codes. These new quantum error correcting subsystem codes differ from subspace codes in that their quantum correcting routines can be considerably simpler than related subspace codes. Here we present a class of quantum error correcting subsystem codes constructed from two classical linear codes. These codes are the subsystem versions of the quantum error correcting subspace codes which are generalizations of Shor's original quantum error correcting subspace codes. For every Shor-type code, the codes we present give a considerable savings in the number of stabilizer measurements needed in their error recovery routines.
8 pages, Allerton 2006 conference. Last name fixed
References in corpus (17)
- Fault-tolerant quantum computation by anyons
- A Theory of Quantum Error-Correcting Codes
- Maintaining coherence in Quantum Computers
- Theory of Decoherence-Free Fault-Tolerant Universal Quantum Computation
- Operator Quantum Error Correcting Subsystems for Self-Correcting Quantum Memories
- Stabilizer Formalism for Operator Quantum Error Correction
- A Unified and Generalized Approach to Quantum Error Correction
- Quantum Computers, Factoring, and Decoherence
- Stabilizing Quantum Information
- Subsystem fault tolerance with the Bacon-Shor code
- Classical and quantum communication without a shared reference frame
- Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms
- Space, time, parallelism and noise requirements for reliable quantum computing
- Quantum Error Correcting Subsystems are Unitarily Recoverable Subsystems
- Algebraic and information-theoretic conditions for operator quantum error-correction
- The Quantum Schur Transform: I. Efficient Qudit Circuits
- Clifford Code Constructions of Operator Quantum Error Correcting Codes
Cited by in corpus (18)
- Quantum memories at finite temperature
- General entanglement-assisted quantum error-correcting codes
- Distributed Quantum Computation Architecture Using Semiconductor Nanophotonics
- Communication Links for Distributed Quantum Computation
- Subsystem codes with spatially local generators
- On Subsystem Codes Beating the Hamming or Singleton Bound
- Scheme for fault-tolerant holonomic computation on stabilizer codes
- Resilience to time-correlated noise in quantum computation
- Entanglement-assisted Coding Theory
- Asymmetric and Symmetric Subsystem BCH Codes and Beyond
- Quantum stabilizer codes and beyond
- On Quantum and Classical Error Control Codes: Constructions and Applications
- Quantum Error Correction Code in the Hamiltonian Formulation
- Subsystem CSS codes, a tighter stabilizer-to-CSS mapping, and Goursat's Lemma
- Topics in quantum information and the theory of open quantum systems
- Encoding Classical Information in Gauge Subsystems of Quantum Codes
- Asymptotics of the quantum Hamming bound for subsystem codes
- Decoding Algorithms for Hypergraph Subsystem Codes and Generalized Subsystem Surface Codes