The DOI matches its Crossref record; 61 of the 61 references it cites were found in a registry or an index.
Quantum error correction via codes over GF(4)
Abstract
The problem of finding quantum error correcting codes is transformed into the problem of finding additive codes over the field GF(4) which are self-orthogonal with respect to a certain trace inner product. Many new codes and new bounds are presented, as well as a table of upper and lower bounds on such codes of length up to 30 qubits.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
The Magma Algebra System I: The User Language
BOSMA, W., CANNON, J., & PLAYOUST, C. (1997) · Journal of Symbolic Computation · doi:10.1006/jsco.1996.0125 · Cited by 7,094
A single quantum cannot be cloned
Wootters, W. K., & Zurek, W. H. (1982) · Nature · doi:10.1038/299802a0 · Cited by 5,406 · cited 1×
“Classical information can be duplicated, while quantum information cannot [18], [37].”
BackgroundMixed-state entanglement and quantum error correction
Bennett, C. H., DiVincenzo, D. P., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review A · doi:10.1103/physreva.54.3824 · Cited by 5,272
Huppert, B. (1967) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-642-64981-3 · Cited by 5,171
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
Self-citationSphere Packings, Lattices and Groups.
Coxeter, H. S. M., Conway, J. H., & Sloane, N. J. A. (1989) · The American Mathematical Monthly · doi:10.2307/2323992 · Cited by 3,377
Self-citationPurification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
Bennett, C. H., Brassard, G., Popescu, S., Schumacher, B., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review Letters · doi:10.1103/physrevlett.76.722 · Cited by 2,961
Error Correcting Codes in Quantum Theory
Steane, A. M. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.793 · Cited by 2,677
Good quantum error-correcting codes exist
Calderbank, A. R., & Shor, P. W. (1996) · Physical Review A · doi:10.1103/physreva.54.1098 · Cited by 2,516 · cited 3×
“It is also the group generated by fault-tolerant bitwise operations performed on qubits that are encoded by certain quantum codes [17], [66], [72].”
BackgroundSelf-citationAMPL : a modeling language for mathematical programming
Fourer, R., & Kernighan, B. W. (1993) · Cited by 1,860
Theory of quantum error-correcting codes
Knill, E., & Laflamme, R. (1997) · Physical Review A · doi:10.1103/physreva.55.900 · Cited by 1,593
Dieks, D. (1982) · Physics Letters A · doi:10.1016/0375-9601(82)90084-6 · Cited by 1,461
Multiple-particle interference and quantum error correction
(1996) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1996.0136 · Cited by 1,284
Class of quantum error-correcting codes saturating the quantum Hamming bound
Gottesman, D. (1996) · Physical Review A · doi:10.1103/physreva.54.1862 · Cited by 1,227 · cited 10×
“In particular, this implies that these bounds can be attained using additive codes. v) Cleve [20] has found a way to apply asymptotic upper bounds for classical binary codes to additive codes. vi) Steane [74] has extended Gottesman's [36] construction (compare Theorem 10) to obtain quantum analogues of Reed–Muller cod…”
BackgroundInfluentialPerfect Quantum Error Correcting Code
Laflamme, R., Miquel, C., Paz, J. P., & Zurek, W. H. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.198 · Cited by 963
Theory of fault-tolerant quantum computation
Gottesman, D. (1998) · Physical Review A · doi:10.1103/physreva.57.127 · Cited by 947
Fault-tolerant quantum computation
Shor, P. W. (2002) · Proceedings of 37th Conference on Foundations of Computer Science · doi:10.1109/sfcs.1996.548464 · Cited by 892
Self-citationSphere Packings, Lattices and Groups
Conway, J. H., & Sloane, N. J. A. (1993) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-1-4757-2249-9 · Cited by 880
Self-citationMultiple particle interference and quantum error correction
Steane, A. M. (1996) · Cited by 871
Quantum Error Correction and Orthogonal Geometry
Calderbank, A. R., Rains, E. M., Shor, P. W., & Sloane, N. J. A. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.405 · Cited by 811
Self-citationPacking Lines, Planes, etc.: Packings in Grassmannian Spaces
Conway, J. H., Hardin, R. H., & Sloane, N. J. A. (1996) · Experimental Mathematics · doi:10.1080/10586458.1996.10504585 · Cited by 755
Self-citationDrud, A. S. (1994) · ORSA Journal on Computing · doi:10.1287/ijoc.6.2.207 · Cited by 690
van Lint, J. H. (1982) · Graduate Texts in Mathematics · doi:10.1007/978-3-662-07998-0 · Cited by 668
Knill, E., Laflamme, R., & Zurek, W. H. (1998) · Science · doi:10.1126/science.279.5349.342 · Cited by 663
Fault-tolerant quantum computation with constant error
Aharonov, D., & Ben-Or, M. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258579 · Cited by 631
Cannon, J., Bosma, W., Fieker, C., & Steel, A. K. (2011) · Cited by 600
Simple quantum error-correcting codes
Steane, A. M. (1996) · Physical Review A · doi:10.1103/physreva.54.4741 · Cited by 522
Fault-Tolerant Quantum Computation with Constant Error Rate
Aharonov, D., & Ben-Or, M. (2008) · SIAM Journal on Computing · doi:10.1137/s0097539799359385 · Cited by 513
Maple V Library Reference Manual
Char, B. W., Geddes, K. O., Gonnet, G. H., Leong, B., Monagan, M. B., & Watt, S. M. (1991) · Springer eBooks · doi:10.1007/978-1-4757-2133-1 · Cited by 407
Rains, E. M. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.782103 · Cited by 383
Self-citationA new upper bound on the minimal distance of self-dual codes
Conway, J. H., & Sloane, N. J. A. (1990) · IEEE Transactions on Information Theory · doi:10.1109/18.59931 · Cited by 347
Self-citationFault-Tolerant Error Correction with Efficient Quantum Codes
DiVincenzo, D. P., & Shor, P. W. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.3260 · Cited by 338
Self-citationZ4 -Kerdock Codes, Orthogonal Spreads, and Extremal Euclidean Line-Sets
Calderbank, A., Cameron, P., Kantor, W., & Seidel, J. (1997) · Proceedings of the London Mathematical Society · doi:10.1112/s0024611597000403 · Cited by 313
Self-citationQuantum-channel capacity of very noisy channels
DiVincenzo, D. P., Shor, P. W., & Smolin, J. A. (1998) · Physical Review A · doi:10.1103/physreva.57.830 · Cited by 297
Self-citationQuantum Error Correction for Communication
Ekert, A., & Macchiavello, C. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.2585 · Cited by 271
Teleporting an unknown quantum state via dual classical and EPR channels
Bennett, C. H., Gilles Brassard, A., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Cited by 261
Shadow bounds for self-dual codes
Rains, E. M. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.651000 · Cited by 237
Self-citationNon-binary unitary error bases and quantum codes
Lab., N. (. S. L. A. N., Knill, E., & USDOE, W. (1996) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/373768 · Cited by 209
Steane, A. M. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.771249 · Cited by 175
Quantum Analog of the MacWilliams Identities for Classical Coding Theory
Shor, P. W., & Laflamme, R. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.1600 · Cited by 160
Self-citationMacwilliams, F. J., Odlyzko, A. M., Sloane, N. J. A., & Ward, H. N. (1978) · Journal of Combinatorial Theory Series A · doi:10.1016/0097-3165(78)90021-3 · Cited by 153
Self-citationRains, E. M. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.681316 · Cited by 139
Self-citationEfficient computations of encodings for quantum error correction
Cleve, R., & Gottesman, D. (1997) · Physical Review A · doi:10.1103/physreva.56.76 · Cited by 133
Rains, E. M. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.796376 · Cited by 115
Self-citationRains, E. M., Hardin, R. H., Shor, P. W., & Sloane, N. J. A. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.953 · Cited by 113
Self-citationGroup representations, error bases and quantum codes
Lab., N. (. S. L. A. N., Knill, E. H., & USDOE, W. (1996) · doi:10.2172/378680 · Cited by 106
Threshold Accuracy for Quantum Computation
Knill, E., Laflamme, R., & Zurek, W. (1996) · arXiv · doi:10.48550/arxiv.quant-ph/9610011 · Cited by 99
Quantum codes of minimum distance two
Rains, E. M. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.746807 · Cited by 90
Self-citationSpace, Time, Parallelism and Noise Requirements for Reliable Quantum Computing
Steane, A. M. (1998) · Fortschritte der Physik · doi:10.1002/(sici)1521-3978(199806)46:4/5<443::aid-prop443>3.0.co;2-8 · Cited by 80
Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes over GF(3) and GF(4)
Gulliver, T. A., & Bhargava, V. K. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.144719 · Cited by 60
Codes and Siegel modular forms
Runge, B. (1996) · Discrete Mathematics · doi:10.1016/0012-365x(94)00271-j · Cited by 59
On Siegel modular forms. Part I.
Runge, B. (1993) · Journal für die reine und angewandte Mathematik (Crelles Journal) · doi:10.1515/crll.1993.436.57 · Cited by 52
Quantum stabilizer codes and classical linear codes
Cleve, R. (1997) · Physical Review A · doi:10.1103/physreva.55.4054 · Cited by 45
Self-dual codes over the Kleinian four group
Höhn, G. (2003) · Mathematische Annalen · doi:10.1007/s00208-003-0440-y · Cited by 45
Error Correction in Quantum CommunicationPreprint
EKERT, A. K., & Macchiavello, C. (1996) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9602022 · Cited by 44
A Family of Optimal Packings in Grassmannian Manifolds
Shor, P. W., & Sloane, N. J. A. (1998) · Journal of Algebraic Combinatorics · doi:10.1023/a:1008608404829 · Cited by 41
Self-citationA 2-adic approach to the analysis of cyclic codes
Calderbank, A. R., Li, W.-C. W., & Poonen, B. (1997) · IEEE Transactions on Information Theory · doi:10.1109/18.568706 · Cited by 34
Self-citationDouble Circulant Codes over $$\mathbb{Z}_4 $$ and Even Unimodular Lattices
Calderbank, A. R., & Sloane, N. J. A. (1997) · Journal of Algebraic Combinatorics · doi:10.1023/a:1008639004036 · Cited by 30
Self-citationOn a finite group of matrices generating orbit codes on Euclidean sphere
Сидельников, В. М. (2002) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.1997.613373 · Cited by 7
Cited by
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904
Self-citationWilde, M. M. (2013) · doi:10.1017/cbo9781139525343 · Cited by 1,138
Theory of fault-tolerant quantum computation
Gottesman, D. (1998) · Physical Review A · doi:10.1103/physreva.57.127 · Cited by 947
Quantum error correction for beginners
Devitt, S. J., Munro, W. J., & Nemoto, K. (2013) · Reports on Progress in Physics · doi:10.1088/0034-4885/76/7/076001 · Cited by 759
Nonbinary quantum stabilizer codes
Ashikhmin, A., & Knill, E. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.959288 · Cited by 625
Metadata
- Authors
- Calderbank, A. R., Rains, E. M., Shor, P. M., & Sloane, N. J. A.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1998-07
- Volume
- 44
- Issue
- 4
- Pages
- 1369-1387
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2167413626
- Cited by
- 1,742
- References
- 61
- FWCI
- 27.57
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.