Cited by 328Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum many-body systems

Quantum Low-Density Parity-Check Codes

Open access
Breuckmann, Nikolas P., Eberhardt, Jens Niklas·2021·PRX Quantum

Abstract

Quantum error correction is an indispensable ingredient for scalable quantum computing.In this Perspective we discuss a particular class of quantum codes called "quantum low-density parity-check (LDPC) codes."The codes we discuss are alternatives to the surface code, which is currently the leading candidate to implement quantum fault tolerance.We introduce the zoo of quantum LDPC codes and discuss their potential for making quantum computers robust with regard to noise.In particular, we explain recent advances in the theory of quantum LDPC codes related to certain product constructions and discuss open problems in the field.

Integrity signals

Registry

Crossref · 10.1103/prxquantum.2.040101

Cites

10 of 10 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Junction-based architectures open the design space for fault tolerance to high-efficiency encodings, transversal logic, low-overhead magic state factories and single-shot error correction.

    “Junction-based architectures should allow QCCD machines to maintain all-to-all connectivity for large numbers of qubits, opening the design space for fault tolerance to high-efficiency encodings58, transversal logic59,60, low-overhead magic state factories61 and single-shot error correction62–76.”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Breuckmann, N. P., & Eberhardt, J. N.
Affiliations
  • University College London (GB)
  • University of Bonn (DE)
Venue
PRX Quantum
Published
2021-10-11
Volume
2
Issue
4
ISSN
2691-3399 (ISSN-L)
OpenAlex
W3207755657
Cited by
328
References
10
Citations by year
2026: 67 · 2025: 124 · 2024: 74 · 2023: 34 · 2022: 26 · 2021: 3
FWCI
12.10
Type
journal article
Language
en
Open access
Locations
  • PRX Quantum (publishedVersion, cc-by)
  • Explore Bristol Research (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • UCL Discovery (University College London) (submittedVersion)
  • arXiv (Cornell University)
Funders
EPSRC (EP/S005021/1)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
Keywords
quantum low-density parity-check codes, quantum error correction, surface code, quantum fault tolerance, product construction, noise robustness, quantum error-correcting codes

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