CoChat

Balanced Product Quantum Codes

Open access
Breuckmann, Nikolas P., Eberhardt, Jens N. · 2021 · IEEE Transactions on Information Theory
Cited by 140

The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.

Abstract

This work provides the first explicit and non-random family of [[N,K,D]] LDPC quantum codes which encode K ∈ Θ(N4/5) logical qubits with distance D ∈ Ω(N3/5). The family is constructed by amalgamating classical codes and Ramanujan graphs via an operation called balanced product. Recently, Hastings-Haah-O'Donnell and Panteleev-Kalachev were the first to show that there exist families of LDPC quantum codes which break the polylog(N)√N distance barrier. However, their constructions are based on probabilistic arguments which only guarantee the code parameters with high probability whereas our bounds hold unconditionally. Further, balanced products allow for non-abelian twisting of the check matrices, leading to a construction of LDPC quantum codes that can be shown to have K ∈ Θ(N) and that we conjecture to have linear distance D ∈ Θ(N).

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/tit.2021.3097347

Cites

4 of 4 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

Show all 4 references

Cited by

See all 140

Metadata

Authors
Breuckmann, N. P., & Eberhardt, J. N.
Venue
IEEE Transactions on Information Theory
Published
2021-10
Volume
67
Issue
10
Pages
6653-6674
ISSN
  • 0018-9448 (ISSN-L)
  • 1557-9654
OpenAlex
W3112993639
Cited by
140
References
4
FWCI
6.62
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: Balanced Product Quantum Codes. https://app.cochat.ai/papers/10.1109/tit.2021.3097347
The paper
Breuckmann, N. P., & Eberhardt, J. N. (2021). Balanced Product Quantum Codes. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2021.3097347

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.