The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
Sparse-Graph Codes for Quantum Error Correction
Open accessAbstract
Sparse-graph codes appropriate for use in quantum error-correction are presented. Quantum error-correcting codes based on sparse graphs are of interest for three reasons. First, the best codes currently known for classical channels are based on sparse graphs. Second, sparse-graph codes keep the number of quantum interactions associated with the quantum error-correction process small: a constant number per quantum bit, independent of the block length. Third, sparse-graph codes often offer great flexibility with respect to block length and rate. We believe some of the codes we present are unsurpassed by previously published quantum error-correcting codes.
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
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 18,842
Low-density parity-check codes
Gallager, R. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057683 · Cited by 10,602
Quantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436
Fault-tolerant quantum computation by anyons
Kitaev, A. Y. (2003) · Annals of Physics · doi:10.1016/s0003-4916(02)00018-0 · Cited by 7,238
Information theory, inference, and learning algorithms
(2004) · Choice Reviews Online · doi:10.5860/choice.41-5949 · Cited by 6,362
Information Theory, Inference, and Learning Algorithms
(2004) · Kybernetes · doi:10.1108/03684920410534506 · Cited by 4,937
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
Low-Density Parity-Check Codes
Gallager, R. G. (1963) · The MIT Press eBooks · doi:10.7551/mitpress/4347.001.0001 · Cited by 4,401
Good error-correcting codes based on very sparse matrices
MacKay, D. J. C. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.748992 · Cited by 3,684
Self-citationDesign of capacity-approaching irregular low-density parity-check codes
Richardson, T. J., Shokrollahi, M. A., & Urbanke, R. L. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910578 · Cited by 3,335
The capacity of low-density parity-check codes under message-passing decoding
Richardson, T. J., & Urbanke, R. L. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910577 · Cited by 3,065
Near Shannon limit performance of low density paritycheck codes
MacKay, D. J. C., & Neal, R. M. (1997) · Electronics Letters · doi:10.1049/el:19970362 · Cited by 2,678
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 · cited 13×
“For instance, we could take the diagnostic operators associated with the Shor code (see table 3) as generators for a set of stabilizers S.”
BackgroundMethodInfluentialNear Shannon limit performance of low density paritycheck codes
MacKay, D. J. C., & Neal, R. M. (1996) · Electronics Letters · doi:10.1049/el:19961141 · Cited by 1,923
Self-citationDennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499754 · Cited by 1,768
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
Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
Yedidia, J. S., Freeman, W. T., & Weiss, Y. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.850085 · Cited by 1,617
On the inherent intractability of certain coding problems (Corresp.)
Berlekamp, E., McEliece, R., & van Tilborg, H. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055873 · Cited by 1,523
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2001) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,485
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
Low-density parity check codes over GF(q)
Davey, M. C., & MacKay, D. (1998) · IEEE Communications Letters · doi:10.1109/4234.681360 · Cited by 1,199
Self-citationEfficient encoding of low-density parity-check codes
Richardson, T. J., & Urbanke, R. L. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910579 · Cited by 1,028
Generalized Belief Propagation
Yedidia, J. S., Freeman, W. T., & Weiss, Y. (2000) · Cited by 918
Multiple particle interference and quantum error correction
Steane, A. M. (1996) · Cited by 871
Graphical models for machine learning and digital communication
(1999) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(99)90253-5 · Cited by 454
Graphical Models for Machine Learning and Digital Communication
Frey, B. J. (1998) · The MIT Press eBooks · doi:10.7551/mitpress/3348.001.0001 · Cited by 352
Enlargement of Calderbank-Shor-Steane quantum codes
Steane, A. M. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.796388 · Cited by 264
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
Low density parity check codes over GF(q)
Davey, M. C., & MacKay, D. J. C. (2002) · 1998 Information Theory Workshop (Cat. No.98EX131) · doi:10.1109/itw.1998.706440 · Cited by 181
Self-citationOn ensembles of low-density parity-check codes: asymptotic distance distributions
Litsyn, S. N., & Shevelev, V. (2002) · IEEE Transactions on Information Theory · doi:10.1109/18.992777 · Cited by 173
Introduction to Quantum Computation and Information
Lo, H.-K., Spiller, T., & Popescu, S. (1998) · WORLD SCIENTIFIC eBooks · doi:10.1142/3724 · Cited by 166
Lecture Notes for Physics 219: Quantum Computation
Preskill, J. P. (2004) · Cited by 136
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
Graphs, quadratic forms, and quantum codes
Grassl, M., Klappenecker, A., & Rötteler, M. (2003) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2002.1023317 · Cited by 88
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
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
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
Quantum Computing and Error CorrectionPreprint
Steane, A. M. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0304016 · Cited by 37
Algebraic geometric construction of a quantum stabilizer codePreprint
Matsumoto, R. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0107129 · Cited by 27
Cited by
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
Correcting Quantum Errors with Entanglement
Brun, T., Devetak, I., & Hsieh, M.-H. (2006) · Science · doi:10.1126/science.1131563 · Cited by 473
Applications of LDPC Codes to the Wiretap Channel
Thangaraj, A., Dihidar, S., Calderbank, A. R., McLaughlin, S. W., & Merolla, J.-M. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.901143 · Cited by 455
High-threshold and low-overhead fault-tolerant quantum memory
Bravyi, S., Cross, A. W., Gambetta, J. M., Maslov, D., Rall, P., & Yoder, T. J. (2024) · Nature · doi:10.1038/s41586-024-07107-7 · Cited by 456
“Our codes are a generalization of bicycle codes proposed by MacKay et al. 41 and studied in more depth in refs.”
MethodQuantum Low-Density Parity-Check Codes
Breuckmann, N. P., & Eberhardt, J. N. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040101 · Cited by 328
Metadata
- Authors
- MacKay, D. J. C., Mitchison, G., & McFadden, P. L.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2004-10
- Volume
- 50
- Issue
- 10
- Pages
- 2315-2330
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2119314900
- Cited by
- 376
- References
- 40
- FWCI
- 10.17
- 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.