article Open AccessTop 1% cited
Class of quantum error-correcting codes saturating the quantum Hamming bound
Physical Review A · 1996 · Vol. 54(3) · pp. 1862–1868
Daniel Gottesman✉(California Institute of Technology)
Abstract
I develop methods for analyzing quantum error-correcting codes, and use these methods to construct an infinite class of codes saturating the quantum Hamming bound. These codes encode k=n-j-2 quantum bits (qubits) in n=${2}^{\mathit{j}}$ qubits and correct t=1 error. \textcopyright{} 1996 The American Physical Society.
Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum-Dot Cellular AutomataQuantumHamming codeQuantum error correctionMathematicsHamming distanceClass (philosophy)Quantum convolutional codeHamming(7,4)PhysicsDiscrete mathematics
Citations
1,232
FWCI
46.44
field-weighted impact
References
3
Percentile
100%
vs. same field & year
Citations per year
Cited by
Decoherence, einselection, and the quantum origins of the classical
Reviews of Modern Physics · 2003 · 4,083 citations
Fault-tolerant quantum computation by anyons
Annals of Physics · 2003 · 7,123 citations
Theory of fault-tolerant quantum computation
Physical Review A · 1998 · 930 citations
Quantum error correction via codes over GF(4)
IEEE Transactions on Information Theory · 1998 · 1,753 citations
Topological quantum memory
Journal of Mathematical Physics · 2002 · 1,606 citations
Encoding a qubit in an oscillator
Physical Review A · 2001 · 1,445 citations
Measurement-driven entanglement transition in hybrid quantum circuits
Physical review. B./Physical review. B · 2019 · 610 citations
Dynamical suppression of decoherence in two-state quantum systems
Physical Review A · 1998 · 1,544 citations
References
Scheme for reducing decoherence in quantum computer memory
Physical Review A · 1995 · 4,387 citations
Good quantum error-correcting codes exist
Physical Review A · 1996 · 2,473 citations
Citation Network
How this paper connects to the literature. Drag to explore, click any node to open that paper.
