Topological and Subsystem Codes on Low-Degree Graphs with Flag Qubits
Open accessAbstract
A new proposed family of quantum error correcting codes and a scalable and efficient flag-based decoding scheme are suitable for implementation in superconducting qubit architectures and offer competitive performance to other error-correction schemes.
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.
Integrity signals
Registry
Cites
Statistics
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.
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?
Maintaining a low average node degree in superconducting quantum devices, typically less than three, is crucial to minimize frequency collisions and crosstalk errors.
“However, based on current knowledge, maintaining a low average node degree in superconducting quantum devices, typically less than three, is crucial to minimize frequency collisions and crosstalk errors [46].”
From Robust Qubit Mapping Algorithm via Double-Source Optimal Routing on Large Quantum Circuits (2024) · cites this paper as [46]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
The citation lists haven’t been fetched yet
References 43 · Cited by 223
Research works printed but not linked: 5
- T. Tansuwannont, C. Chamberland, and D. Leung, Flag Fault-Tolerant Error Correction for Cyclic CSS Codes, arXiv:1803.09758 [ · arXiv
- B. W. Reichardt, Fault-Tolerant Quantum Error Correction for Steane's Seven-Qubit Color Code with Few or No Extra Qubits, arXiv:1804.06995. · arXiv
- E. Magesan and J. M. Gambetta, Effective Hamiltonian Models of the Cross-Resonance Gate, arXiv:1804.04073v2. · arXiv
- C. Chamberland, A. Kubica, T. J. Yoder, and G. Zhu, Triangular Color Codes on Trivalent Graphs with Flag Qubits, arXiv:1911.00355. · arXiv
- G. Zhu, A. Lavasani, and M. Barkeshli, Instantaneous Braids and Dehn Twists in Topologically Ordered States, arXiv:1806.06078. · arXiv
- Authors
- Chamberland, C., Zhu, G., Yoder, T. J., Hertzberg, J. B., & Cross, A. W.
- Affiliations
- IBM Research - Thomas J. Watson Research Center (US)
- Venue
- Physical Review X
- Publisher
- American Physical Society (APS)
- Published
- 2020-01-31
- Volume
- 10
- Issue
- 1
- ISSN
- 2160-3308 (ISSN-L)
- OpenAlex
- W2963908124
- Cited by
- 223
- References
- 43
- Citations by year
- 2026: 16 · 2025: 27 · 2024: 47 · 2023: 38 · 2022: 43 · 2021: 32 · 2020: 18 · 2019: 2
- FWCI
- 12.87
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- Locations
- Physical Review X (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Artificial Intelligence › Coding theory and cryptography
- Keywords
- quantum error correction, topological codes, subsystem codes, superconducting qubits, scalable quantum hardware
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
