The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength
Open accessAbstract
The current best asymptotic lower bound on the minimum distance of quantum LDPC codes with a fixed non-zero rate is logarithmic in the blocklength. We propose a construction of quantum LDPC codes with fixed non-zero rate and prove that the minimum distance grows proportionally to the square root of the blocklength.
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
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
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 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 1×
“LDPC codes [11] and their variants are one of the most satisfying answers to the problem of devising codes guaranteed by Shannon’s theorem.”
BackgroundQuantum 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
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
Topological Quantum Distillation
Bombin, H., & Martin-Delgado, M. A. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.180501 · Cited by 700
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
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 · cited 1×
“This intuition is confirmed by the concatenated construction [16] (and the subsequent improvements [18], [40]) improving upon the hashing lower bound on the capacity of the depolarizing channel.”
BackgroundGuest column: the quantum PCP conjecture
Aharonov, D., Arad, I., & Vidick, T. (2013) · ACM SIGACT News · doi:10.1145/2491533.2491549 · Cited by 185
Homological error correction: Classical and quantum codes
Bombín, H., & Martin-Delgado, M. A. (2007) · Journal of Mathematical Physics · doi:10.1063/1.2731356 · Cited by 176
Research works printed but not linked: 18
- postol, 2001, A Proposed Quantum Low Density Parity Check Code
- macwilliams, 1986, The Theory of Error-Correcting Codes
- lou, 2006, On the application of error-correcting codes with low-density generator matrix over different quantum channels, Proc 4th Int Symp TURBOCODING, 1
- camara, 2005, Constructions and performance of classes of quantum LDPC codes
- freedman, 2002, Mathematics of Quantum Computation, 287
- 10.1109/GLOCOM.2008.ECP.217 · DOI
- aly, 2007, A Class of Quantum LDPC Codes Derived from Latin Squares and Combinatorial Objects
- 10.1109/ITW.2012.6404686 · doi:10.1109/itw.2012.6404686
- kim, 2007, Quantum Codes on Hurwitz Surfaces
- 10.1109/ISIT.2012.6284205 · doi:10.1109/isit.2012.6284205
- bacon, 2006, Quantum error correcting subsystem codes from two classical linear codes, Proc 44th Allerton Conf Commun Control Comput, 1
- aharonov, 2013, Quantum locally testable codes
- gottesman, 1997, Stabilizer codes and quantum error correction
- garcia-frias, 2008, Design of near-optimum quantum error-correcting codes based on generator and parity-check matrices of LDGM codes, Proc 40th Annu CISS, 562
- gottesman, 2013, What is the overhead required for fault-tolerant quantum computation?
- hsieh, 2012, Quantum quasi-cyclic low-density parity check codes, Proc Military Commun Conf, 1
- 10.1109/TIT.1968.1054190 · doi:10.1109/tit.1968.1054190
- tillich, 2009, Quantum LDPC codes with positive rate and minimum distance proportional to <formula formulatype="inline"><tex Notation="TeX">$n^{{1}\over{2}}$</tex></formula>, Proc IEEE ISIT, 799
Cited by
Quantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
Roads towards fault-tolerant universal quantum computation
Campbell, E. T., Terhal, B. M., & Vuillot, C. (2017) · Nature · doi:10.1038/nature23460 · Cited by 596
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
“Multiple variants of the LDPC codes have been proposed recently including hyperbolic surface codes [30], hypergraph product [31], balanced product codes [32], two-block codes based on finite groups [33, 34, 35, 36], and quantum Tanner codes [37, 38].”
Quantum error correction: an introductory guide
Roffe, J. (2019) · Contemporary Physics · doi:10.1080/00107514.2019.1667078 · Cited by 356
The future of quantum computing with superconducting qubits
Bravyi, S., Dial, O., Gambetta, J. M., Gil, D., & Nazario, Z. (2022) · Journal of Applied Physics · doi:10.1063/5.0082975 · Cited by 334
Quantum Low-Density Parity-Check Codes
Breuckmann, N. P., & Eberhardt, J. N. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040101 · Cited by 328
Bonilla Ataides, J. P., Tuckett, D. K., Bartlett, S. D., Flammia, S. T., & Brown, B. J. (2021) · Nature Communications · doi:10.1038/s41467-021-22274-1 · Cited by 262
Asymptotically good Quantum and locally testable classical LDPC codes
Panteleev, P., & Kalachev, G. (2022) · Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing · doi:10.1145/3519935.3520017 · Cited by 222
“…that for every a, a ′ ∈ A , b, b ′ ∈ B , and r, r ′ ∈ R we have: and for every λ ∈ F q we get: We should note that if R = F q , then the lifted product is equivalent to the product construction from [29], while if, in addition, we have m = n = 1, then it is the same as the hypergraph product [31].”
BackgroundDecoding across the quantum low-density parity-check code landscape
Roffe, J., White, D. R., Burton, S., & Campbell, E. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.043423 · Cited by 192
Flag fault-tolerant error correction with arbitrary distance codes
Chamberland, C., & Beverland, M. E. (2018) · Quantum · doi:10.22331/q-2018-02-08-53 · Cited by 159
Fault-Tolerant quantum computation with constant overhead
Gottesman, D. (2014) · Quantum Information and Computation · doi:10.26421/qic14.15-16-5 · Cited by 172
Focus beyond Quadratic Speedups for Error-Corrected Quantum Advantage
Babbush, R., McClean, J. R., Newman, M., Gidney, C., Boixo, S., & Neven, H. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010103 · Cited by 148
Leverrier, A., & Zemor, G. (2022) · 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) · doi:10.1109/focs54457.2022.00117 · Cited by 140
Constant overhead quantum fault tolerance with quantum expander codes
Fawzi, O., Grospellier, A., & Leverrier, A. (2021) · Communications of the ACM · doi:10.1145/3434163 · Cited by 111
Low-overhead fault-tolerant quantum computing using long-range connectivity
Cohen, L. Z., Kim, I. H., Bartlett, S. D., & Brown, B. J. (2022) · Science Advances · doi:10.1126/sciadv.abn1717 · Cited by 98
Constant-Overhead Quantum Error Correction with Thin Planar Connectivity
Tremblay, M. A., Delfosse, N., & Beverland, M. E. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.050504 · Cited by 83
Subsystem codes with high thresholds by gauge fixing and reduced qubit overhead
Higgott, O., & Breuckmann, N. P. (2021) · Physical Review X · doi:10.1103/physrevx.11.031039 · Cited by 48
Localized statistics decoding for quantum low-density parity-check codes
Hillmann, T., Berent, L., Quintavalle, A. O., Eisert, J., Wille, R., & Roffe, J. (2025) · Nature Communications · doi:10.1038/s41467-025-63214-7 · Cited by 37
Quantum Error Correction For Dummies
Chatterjee, A., Phalak, K., & Ghosh, S. (2023) · 2023 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00017 · Cited by 35
Gidney, C., Newman, M., Brooks, P., & Jones, C. (2025) · Nature Communications · doi:10.1038/s41467-025-59714-1 · Cited by 85
Entangling Four Logical Qubits beyond Break-Even in a Nonlocal Code
Hong, Y., Durso-Sabina, E., Hayes, D., & Lucas, A. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.180601 · Cited by 29
Hierarchical memories: Simulating quantum LDPC codes with local gates
Pattison, C. A., Krishna, A., & Preskill, J. (2023) · arXiv · doi:10.48550/arxiv.2303.04798 · Cited by 20
Distance-preserving stabilizer measurements in hypergraph product codes
Manes, A. G., & Claes, J. (2025) · Quantum · doi:10.22331/q-2025-01-30-1618 · Cited by 17
A Numerical Study of Bravyi-Bacon-Shor and Subsystem Hypergraph Product Codes
Li, M., & Yoder, T. J. (2020) · 2020 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00024 · Cited by 12
“[6] Let H1 ∈ {0, 1}nT1 ×n1 and H2 ∈ {0, 1}nT2 ×n2 .”
BackgroundPower and Limitations of Linear Programming Decoder for Quantum LDPC Codes
Gu, S., & Soleimanifar, M. (2025) · arXiv · doi:10.48550/arxiv.2508.04769 · Cited by 2
Gottesman-Kitaev-Preskill codes: A lattice perspective
Conrad, J., Eisert, J., & Arzani, F. (2022) · Quantum · doi:10.22331/q-2022-02-10-648
“The idea behind this construction is akin to product constructions known for qubit quantum error correcting codes, namely the hypergraph product codes by Tillich and Zemor [45], where the defining structure of the code is a hypergraph, and Homological product codes by Bravyi and Hastings [46], where the code is define…”
Metadata
- Authors
- Tillich, J.-P., & Zemor, G.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2014-02
- Volume
- 60
- Issue
- 2
- Pages
- 1193-1202
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2616493737
- Cited by
- 288
- References
- 26
- FWCI
- 6.93
- 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.