Quantum Analog of the MacWilliams Identities for Classical Coding Theory
The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
We derive a relationship between two different notions of fidelity (entanglement fidelity and average fidelity) for a completely depolarizing quantum channel. This relationship gives rise to a quantum analog of the MacWilliams identities in classical coding theory. These identities relate the weight enumerator of a code to the one of its dual and, with linear programming techniques, provide a powerful tool to investigate the possible existence of codes. The same techniques can be adapted to the quantum case. We give examples of their power.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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-citationGood 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
Self-citationTheory of quantum error-correcting codes
Knill, E., & Laflamme, R. (1997) · Physical Review A · doi:10.1103/physreva.55.900 · Cited by 1,593
Self-citationMultiple-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
Quantum computers and dissipation
(1996) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1996.0029 · Cited by 899
Simple quantum error-correcting codes
Steane, A. M. (1996) · Physical Review A · doi:10.1103/physreva.54.4741 · Cited by 522
Quantum Computers, Factoring, and Decoherence
Chuang, I. L., Laflamme, R., Shor, P. W., & Zurek, W. H. (1995) · Science · doi:10.1126/science.270.5242.1633 · Cited by 289
Self-citation
Cited by
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
Self-citationQuantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424
Steane, A. (1998) · Reports on Progress in Physics · doi:10.1088/0034-4885/61/2/002 · Cited by 1,391
Steane, A. (1997) · arXiv · doi:10.48550/arxiv.quant-ph/9708022 · Cited by 1,390
Reduction criterion of separability and limits for a class of distillation protocols
Horodecki, M., & Horodecki, P. (1999) · Physical Review A · doi:10.1103/physreva.59.4206 · Cited by 903
Nonbinary quantum stabilizer codes
Ashikhmin, A., & Knill, E. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.959288 · Cited by 625
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
Preserving Coherence in Quantum Computation by Pairing Quantum Bits
Duan, L.-M., & Guo, G.-C. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.1953 · Cited by 554
Bennett, C. H., & Shor, P. W. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720553 · Cited by 370
Self-citationScott, A. J. (2004) · Physical Review A · doi:10.1103/physreva.69.052330 · Cited by 353
A semidefinite program for distillable entanglement
Rains, E. M. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.959270 · Cited by 326
Quantum-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-citationEntanglement-Assisted Quantum Turbo Codes
Wilde, M. M., Hsieh, M.-H., & Babar, Z. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2292052 · Cited by 102
“We found all of these examples by picking encoders uniformly at random from the Clifford group, according to the algorithm in Section VI-A.2 of Ref.”
Remarks on Bounds for Quantum Codes
Ashikhmin, A. (1997) · arXiv · doi:10.48550/arxiv.quant-ph/9705037 · Cited by 3
Multiqubit monogamy relations beyond shadow inequalities
Serrano-Ensástiga, E., Giraud, O., & Martin, J. (2026) · Physical Review A · doi:10.1103/9fkf-hm8l
Quantum error correction and fault tolerance: A comprehensive tutorial
Spencer, D. J., Jain, S. P., Tanggara, A., Sun, Z., Haug, T., Khu, D., & Bharti, K. (2026) · arXiv
Gottesman-Kitaev-Preskill codes: A lattice perspective
Conrad, J., Eisert, J., & Arzani, F. (2022) · Quantum · doi:10.22331/q-2022-02-10-648
“Although a similar statement can be derived from the seminal work of Shor, Laflamme [17] and Rains [18], it follows straightforwardly from the lattice theoretic concepts we introduce, showcasing that a lattice theoretic standpoint can also benefit the examination of qubit stabilizer codes.”
Background
Metadata
- Authors
- Shor, P., & Laflamme, R.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 1997-02-24
- Volume
- 78
- Issue
- 8
- Pages
- 1600-1602
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2021404493
- Cited by
- 139
- References
- 8
- FWCI
- 14.27
- 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.