A simple family of nonadditive quantum codes
arXiv:quant-ph/0701065 · doi:10.1103/PhysRevLett.99.130505
Abstract
Most known quantum codes are additive, meaning the codespace can be described as the simultaneous eigenspace of an abelian subgroup of the Pauli group. While in some scenarios such codes are strictly suboptimal, very little is understood about how to construct nonadditive codes with good performance. Here we present a family of nonadditive quantum codes for all odd blocklengths, n, that has a particularly simple form. Our codes correct single qubit erasures while encoding a higher dimensional space than is possible with an additive code or, for n of 11 or greater, any previous codes.
3 pages, new version with slight clarifications, no results are changed
Cited by in corpus (8)
- Codeword Stabilized Quantum Codes
- Quantum Error Correcting Codes Using Qudit Graph States
- Graphical Nonbinary Quantum Error-Correcting Codes
- Nonadditive quantum error-correcting code
- Generalized Concatenated Quantum Codes
- Asymmetric and Symmetric Subsystem BCH Codes and Beyond
- On Quantum and Classical Error Control Codes: Constructions and Applications
- Quantum Error Correction Code in the Hamiltonian Formulation