The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Surface code quantum computing with error rates over 1%
Open accessAbstract
Large-scale quantum computation will only be achieved if experimentally implementable quantum error correction procedures are devised that can tolerate experimentally achievable error rates. We describe an improved decoding algorithm for the Kitaev surface code, which requires only a two-dimensional square lattice of qubits that can interact with their nearest neighbors, that raises the tolerable quantum gate error rate to over 1%. The precise maximum tolerable error rate depends on the error model, and we calculate values in the range 1.1--1.4% for various physically reasonable models. These values represent a very high threshold error rate calculated in a constrained setting.
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
Edmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499754 · Cited by 1,768
Maximum matching and a polyhedron with 0,1-vertices
Edmonds, J. (1965) · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · doi:10.6028/jres.069b.013 · Cited by 1,712
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2001) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,485
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184
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
Jelezko, F., Gaebel, T., Popa, I., Domhan, M., Gruber, A., & Wrachtrup, J. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.130501 · Cited by 735
Topological 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
High-threshold universal quantum computation on the surface code
Fowler, A. G., Stephens, A. M., & Groszkowski, P. (2009) · Physical Review A · doi:10.1103/physreva.80.052312 · Cited by 486
Self-citationQuantum codes on a lattice with boundary
Bravyi, S. B., & Kitaev, A. Y. (1998) · arXiv · doi:10.48550/arxiv.quant-ph/9811052 · Cited by 394
Fast Decoders for Topological Quantum Codes
Duclos-Cianci, G., & Poulin, D. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.050504 · Cited by 244
Observation of Faraday rotation from a single confined spin
Atatüre, M., Dreiser, J., Badolato, A., & Imamoglu, A. (2007) · Nature Physics · doi:10.1038/nphys521 · Cited by 241
Robust Quantum State Transfer in Random Unpolarized Spin Chains
Yao, N. Y., Jiang, L., Gorshkov, A. V., Gong, Z.-X., Zhai, A., Duan, L.-M., & Lukin, M. D. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.040505 · Cited by 235
Nondestructive Optical Measurements of a Single Electron Spin in a Quantum Dot
Berezovsky, J., Mikkelsen, M. H., Gywat, O., Stoltz, N. G., Coldren, L. A., & Awschalom, D. D. (2006) · Science · doi:10.1126/science.1133862 · Cited by 202
Fault Tolerant Quantum Computation with Very High Threshold for Loss Errors
Barrett, S. D., & Stace, T. M. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.200502 · Cited by 164
Fault-tolerant architectures for superconducting qubits
Divincenzo, D. P. (2009) · Physica Scripta · doi:10.1088/0031-8949/2009/t137/014020 · Cited by 137
High-Contrast Dispersive Readout of a Superconducting Flux Qubit Using a Nonlinear Resonator
Lupaşcu, A., Driessen, E. F. C., Roschier, L., Harmans, C. J. P. M., & Mooij, J. E. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.127003 · Cited by 135
DISTRIBUTED QUANTUM COMPUTATION ARCHITECTURE USING SEMICONDUCTOR NANOPHOTONICS
VAN METER, R., LADD, T. D., FOWLER, A. G., & YAMAMOTO, Y. (2010) · International Journal of Quantum Information · doi:10.1142/s0219749910006435 · Cited by 109
Self-citationOptical lattices, ultracold atoms and quantum information processing
Jaksch, D. (2004) · Contemporary Physics · doi:10.1080/00107510410001705486 · Cited by 97
Scalable, High-Speed Measurement-Based Quantum Computer Using Trapped Ions
Stock, R., & James, D. F. V. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.170501 · Cited by 70
Scalable simultaneous multiqubit readout with 99.99% single-shot fidelity
Burrell, A. H., Szwer, D. J., Webster, S. C., & Lucas, D. M. (2010) · Physical Review A · doi:10.1103/physreva.81.040302 · Cited by 62
Photonic implementation for the topological cluster-state quantum computer
Herrera-Martí, D. A., Fowler, A. G., Jennings, D. H., & Rudolph, T. (2010) · Physical Review A · doi:10.1103/physreva.82.032332 · Cited by 61
Self-citationKruse, J., Gierl, C., Schlosser, M., & Birkl, G. (2010) · Physical Review A · doi:10.1103/physreva.81.060308 · Cited by 50
Topological one-way quantum computation on verified logical cluster states
Fujii, K., & Yamamoto, K. (2010) · Physical Review A · doi:10.1103/physreva.82.060301 · Cited by 20
Cluster-based architecture for fault-tolerant quantum computation
Fujii, K., & Yamamoto, K. (2010) · Physical Review A · doi:10.1103/physreva.81.042324 · Cited by 18
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
Self-citationQuantum computational chemistry
McArdle, S., Endo, S., Aspuru-Guzik, A., Benjamin, S. C., & Yuan, X. (2020) · Reviews of Modern Physics · doi:10.1103/revmodphys.92.015003 · Cited by 1,621
Quantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
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
“Of the many types of codes known, the surface code stands out as having the highest tolerance of component error ( 1% in recent results) when implemented on a simple 2-dimensional lattice of qubits with nearest-neighbour interactions [2, 3, 4, 5, 6].”
BackgroundSelf-citationNoise tailoring for scalable quantum computation via randomized compiling
Wallman, J. J., & Emerson, J. (2016) · Physical Review A · doi:10.1103/physreva.94.052325 · Cited by 535
Metadata
- Authors
- Wang, D. S., Fowler, A. G., & Hollenberg, L. C. L.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2011-02-18
- Volume
- 83
- Issue
- 2
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W1510818459
- Cited by
- 343
- References
- 25
- FWCI
- 24.25
- Type
- journal article
- Language
- en
- Open access
- green
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
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.