CoChat

Quantum Expander Codes

Open access
Leverrier, Anthony, Tillich, Jean-Pierre, Zemor, Gilles · 2015 · 2015 IEEE 56th Annual Symposium on Foundations of Computer Science
Cited by 86

The 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/focs.2015.55

Cites

3 of 3 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

  • Paths, Trees, and Flowers

    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…”
    Background
  • Fault-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.”
    BackgroundInfluential
  • Quantum 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

See all 86

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.