CoChat
Sign Up
Cited by 12Quantum Computing Algorithms and ArchitectureQuantum many-body systemsQuantum Information and Cryptography

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

A Numerical Study of Bravyi-Bacon-Shor and Subsystem Hypergraph Product Codes

Open access
Li, Muyuan, Yoder, Theodore J.·2020·2020 IEEE International Conference on Quantum Computing and Engineering (QCE)
DOI 10.1109/qce49297.2020.00024
Open this paper in CoChat — free accountOpen PDF

Abstract

We provide a numerical investigation of two families of subsystem quantum codes that are related to hypergraph product codes by gauge-fixing. The first family consists of the Bravyi-Bacon-Shor (BBS) codes which have optimal code parameters for subsystem quantum codes local in 2-dimensions. The second family consists of the constant rate “generalized Shor” codes of Bacon and Cassicino [1], which we re-brand as subsystem hypergraph product (SHP) codes. We show that any hypergraph product code can be obtained by entangling the gauge qubits of two SHP codes. To evaluate the performance of these codes, we simulate both small and large examples. For circuit noise, a [21], [4], [3] BBS code and a [49], [16], [3] SHP code have pseudthresholds of 2 × 10-3and 8 × 10-4, respectively. Simulations for phenomenological noise show that large BBS and SHP codes start to outperform surface codes with similar encoding rate at physical error rates 1 × 10-6and 4 × 10-4, respectively.

Overview

Integrity signals

Registry

Crossref · 10.1109/qce49297.2020.00024

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

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

Verification

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?

  • When 4 divides n, the anti-commutation of row and column operators of opposite Pauli type can be fixed by permuting qubits for different Pauli type row and column checks.

    “When 4∣n, this can be fixed by permuting the qubits for different Pauli type row and column checks.”

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

Citations

Cites

Flagged first, then by citations

Research works printed but not linked: 25

  1. 10.1109/18.556667 · DOI
  2. 10.1109/18.910577 · DOI
  3. bravyi, 2012, Subsys-tem surface codes with three-qubit check operators
  4. 10.1103/PhysRevA.99.052333 · DOI
  5. debroy, 2019, Logical performance of 9 qubit compass codes in ion traps with crosstalk errors
  6. 10.1103/PhysRevX.9.021041 · DOI
  7. 10.1109/TIT.1962.1057683 · DOI
  8. 10.1109/18.556668 · DOI
  9. 10.1145/3188745.3188886 · DOI
  10. 10.1109/ISIT.2000.866497 · DOI
  11. 10.1103/PhysRevLett.104.050503 · DOI
  12. aliferis, 2005, Quantum accuracy threshold for concatenated distance-3 codes, Quantum Inf Comput, 6, 97
  13. 10.1109/TIT.2013.2292061 · DOI
  14. 10.1109/FOCS.2018.00076 · DOI · Paper page
  15. 10.1109/FOCS.2015.55 · DOI
  16. 10.1103/PhysRevA.83.020302 · DOI
  17. grospellier, 2018, Numerical study of hypergraph product codes
  18. bacon, 2006, Quantum Error Correcting Subsystem Codes from Two Classical Linear Codes
  19. 10.1017/CBO9780511791338 · DOI
  20. 10.1109/18.910588 · DOI
  21. guruswami, 2006, Iterative decoding of low-density parity check codes (a survey)
  22. 10.1103/PhysRevA.96.032341 · DOI
  23. 10.1109/18.748992 · DOI
  24. 10.1088/1367-2630/ab3372 · DOI
  25. delfosse, 2017, Almost-linear time decoding algorithm for topological codes

Cited by

Sorted by citations

Metadata

Authors
Li, M., & Yoder, T. J.
Affiliations
IBM (United States) (US)
ORCID
Venue
2020 IEEE International Conference on Quantum Computing and Engineering (QCE)
Publisher
IEEE
Published
2020-10
Pages
109-119
DOI
10.1109/qce49297.2020.00024
OpenAlex
W3107454530
Cited by
12
References
2
Citations by year
2026: 2 · 2025: 1 · 2024: 1 · 2023: 2 · 2022: 1 · 2021: 3 · 2020: 1
FWCI
0.67
Type
conference paper
Language
en
Open access
Licence
Locations
  • IEEE International Conference on Quantum Computing and Engineering (QCE) (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • Office of the Director of National Intelligence
  • Intelligence Advanced Research Projects Activity through ARO (W911NF-16-1-0082)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
Keywords
hypergraph product codes, gauge fixing, surface code, quantum error correction, threshold, electronic noise, code rate

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