Quantum Expander Codes
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
We present an efficient decoding algorithm for constant rate quantum hyper graph-product LDPC codes which provably corrects adversarial errors of weight proportional to the code minimum distance, or equivalently to the square-root of the block length. The algorithm runs in time linear in the number of qubits, which makes its performance the strongest to date for linear-time decoding of quantum codes. The algorithm relies on expanding properties, not of the quantum code's factor graph directly, but of the factor graph of the original classical code it is constructed from.
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
Edmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428 · cited 1×
“This is due to the fact that the underlying classical codes CX and CZ are cycle codes of graphs: full decoding, which is NP-hard in general for linear codes, can be achieved for cycle codes of graphs in polynomial time (with the help of Edmonds’ weighted matching algorithm [9]), and this strategy (which does not reall…”
BackgroundFault-Tolerant quantum computation with constant overhead
Gottesman, D. (2014) · Quantum Information and Computation · doi:10.26421/qic14.15-16-5 · Cited by 172 · cited 3×
“Among recent developments, the recent paper [15] has shown how fault tolerant quantum computation with constant multiple overhead can be obtained, and quantum LDPC codes are an essential component of the scheme, making them possibly even more appealing.”
BackgroundInfluentialQuantum Hamiltonian Complexity
Gharibian, S., Huang, Y., Landau, Z., & Shin, S. W. (2015) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000066 · Cited by 144
Cited by
Quantum Low-Density Parity-Check Codes
Breuckmann, N. P., & Eberhardt, J. N. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040101 · Cited by 328
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
“As for the quantum codes from Theorem 2, we conjecture that it is also possible with a variant of the small-set-flip decoding algorithm from [22] (see also [20]).”
MethodDecoding 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
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
“When applying this construction with a classical expander code [12], it yields a so-called quantum expander code [13].”
BackgroundMethodInfluentialSelf-citationLow-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
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
“…construction has led to further development of decoders [19–25], logical gates [26, 27], and low-depth stabilizer measurement circuits [28, 29], and it has been recently demonstrated that HGP codes can be designed to be compatible with modular architectures [30] and reconfigurable atom…”
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
Power 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
Metadata
- Authors
- Leverrier, A., Tillich, J.-P., & Zemor, G.
- Venue
- 2015 IEEE 56th Annual Symposium on Foundations of Computer Science
- Publisher
- IEEE
- Published
- 2015-10
- Pages
- 810-824
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W1841286492
- Cited by
- 86
- References
- 3
- FWCI
- 1.89
- Type
- conference paper
- 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.