The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Optimal resources for topological two-dimensional stabilizer codes: Comparative study
Open accessAbstract
We study the resources needed to construct topological two-dimensional stabilizer codes as a way to estimate in part their efficiency, and this leads us to perform a comparative study of surface codes and color codes. This study clarifies the similarities and differences between these two types of stabilizer code. We compute the topological error-correcting rate $C\ensuremath{\mathrel{:=}}n∕{d}^{2}$ for surface codes ${C}_{s}$ and color codes ${C}_{c}$ in several instances. On the torus, typical values are ${C}_{s}=2$ and ${C}_{c}=3∕2$, but we find that the optimal values are ${C}_{s}=1$ and ${C}_{c}=9∕8$. For planar codes, a typical value is ${C}_{s}=2$, while we find that the optimal values are ${C}_{s}=1$ and ${C}_{c}=3∕4$. In general, a color code encodes twice as many logical qubits as does a surface code.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“Depending on the scheme being used, typically between 7 [55] and 9 [56][57][58] physical qubits are needed to represent the state of one qubit.”
From Neutral atom quantum computing hardware: performance and end-user perspective (2023) · cites this paper as [57]
In the citing paper
“Colour codes10,35 allow for more efficient logical operations and require fewer qubits than the surface code to encode a logical qubit at a fixed code distance36.”
From Scaling and logic in the colour code on a superconducting quantum processor (2025) · cites this paper as [36]
Citations
Cites
Fault-tolerant quantum computation by anyons
Kitaev, A. Y. (2003) · Annals of Physics · doi:10.1016/s0003-4916(02)00018-0 · Cited by 7,238
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
Error Correcting Codes in Quantum Theory
Steane, A. M. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.793 · Cited by 2,677
Quantum Field Theory of Many-Body Systems
Wen, X.-G. (2007) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199227259.001.0001 · Cited by 2,027
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499754 · Cited by 1,768
String-net condensation: A physical mechanism for topological phases
Levin, M., & Wen, X.-G. (2005) · Physical Review B · doi:10.1103/physrevb.71.045110 · Cited by 1,598
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2001) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,485
Class of quantum error-correcting codes saturating the quantum Hamming bound
Gottesman, D. (1996) · Physical Review A · doi:10.1103/physreva.54.1862 · Cited by 1,227 · cited 2×
“A suitable formalism to study quantum error correction codes is the stabilizer formalism [4].”
MethodTOPOLOGICAL ORDERS IN RIGID STATES
WEN, X. G. (1990) · International Journal of Modern Physics B · doi:10.1142/s0217979290000139 · Cited by 1,115
Wen, X. G., & Niu, Q. (1990) · Physical Review B · doi:10.1103/physrevb.41.9377 · Cited by 938
Fault-Tolerant Quantum Computation with High Threshold in Two Dimensions
Raussendorf, R., & Harrington, J. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.190504 · Cited by 812
Topological Quantum Distillation
Bombin, H., & Martin-Delgado, M. A. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.180501 · Cited by 700
Self-citationTopological fault-tolerance in cluster state quantum computation
Raussendorf, R., Harrington, J., & Goyal, K. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/6/199 · Cited by 617
Quantum codes on a lattice with boundary
Bravyi, S. B., & Kitaev, A. Y. (1998) · arXiv · doi:10.48550/arxiv.quant-ph/9811052 · Cited by 394
Topological Characterization of Quantum Phase Transitions in a Spin- 1/2 Model
Feng, X.-Y., Zhang, G.-M., & Xiang, T. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.087204 · Cited by 361
Topological Computation without Braiding
Bombín, H., & Martin-Delgado, M. A. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.160502 · Cited by 206
Self-citationExact topological quantum order in D=3 and beyond: Branyons and brane-net condensates
Bombín, H., & Martin-Delgado, M. A. (2007) · Physical Review B · doi:10.1103/physrevb.75.075103 · Cited by 146
Self-citationHomological error correction: Classical and quantum codes
Bombín, H., & Martin-Delgado, M. A. (2007) · Journal of Mathematical Physics · doi:10.1063/1.2731356 · Cited by 145
Self-citationAdiabatic Preparation of Topological Order
Hamma, A., & Lidar, D. A. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.030502 · Cited by 114
Homological Error Correction: Classical and Quantum Codes
Bombín, H., & Martín-Delgado, M. A. (2006) · CERN Document Server (European Organization for Nuclear Research) · Cited by 74
Topological quantum error correction with optimal encoding rate
Bombín, H., & Martin-Delgado, M. A. (2006) · Physical Review A · doi:10.1103/physreva.73.062303 · Cited by 40
Self-citation
Cited by
Sorted by citations
Quantum error correction for beginners
Devitt, S. J., Munro, W. J., & Nemoto, K. (2013) · Reports on Progress in Physics · doi:10.1088/0034-4885/76/7/076001 · Cited by 842
Realizing repeated quantum error correction in a distance-three surface code
Krinner, S., Lacroix, N., Remm, A., Di Paolo, A., Genois, E., Leroux, C., Hellings, C., Lazar, S., Swiadek, F., Herrmann, J., et al. (2022) · Nature · doi:10.1038/s41586-022-04566-8 · Cited by 686
Building logical qubits in a superconducting quantum computing system
Gambetta, J., Chow, J. M., & Steffen, M. (2017) · npj Quantum Information · doi:10.1038/s41534-016-0004-0 · Cited by 680
Quantum error correction: an introductory guide
Roffe, J. (2019) · Contemporary Physics · doi:10.1080/00107514.2019.1667078 · Cited by 461
Engineered Open Systems and Quantum Simulations with Atoms and Ions
Müller, M., Diehl, S., Pupillo, G., & Zoller, P. (2012) · Advances in atomic, molecular, and optical physics · doi:10.1016/b978-0-12-396482-3.00001-6 · Cited by 337
Metadata
- Authors
- Bombin, H., & Martin-Delgado, M. A.
- Affiliations
- Universidad Complutense de Madrid (ES)
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2007-07-06
- Volume
- 76
- Issue
- 1
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2026181396
- Cited by
- 178
- References
- 21
- Citations by year
- 2026: 13 · 2025: 35 · 2024: 18 · 2023: 13 · 2022: 13 · 2021: 10 · 2020: 5 · 2019: 13 · 2018: 13 · 2017: 10 · 2016: 7 · 2015: 4 · 2014: 5 · 2013: 5 · 2012: 5
- FWCI
- 2.76
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Physical Review A (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- surface code, color codes, two-dimensional codes, logical qubit encoding, toric code, quantum error correction, resource efficiency
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