The DOI matches its Crossref record; 81 of the 81 references it cites were found in a registry or an index.
Nonbinary Stabilizer Codes Over Finite Fields
Open accessAbstract
One formidable difficulty in quantum communication and computation is to protect information-carrying quantum states against undesired interactions with the environment. To address this difficulty, many good quantum error-correcting codes have been derived as binary stabilizer codes. Fault-tolerant quantum computation prompted the study of nonbinary quantum codes, but the theory of such codes is not as advanced as that of binary quantum codes. This paper describes the basic theory of stabilizer codes over finite fields. The relation between stabilizer codes and general quantum codes is clarified by introducing a Galois theory for these objects. A characterization of nonbinary stabilizer codes over$bf F_q$in terms of classical codes over$ bf F_q^2$is provided that generalizes the well-known notion of additive codes over$ bf F_4$of the binary case. This paper also derives lower and upper bounds on the minimum distance of stabilizer codes, gives several code constructions, and derives numerous families of stabilizer codes, including quantum Hamming codes, quadratic residue codes, quantum Melas codes, quantum Bose–Chaudhuri–Hocquenghem (BCH) codes, and quantum character codes. The puncturing theory by Rains is generalized to additive codes that are not necessarily pure. Bounds on the maximal length of maximum distance separable stabilizer codes are given. A discussion of open problems concludes this paper.
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
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
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
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
Fundamentals of Error-Correcting Codes
Huffman, W. C., & Pless, V. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511807077 · Cited by 2,460
Quantum error correction via codes over GF(4)
Calderbank, A. R., Rains, E. M., Shor, P. M., & Sloane, N. J. A. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.681315 · Cited by 1,742
Theory of quantum error-correcting codes
Knill, E., & Laflamme, R. (1997) · Physical Review A · doi:10.1103/physreva.55.900 · Cited by 1,593
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424
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
Pless, V. S., Brualdi, R. A., & Huffman, W. C. (2011) · Medical Entomology and Zoology · Cited by 1,229
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 4×
“ost widely studied class of quantum error control codes are binary stabilizer codes, see [7,8,14,18,20,27–29,32,36,38,39,41–45,47,53,54,56, 67,79,88,90–93,95,98] and, in particular, the seminal works [19,37]. An appealing aspect of binarystabilizer codes is that there exist links to classical coding theory which ease…”
BackgroundResultInfluentialMultiple 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
Stabilizer Codes and Quantum Error Correction
Gottesman, D. (1997) · arXiv · doi:10.48550/arxiv.quant-ph/9705052 · Cited by 753
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
Nonbinary quantum stabilizer codes
Ashikhmin, A., & Knill, E. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.959288 · Cited by 625
Assmus, E. F., & Key, J. D. (1992) · Cambridge University Press eBooks · doi:10.1017/cbo9781316529836 · Cited by 569
Simple quantum error-correcting codes
Steane, A. M. (1996) · Physical Review A · doi:10.1103/physreva.54.4741 · Cited by 522
New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
McEliece, R., Rodemich, E., Rumsey, H., & Welch, L. (1977) · IEEE Transactions on Information Theory · doi:10.1109/tit.1977.1055688 · Cited by 447
Quantum error-correcting codes associated with graphs
Schlingemann, D., & Werner, R. F. (2001) · Physical Review A · doi:10.1103/physreva.65.012308 · Cited by 406
Rains, E. M. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.782103 · Cited by 383
Sparse-Graph Codes for Quantum Error Correction
MacKay, D. J. C., Mitchison, G., & McFadden, P. L. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.834737 · Cited by 376
Codes for the quantum erasure channel
Grassl, M., Beth, T., & Pellizzari, T. (1997) · Physical Review A · doi:10.1103/physreva.56.33 · Cited by 374
Ore, Ö. (1944) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1944-0010555-7 · Cited by 284
GRASSL, M., BETH, T., & RÖTTELER, M. (2004) · International Journal of Quantum Information · doi:10.1142/s0219749904000079 · Cited by 283
The weights of the orthogonals of the extended quadratic binary Goppa codes
Lachaud, G., & Wolfmann, J. (1990) · IEEE Transactions on Information Theory · doi:10.1109/18.54892 · Cited by 278
Authentication of quantum messages
Barnum, H., Crepeau, C., Gottesman, D., Smith, A., & Tapp, A. (2003) · The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. · doi:10.1109/sfcs.2002.1181969 · Cited by 272
Quantum Error Correction for Communication
Ekert, A., & Macchiavello, C. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.2585 · Cited by 271
Enlargement of Calderbank-Shor-Steane quantum codes
Steane, A. M. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.796388 · Cited by 264
Non-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
Stabilizer codes can be realized as graph codes
Schlingemann, D.-M. (2002) · Quantum Information and Computation · doi:10.26421/qic2.4-4 · Cited by 196
Projective Plane and Planar Quantum Codes
Freedman, M. H., & Meyer, D. A. (2001) · Foundations of Computational Mathematics · doi:10.1007/s102080010013 · Cited by 183
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
Fault-Tolerant Quantum Computation with Higher-Dimensional Systems
Gottesman, D. (1999) · Lecture notes in computer science · doi:10.1007/3-540-49208-9_27 · Cited by 154
Rains, E. M. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.681316 · Cited by 139
Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
Levenshtein, V. I. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.412678 · Cited by 138
Efficient 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
Polynomial invariants of quantum codes
Rains, E. M. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.817508 · Cited by 112
EFFICIENT QUANTUM CIRCUITS FOR NON-QUBIT QUANTUM ERROR-CORRECTING CODES
Grassl, M., Rötteler, M., & Beth, T. (2003) · International Journal of Foundations of Computer Science · doi:10.1142/s0129054103002011 · Cited by 109
Group 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
An Introduction to Quantum Error CorrectionPreprint
Gottesman, D. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0004072 · Cited by 103
Asymptotically good quantum codes
Ashikhmin, A., Litsyn, S. N., & Tsfasman, M. A. (2001) · Physical Review A · doi:10.1103/physreva.63.032311 · Cited by 94
Quantum codes of minimum distance two
Rains, E. M. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.746807 · Cited by 90
Beyond stabilizer codes .I. Nice error bases
Klappenecker, A., & Rötteler, M. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.800471 · Cited by 90
Self-citationAn introduction to quantum error correction
Gottesman, D. (2002) · Proceedings of symposia in applied mathematics · doi:10.1090/psapm/058/1922900 · Cited by 90
On the classification of all self-dual additive codes over GF(4) of length up to 12
Danielsen, L. E., & Parker, M. G. (2006) · Journal of Combinatorial Theory Series A · doi:10.1016/j.jcta.2005.12.004 · Cited by 83
Upper bounds on the size of quantum codes
Ashikhmin, A., & Litsyu, S. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.761270 · Cited by 77
Quantum Reed-Solomon CodesPreprint
Grassl, M., Geiselmann, W., Beth, T., & Karlsruhe, U. (1999) · Cited by 75
Grassl, M., Geiselmann, W., & Beth, T. (1999) · Lecture notes in computer science · doi:10.1007/3-540-46796-3_23 · Cited by 68
Binary Construction of Quantum Codes of Minimum Distance Three and Four
Li, R., & Li, X. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.828149 · Cited by 68
On binary constructions of quantum codes
Cohen, G., Encheva, S., & Litsyn, S. N. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.796389 · Cited by 67
Primitive Quantum BCH Codes over Finite Fields
Aly, S. A., Klappenecker, A., & Sarvepalli, P. K. (2006) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2006.261957 · Cited by 63
Self-citationSome good quantum error-correcting codes from algebraic-geometric codes
Chen, H. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.930942 · Cited by 57
A Proposed Quantum Low Density Parity Check CodePreprint
Postol, M. S. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0108131 · Cited by 56
Quantum error detection .II. Bounds
Ashikhmin, A., Barg, A., Knill, E. H., et al. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.841163 · Cited by 55
Families of curves and weight distributions of codes
Schoof, R. (1995) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-1995-00586-0 · Cited by 53
Cyclic quantum error–correcting codes and quantum shift registers
Grassl, M., & Beth, T. (2000) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2000.0633 · Cited by 52
Quantum error detection .I. Statement of the problem
Ashikhmin, A., Barg, A., Knill, E. H., & Litsyn, S. N. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.841162 · Cited by 52
Quantum codes [[6, 2, 3]]/sub p/ and [[7, 3, 3]]/sub p/ (p ≥ 3) exist
Feng, K. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.800469 · Cited by 51
Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound
Chen, H., Ling, S., & Xing, C. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.930941 · Cited by 50
Five quantum register error correction code for higher spin systems
Chau, H. F. (1997) · Physical Review A · doi:10.1103/physreva.56.r1 · Cited by 47
Quantum stabilizer codes and classical linear codes
Cleve, R. (1997) · Physical Review A · doi:10.1103/physreva.55.4054 · 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
Correcting quantum errors in higher spin systems
Chau, H. F. (1997) · Physical Review A · doi:10.1103/physreva.55.r839 · Cited by 40
Improvement of Ashikhmin-Litsyn-Tsfasman bound for quantum codes
Matsumoto, R. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.1013156 · Cited by 39
Beyond stabilizer codes II: Clifford codes
Klappenecker, A., & Rötteler, M. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit/2002.800473 · Cited by 39
Self-citationCyclic Quantum Error-Correcting Codes and Quantum Shift RegistersPreprint
Grassl, M., & Beth, T. (2000) · Cited by 37
Matsumoto, R., & Uyematsu, T. (2000) · Institutional Repositories DataBase (IRDB) · Cited by 31
Spatially correlated qubit errors and burst-correcting quantum codes
Vatan, F., Roychowdhury, V., & Anantram, M. P. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.771250 · Cited by 31
Nonbinary quantum error-correcting codes from algebraic curves
Kim, J.-L., & Walker, J. L. (2007) · Discrete Mathematics · doi:10.1016/j.disc.2007.08.038 · Cited by 31
QUANTUM ERROR-CORRECTING CODES
Feng, K. (2002) · Lecture notes series, Institute For Mathematical Sciences · doi:10.1142/9789812388841_0003 · Cited by 29
Algebraic geometric construction of a quantum stabilizer codePreprint
Matsumoto, R. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0107129 · Cited by 27
Quantum Error Correction and Fault-TolerancePreprint
Gottesman, D. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0507174 · Cited by 23
Matsumoto, R., & Uyematsu, T. (1999) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9911011 · Cited by 23
Remarkable Degenerate Quantum Stabilizer Codes Derived from Duadic Codes
Aly, S. A., Klappenecker, A., & Sarvepalli, P. K. (2006) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2006.261955 · Cited by 20
Self-citationElementary 2-group character codes
Ding, C., Kohel, D., & Ling, S. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.817529 · Cited by 16
A Family of Quantum Stabilizer Codes Based on the Weyl Commutation Relations over a Finite Field
Arvind, V., & Parthasarathy, K. R. (2003) · Hindustan Book Agency · doi:10.1007/978-93-86279-11-8_12 · Cited by 15
Quantum message authentication codesPreprint
Barnum, H. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0103123 · Cited by 13
Binary construction of quantum codes
Li, R., & Li, X. (2006) · Cited by 4
Cited by
Quantum channels and memory effects
Caruso, F., Giovannetti, V., Lupo, C., & Mancini, S. (2012) · arXiv · doi:10.48550/arxiv.1207.5435 · Cited by 331
Quantum stabilizer codes embedding qubits into qudits
Cafaro, C., Maiolini, F., & Mancini, S. (2012) · Physical Review A · doi:10.1103/physreva.86.022308 · Cited by 40
Transversal Clifford and T -Gate Codes of Short Length and High Distance
Jain, S. P., & Albert, V. V. (2025) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2025.3570832 · Cited by 8
Metadata
- Authors
- Ketkar, A., Klappenecker, A., Kumar, S., & Sarvepalli, P. K.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2006-11
- Volume
- 52
- Issue
- 11
- Pages
- 4892-4914
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2162938940
- Cited by
- 623
- References
- 81
- FWCI
- 16.84
- Type
- journal article
- Language
- en
- Open access
- green
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.