Quantum codes of minimum distance two
From MaRDI portal
Publication:4701264
DOI10.1109/18.746807zbMATH Open0947.94027arXivquant-ph/9704043OpenAlexW2111721896MaRDI QIDQ4701264FDOQ4701264
Authors: Eric Rains 
Publication date: 21 November 1999
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: It is reasonable to expect the theory of quantum codes to be simplified in the case of codes of minimum distance 2; thus, it makes sense to examine such codes in the hopes that techniques that prove effective there will generalize. With this in mind, we present a number of results on codes of minimum distance 2. We first compute the linear programming bound on the dimension of such a code, then show that this bound can only be attained when the code either is of even length, or is of length 3 or 5. We next consider questions of uniqueness, showing that the optimal code of length 2 or 4 is unique (implying that the well-known one-qubit-in-five single-error correcting code is unique), and presenting nonadditive optimal codes of all greater even lengths. Finally, we compute the full automorphism group of the more important distance 2 codes, allowing us to determine the full automorphism group of any GF(4)-linear code.
Full work available at URL: https://arxiv.org/abs/quant-ph/9704043
Recommendations
- Quantum codes with improved minimum distance
- Quantum MDS codes with large minimum distance
- Quantum LDPC Codes With Almost Linear Minimum Distance
- A note on the minimum distance of quantum LDPC codes
- Minimum distance of Hermitian two-point codes
- Binary construction of quantum codes of minimum distances five and six
- Binary Construction of Quantum Codes of Minimum Distance Three and Four
- LINEAR QUANTUM CODES OF MINIMUM DISTANCE THREE
- Quantum BCH codes with maximum designed distance
- Two classes of quantum codes from almost MDS codes
Cited In (18)
- A note on the minimum distance of quantum LDPC codes
- Minimum distance of Hermitian two-point codes
- Quantum and LCD codes from skew constacyclic codes over a finite non-chain ring
- Ternary optimal quantum codes constructed from caps in \(PG(k, 9)\) (\(k \geq 2\))
- New quantum codes from skew constacyclic codes
- Bounding the distance of quantum surface codes
- All maximally entangled four-qubit states
- New quantum codes from Hermitian dual-containing matrix-product codes
- Quantum and LCD codes from skew constacyclic codes over a general class of non-chain rings
- LINEAR QUANTUM CODES OF MINIMUM DISTANCE THREE
- Toy models of holographic duality between local Hamiltonians
- On MDS color codes
- Quantum codes and Abelian subgroups of the extra-special group
- Binary Construction of Quantum Codes of Minimum Distance Three and Four
- Simple Family of Nonadditive Quantum Codes
- A new construction of quantum error-correcting codes
- Nonadditive quantum error-correcting code
- GHZ extraction yield for multipartite stabilizer states
This page was built for publication: Quantum codes of minimum distance two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701264)
