The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
ON OPTIMAL QUANTUM CODES
Open accessAbstract
We present families of quantum error-correcting codes which are optimal in the sense that the minimum distance is maximal. These maximum distance separable (MDS) codes are defined over q-dimensional quantum systems, where q is an arbitrary prime power. It is shown that codes with parameters 〚n, n - 2d + 2, d〛q exist for all 3≤n≤q and 1≤d≤n/2+1. We also present quantum MDS codes with parameters 〚q 2, q 2-2d+2, d〛q for 1≤d≤q which additionally give rise to shortened codes 〚q 2-s, q 2-2d+2-s, d〛q for some s.
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
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
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 2×
“q Theorem 10 puncture code P (C) weights in P (C) 2 [[4, 2, 2]]2 [4, 3, 2]2 2, 4 3 [[9, 7, 2]]3 [9, 8, 2]3 2–9 [[9, 5, 3]]3 [9, 5, 4]3 4–9 4 [[16, 14, 2]]4 [16, 15, 2]4 2–16 [[16, 12, 3]]4 [16, 12, 4]4 4–16 [[16, 10, 4]]4 [16, 7, 8]4 8, 10, 12, 14, 16 5 [[25, 23, 2]]5 [25, 24, 2]5 2–25 [[25, 21, 3]]5 [25, 21, 4]5 4–25…”
BackgroundGallager, R. G., & Peterson, W. W. (1962) · Mathematics of Computation · doi:10.2307/2003832 · Cited by 2,041
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
Modular curves, Shimura curves, and Goppa codes, better than Varshamov‐Gilbert bound
Tsfasman, M. A., Vlădutx, S. G., & Zink, T. (1982) · Mathematische Nachrichten · doi:10.1002/mana.19821090103 · Cited by 534
Rains, E. M. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.782103 · Cited by 383
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
Cited by
Holographic quantum error-correcting codes: toy models for the bulk/boundary correspondence
Pastawski, F., Yoshida, B., Harlow, D., & Preskill, J. (2015) · Journal of High Energy Physics · doi:10.1007/jhep06(2015)149 · Cited by 958
Nonbinary Stabilizer Codes Over Finite Fields
Ketkar, A., Klappenecker, A., Kumar, S., & Sarvepalli, P. K. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.883612 · Cited by 623
Protecting expressive circuits with a quantum error detection code
Self, C. N., Benedetti, M., & Amaro, D. (2024) · Nature Physics · doi:10.1038/s41567-023-02282-2 · Cited by 31
Multiqubit monogamy relations beyond shadow inequalities
Serrano-Ensástiga, E., Giraud, O., & Martin, J. (2026) · Physical Review A · doi:10.1103/9fkf-hm8l
Metadata
- Authors
- GRASSL, M., BETH, T., & RÖTTELER, M.
- Venue
- International Journal of Quantum Information
- Publisher
- World Scientific Pub Co Pte Lt
- Published
- 2004-03
- Volume
- 02
- Issue
- 01
- Pages
- 55-64
- ISSN
- 0219-7499 (ISSN-L)
- 1793-6918
- OpenAlex
- W2076107177
- Cited by
- 283
- References
- 14
- FWCI
- 6.78
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: ON OPTIMAL QUANTUM CODES. https://app.cochat.ai/papers/10.1142/s0219749904000079
- The paper
- GRASSL, M., BETH, T., & RÖTTELER, M. (2004). ON OPTIMAL QUANTUM CODES. International Journal of Quantum Information. https://doi.org/10.1142/s0219749904000079
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.