Fault-tolerant architectures for superconducting qubits
Open accessThe DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Abstract
In this short review, I draw attention to new developments in the theory of fault tolerance in quantum computation that may give concrete direction to future work in the development of superconducting qubit systems. The basics of quantum error-correction codes, which I will briefly review, have not significantly changed since their introduction 15 years ago. But an interesting picture has emerged of an efficient use of these codes that may put fault-tolerant operation within reach. It is now understood that two-dimensional surface codes, close relatives of the original toric code of Kitaev, can be adapted as shown by Raussendorf and Harrington to effectively perform logical gate operations in a very simple planar architecture, with error thresholds for fault-tolerant operation simulated to be 0.75%. This architecture uses topological ideas in its functioning, but it is not 'topological quantum computation'—there are no non-abelian anyons in sight. I offer some speculations on the crucial pieces of superconducting hardware that could be demonstrated in the next couple of years that would be clear stepping stones towards this surface-code architecture.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
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
DiVincenzo, D. P. (1995) · Science · doi:10.1126/science.270.5234.255 · Cited by 1,651
Self-citationQuantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184 · cited 2×
“But, as also recognized from the beginning (especially in [7]), and going on all the way to Knill’s work [17], these estimates are based on unrealistic views of how a quantum computer could be put together.”
BackgroundTwo-bit gates are universal for quantum computation
DiVincenzo, D. P. (1995) · Physical Review A · doi:10.1103/physreva.51.1015 · Cited by 1,069
Self-citationFault-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
Stabilizer Codes and Quantum Error Correction
Gottesman, D. (1997) · arXiv · doi:10.48550/arxiv.quant-ph/9705052 · Cited by 753
A Potentially Realizable Quantum Computer
Lloyd, S. (1993) · Science · doi:10.1126/science.261.5128.1569 · Cited by 649
Quantum Computer Science: An Introduction
Mermin, N. D. (2007) · doi:10.1017/cbo9780511813870 · Cited by 592
Experimental Quantum Error Correction
Cory, D. G., Price, M. D., Maas, W., Knill, E., Laflamme, R., Zurek, W. H., Havel, T. F., & Somaroo, S. S. (1998) · Physical Review Letters · doi:10.1103/physrevlett.81.2152 · Cited by 581 · cited 1×
“NMR experiments [14], but its demonstration in a modern,”
BackgroundSimple quantum error-correcting codes
Steane, A. M. (1996) · Physical Review A · doi:10.1103/physreva.54.4741 · Cited by 522
Cited by
Surface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059
Quantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
A Survey on quantum computing technology
Gyongyosi, L., & Imre, S. (2019) · Computer Science Review · doi:10.1016/j.cosrev.2018.11.002 · Cited by 646
Surface code quantum computing by lattice surgery
Horsman, D., Fowler, A. G., Devitt, S., & Meter, R. V. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/12/123011 · Cited by 598
“However, the requirement for transversal two-qubit gates has previously made a planar encoding unfeasible for many systems where the physical qubits are confined in 2D and subject only to NN interactions, such as quantum dots [13, 14], superconducting qubits [15, 16], trapped atoms [17], nitrogen–vacancy diamond array…”
BackgroundProspects for Spin-Based Quantum Computing in Quantum Dots
Kloeffel, C., & Loss, D. (2013) · Annual Review of Condensed Matter Physics · doi:10.1146/annurev-conmatphys-030212-184248 · Cited by 411
Metadata
- Authors
- DiVincenzo, D. P.
- Venue
- Physica Scripta
- Publisher
- IOP Publishing
- Published
- 2009-12
- Volume
- T137
- Pages
- 014020
- ISSN
- 0031-8949 (ISSN-L)
- 1402-4896
- OpenAlex
- W1985127731
- Cited by
- 90
- References
- 14
- FWCI
- 6.51
- Type
- journal article
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Fault-tolerant architectures for superconducting qubits. https://app.cochat.ai/papers/10.1088/0031-8949/2009/t137/014020
- The paper
- DiVincenzo, D. P. (2009). Fault-tolerant architectures for superconducting qubits. Physica Scripta. https://doi.org/10.1088/0031-8949/2009/t137/014020
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.