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

Distance-preserving stabilizer measurements in hypergraph product codes

Open access
Manes, Argyris Giannisis, Claes, Jahan·2025·Quantum

Abstract

Unlike the surface code, quantum low-density parity-check (QLDPC) codes can have a finite encoding rate, potentially lowering the error correction overhead. However, finite-rate QLDPC codes have nonlocal stabilizers, making it difficult to design stabilizer measurement circuits that are low-depth and do not decrease the effective distance. Here, we demonstrate that a popular family of finite-rate QLDPC codes, hypergraph product codes, has the convenient property of distance-robustness: any stabilizer measurement circuit preserves the effective distance. In particular, we prove the depth-optimal circuit in [Tremblay et al, PRL 129, 050504 (2022)] is also optimal in terms of effective distance.

Integrity signals

Registry

Crossref · 10.22331/q-2025-01-30-1618

Cites

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

  • The locality of small parity checks limits the damage caused by correlated errors.

    “Second, their locality limits the damage caused by correlated errors, sometimes for free28.”

    From Yoked surface codes (2025) · cites this paper as [28]

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Manes, A. G., & Claes, J.
Affiliations
Yale University (US)
Venue
Quantum
Published
2025-01-30
Volume
9
Pages
1618
ISSN
2521-327X (ISSN-L)
OpenAlex
W4406984728
Cited by
17
References
4
Citations by year
2026: 5 · 2025: 10 · 2024: 2
FWCI
6.07
Type
journal article
Language
en
Open access
Locations
  • Quantum (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion, cc-by-nc-nd)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • arXiv (Cornell University)
Funders
NSF (2137740)
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
hypergraph product codes, quantum low-density parity-check codes, stabilizer measurements, effective distance, quantum error correction

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