Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 288

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 access
Tillich, Jean-Pierre, Zemor, Gilles · 2014 · IEEE Transactions on Information Theory

Abstract

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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1109/tit.2013.2292061

Cites

26 of 26 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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Show all 26 references

Research works printed but not linked: 18

  1. postol, 2001, A Proposed Quantum Low Density Parity Check Code
  2. macwilliams, 1986, The Theory of Error-Correcting Codes
  3. lou, 2006, On the application of error-correcting codes with low-density generator matrix over different quantum channels, Proc 4th Int Symp TURBOCODING, 1
  4. camara, 2005, Constructions and performance of classes of quantum LDPC codes
  5. freedman, 2002, Mathematics of Quantum Computation, 287
  6. 10.1109/GLOCOM.2008.ECP.217 · DOI
  7. aly, 2007, A Class of Quantum LDPC Codes Derived from Latin Squares and Combinatorial Objects
  8. 10.1109/ITW.2012.6404686 · doi:10.1109/itw.2012.6404686
  9. kim, 2007, Quantum Codes on Hurwitz Surfaces
  10. 10.1109/ISIT.2012.6284205 · doi:10.1109/isit.2012.6284205
  11. bacon, 2006, Quantum error correcting subsystem codes from two classical linear codes, Proc 44th Allerton Conf Commun Control Comput, 1
  12. aharonov, 2013, Quantum locally testable codes
  13. gottesman, 1997, Stabilizer codes and quantum error correction
  14. 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
  15. gottesman, 2013, What is the overhead required for fault-tolerant quantum computation?
  16. hsieh, 2012, Quantum quasi-cyclic low-density parity check codes, Proc Military Commun Conf, 1
  17. 10.1109/TIT.1968.1054190 · doi:10.1109/tit.1968.1054190
  18. 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

See all 288

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength. https://app.cochat.ai/papers/10.1109/tit.2013.2292061
The paper
Tillich, J.-P., & Zemor, G. (2014). Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2013.2292061

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.