Fault-Tolerant Quantum Computation with High Threshold in Two Dimensions
Open accessAbstract
We present a scheme of fault-tolerant quantum computation for a local architecture in two spatial dimensions. The error threshold is 0.75% for each source in an error model with preparation, gate, storage, and measurement errors.
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?
Fault-tolerant quantum computing can be attained by encoding non-Abelian anyons in topological materials or applying QEC codes.
“Fault-tolerant quantum computing can be attained by encoding non-Abelian anyons in topological materials (Kitaev, 2003) or applying QEC codes (Raussendorf and Harrington, 2007).”
From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Raussendorf and Harrington, 2007
A topological method of fault-tolerance can be achieved.
“A topological method of fault-tolerance can then be achieved 77 .”
From Measurement-based quantum computation (2009) · cites this paper as [77]
There exists a circuit variant of fault-tolerant cluster-state computation that only requires a two-dimensional lattice of qubits and translation-invariant nearest-neighbor interaction.
“Finally, by way of the described mapping between the 3D cluster state and a 2D surface code changing in time, there exist a circuit variant of fault-tolerant cluster-state computation which only requires a two-dimensional lattice of qubits. Also this 2D variant only requires translationinvariant nearest-neighbor interaction.”
From Measurement-based quantum computation (2009) · cites this paper as [77]
The 2D variant yields a threshold value of 7.5 × 10^-3, which is the highest known threshold for a two-dimensional local architecture.
“It yields a threshold value of 7 . 5 × 10 -3 77 which is the highest known threshold for a two-dimensional local architecture (see also 78 ).”
From Measurement-based quantum computation (2009) · cites this paper as [77]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
<i>Quantum Computation and Quantum Information</i>
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895 · see citing works
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 20,449 · see citing works
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 · see citing works
Edmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428 · see citing works
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499754 · Cited by 1,768 · see citing works
Measurement-based quantum computation on cluster states
Raussendorf, R., Browne, D. E., & Briegel, H. J. (2003) · Physical Review A · doi:10.1103/physreva.68.022312 · Cited by 1,655 · see citing works
Self-citationUniversal quantum computation with ideal Clifford gates and noisy ancillas
Bravyi, S., & Kitaev, A. (2005) · Physical Review A · doi:10.1103/physreva.71.022316 · Cited by 1,525 · see citing works
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2001) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,485 · see citing works
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184 · see citing works
Entanglement of Atoms via Cold Controlled Collisions
Jaksch, D., Briegel, H.-J., Cirac, J. I., Gardiner, C. W., & Zoller, P. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.1975 · Cited by 795 · see citing works
Topological Quantum Distillation
Bombin, H., & Martin-Delgado, M. A. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.180501 · Cited by 700 · see citing works
Quantum accuracy threshold for concatenated distance-3 code
Aliferis, P., Gottesman, D., & Preskill, J. (2006) · Quantum Information and Computation · doi:10.26421/qic6.2-1 · Cited by 412 · see citing works
A fault-tolerant one-way quantum computer
Raussendorf, R., Harrington, J., & Goyal, K. (2006) · Annals of Physics · doi:10.1016/j.aop.2006.01.012 · Cited by 397 · see citing works
Self-citationResilient quantum computation: error models and thresholds
Knill, E., Laflamme, R., & Zurek, W. H. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0166 · Cited by 346 · see citing works
Wang, C., Harrington, J., & Preskill, J. P. (2003) · Annals of Physics · doi:10.1016/s0003-4916(02)00019-2 · Cited by 330 · see citing works
Self-citationResilient Quantum Computation: Error Models and Thresholds
Knill, E. H., Laflamme, R., & Zurek, W. H. (1997) · CERN Document Server (European Organization for Nuclear Research) · Cited by 299 · see citing works
Dawson, C. M., & Nielsen, M. A. (2006) · Quantum Information and Computation · doi:10.26421/qic6.1-6 · Cited by 288 · see citing works
Dawson, C. M., & Nielsen, M. A. (2005) · CERN Document Server (European Organization for Nuclear Research) · Cited by 254 · see citing works
Universal quantum computation with the ν=5∕2 fractional quantum Hall state
Bravyi, S. B. (2006) · Physical Review A · doi:10.1103/physreva.73.042313 · Cited by 247 · see citing works
Braid Topologies for Quantum Computation
Bonesteel, N. E., Hormozi, L., Zikos, G., & Simon, S. H. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.140503 · Cited by 206 · see citing works
T-junction ion trap array for two-dimensional ion shuttling, storage, and manipulation
Hensinger, W. K., Olmschenk, S., Stick, D., Hucul, D., Yeo, M., Acton, M., Deslauriers, L., Monroe, C., & Rabchuk, J. (2006) · Applied Physics Letters · doi:10.1063/1.2164910 · Cited by 164 · see citing works
T-junction ion trap array for two-dimensional ion shuttling, storage and manipulation
Hensinger, W. K., Acton, M., Deslauriers, L., Hucul, D., Monroe, C., Olmschenk, S., Rabchuk, J., Stick, D., & Yeo, M. (2005) · CERN Document Server (European Organization for Nuclear Research) · Cited by 156 · see citing works
Ohno, T., Arakawa, G., Ichinose, I., & Matsui, T. (2004) · Nuclear Physics B · doi:10.1016/j.nuclphysb.2004.07.003 · Cited by 81 · see citing works
Exact location of the multicritical point for finite-dimensional spin glasses: a conjecture
Takeda, K., Sasamoto, T., & Nishimori, H. (2005) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/38/17/004 · Cited by 34 · see citing works
Flagged first, then by citations
Research works printed but not linked: 5
- [1]P. W. Shor, Proc. 37th Annual Symp. on the Foundations of Computer Science , 56 (IEEE, Los Alamitos, 1996).
- [2]E. Knill, R. Laflamme, and W. H. Zurek, Proc. Roy. Soc. London A 454 , 365 (1998).
- [3]D. Aharonov and M. Ben-Or, Proc. 29th Annual Symp. on Theory of Computing , 176 (ACM, New York, 1997); D. Aharonov and M. Ben-Or, quant-ph/9906129. · arXiv
- [4]D. Gottesman, Ph.D. thesis, Caltech (1997), quant-ph/9705052. · arXiv
- [8]H. Bombin and M. A. Delgado, Phys. Rev. Lett. 97 , 180501 (2006); H. Bombin and M.A. Delgado, quant-ph/0610024. · arXiv
Cited by
Sorted by citations
Ladd, T. D., Jelezko, F., Laflamme, R., Nakamura, Y., Monroe, C., & O’Brien, J. L. (2010) · Nature · doi:10.1038/nature08812 · Cited by 3,592 · see citing works
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 · see citing works
Noisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 1,726 · see citing works
Quantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354 · see citing works
Trapped-ion quantum computing: Progress and challenges
Bruzewicz, C. D., Chiaverini, J., McConnell, R., & Sage, J. M. (2019) · Applied Physics Reviews · doi:10.1063/1.5088164 · Cited by 1,483 · see citing works
Suppressing quantum errors by scaling a surface code logical qubit
Google Quantum, A. I., Acharya, R., Aleiner, I., Allen, R., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., Asfaw, A., Atalaya, J., et al. (2023) · Nature · doi:10.1038/s41586-022-05434-1 · Cited by 1,103 · see citing works
“Related methods have long been used for accuracy threshold calculations [35, 86–92] and non-Pauli errors [93], and even for simulating circuits with a small fraction of non-Clifford gates[94, 95].”
Measurement-based quantum computation
Briegel, H. J., Browne, D. E., Dür, W., Raussendorf, R., & Van den Nest, M. (2009) · Nature Physics · doi:10.1038/nphys1157 · Cited by 1,090 · see citing works
Self-citationRandomized benchmarking of quantum gates
Knill, E., Leibfried, D., Reichle, R., Britton, J., Blakestad, R. B., Jost, J. D., Langer, C., Ozeri, R., Seidelin, S., & Wineland, D. J. (2008) · Physical Review A · doi:10.1103/physreva.77.012307 · Cited by 1,019 · see citing works
Efficient Variational Quantum Simulator Incorporating Active Error Minimization
Li, Y., & Benjamin, S. C. (2017) · Physical Review X · doi:10.1103/physrevx.7.021050 · Cited by 686 · see citing works
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 · see citing works
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 · see citing works
“By contrast, in the defect-based code there are no transversal operations, and the CNOT is performed by braiding defects: extending a defect by measuring out qubits in a line, and passing this extended defect around the second logical qubit defect [3].”
BackgroundMethodA bright and fast source of coherent single photons
Tomm, N., Javadi, A., Antoniadis, N. O., Najer, D., Löbl, M. C., Korsch, A. R., Schott, R., Valentin, S. R., Wieck, A. D., Ludwig, A., et al. (2021) · Nature Nanotechnology · doi:10.1038/s41565-020-00831-x · Cited by 608 · see citing works
Quantum logic with spin qubits crossing the surface code threshold
Xue, X., Russ, M., Samkharadze, N., Undseth, B., Sammak, A., Scappucci, G., & Vandersypen, L. M. K. (2022) · Nature · doi:10.1038/s41586-021-04273-w · Cited by 524 · see citing works
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 · see citing works
Quantum computations on a topologically encoded qubit
Nigg, D., Müller, M., Martinez, E. A., Schindler, P., Hennrich, M., Monz, T., Martin-Delgado, M. A., & Blatt, R. (2014) · Science · doi:10.1126/science.1253742 · Cited by 400 · see citing works
Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
Babbush, R., Gidney, C., Berry, D. W., Wiebe, N., McClean, J., Paler, A., Fowler, A., & Neven, H. (2018) · Physical Review X · doi:10.1103/physrevx.8.041015 · Cited by 383 · see citing works
Layered architecture for quantum computing
Jones, N. C., Van Meter, R., Fowler, A. G., McMahon, P. L., Kim, J., Ladd, T. D., & Yamamoto, Y. (2012) · Physical Review X · doi:10.1103/physrevx.2.031007 · Cited by 332 · see citing works
Realization of an Error-Correcting Surface Code with Superconducting Qubits
Zhao, Y., Ye, Y., Huang, H.-L., Zhang, Y., Wu, D., Guan, H., Zhu, Q., Wei, Z., He, T., Cao, S., et al. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.030501 · Cited by 321 · see citing works
Halving the cost of quantum addition
Gidney, C. (2018) · Quantum · doi:10.22331/q-2018-06-18-74 · Cited by 279 · see citing works
Building a Fault-Tolerant Quantum Computer Using Concatenated Cat Codes
Chamberland, C., Noh, K., Arrangoiz-Arriola, P., Campbell, E. T., Hann, C. T., Iverson, J., Putterman, H., Bohdanowicz, T. C., Flammia, S. T., Keller, A., et al. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010329 · Cited by 281 · see citing works
Bonilla Ataides, J. P., Tuckett, D. K., Bartlett, S. D., Flammia, S. T., & Brown, B. J. (2021) · Nature Communications · doi:10.1038/s41467-021-22274-1 · Cited by 262 · see citing works
Optimal resources for topological two-dimensional stabilizer codes: Comparative study
Bombin, H., & Martin-Delgado, M. A. (2007) · Physical Review A · doi:10.1103/physreva.76.012305 · Cited by 178 · see citing works
Wei, Y.-J., He, Y.-M., Chen, M.-C., Hu, Y.-N., He, Y., Wu, D., Schneider, C., Kamp, M., Höfling, S., Lu, C.-Y., et al. (2014) · Nano Letters · doi:10.1021/nl503081n · Cited by 169 · see citing works
Fault-Tolerant quantum computation with constant overhead
Gottesman, D. (2014) · Quantum Information and Computation · doi:10.26421/qic14.15-16-5 · Cited by 172 · see citing works
Focus beyond Quadratic Speedups for Error-Corrected Quantum Advantage
Babbush, R., McClean, J. R., Newman, M., Gidney, C., Boixo, S., & Neven, H. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010103 · Cited by 148 · see citing works
Gidney, C., & Fowler, A. G. (2019) · Quantum · doi:10.22331/q-2019-04-30-135 · Cited by 152 · see citing works
Correcting coherent errors with surface codes
Bravyi, S., Englbrecht, M., König, R., & Peard, N. (2018) · npj Quantum Information · doi:10.1038/s41534-018-0106-y · Cited by 157 · see citing works
Fault-tolerant thresholds for quantum error correction with the surface code
Stephens, A. M. (2014) · Physical Review A · doi:10.1103/physreva.89.022321 · Cited by 133 · see citing works
Percolation, Renormalization, and Quantum Computing with Nondeterministic Gates
Kieling, K., Rudolph, T., & Eisert, J. (2007) · Physical Review Letters · doi:10.1103/physrevlett.99.130501 · Cited by 121 · see citing works
Quantum Algorithm for Spectral Measurement with a Lower Gate Count
Poulin, D., Kitaev, A., Steiger, D. S., Hastings, M. B., & Troyer, M. (2018) · Physical Review Letters · doi:10.1103/physrevlett.121.010501 · Cited by 108 · see citing works
Analog Quantum Error Correction with Encoding a Qubit into an Oscillator
Fukui, K., Tomita, A., & Okamoto, A. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.180507 · Cited by 104 · see citing works
Surface code implementation of block code state distillation
Fowler, A. G., Devitt, S. J., & Jones, C. (2013) · Scientific Reports · doi:10.1038/srep01939 · Cited by 99 · see citing works
Low-overhead fault-tolerant quantum computing using long-range connectivity
Cohen, L. Z., Kim, I. H., Bartlett, S. D., & Brown, B. J. (2022) · Science Advances · doi:10.1126/sciadv.abn1717 · Cited by 98 · see citing works
Mid-Circuit Cavity Measurement in a Neutral Atom Array
Deist, E., Lu, Y.-H., Ho, J., Pasha, M. K., Zeiher, J., Yan, Z., & Stamper-Kurn, D. M. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.203602 · Cited by 94 · see citing works
Fundamentals of universality in one-way quantum computation
Nest, M. V. D., Dür, W., Miyake, A., & Briegel, H. J. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/6/204 · Cited by 97 · see citing works
The ZX calculus is a language for surface code lattice surgery
de Beaudrap, N., & Horsman, D. (2020) · Quantum · doi:10.22331/q-2020-01-09-218 · Cited by 83 · see citing works
Beverland, M. E., Kubica, A., & Svore, K. M. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020341 · Cited by 82 · see citing works
A fault-tolerant non-Clifford gate for the surface code in two dimensions
Brown, B. J. (2020) · Science Advances · doi:10.1126/sciadv.aay4929 · Cited by 77 · see citing works
“The process is well characterized by connecting the surface code with the topological cluster-state model ( 9 , 25 ); a measurement-based model with a finite threshold error rate, below which it will function reliably at a suitably large system size.”
Minimizing resource overheads for fault-tolerant preparation of encoded states of the Steane code
Goto, H. (2016) · Scientific Reports · doi:10.1038/srep19578 · Cited by 61 · see citing works
Error rates and resource overheads of repetition cat qubits
Guillaud, J., & Mirrahimi, M. (2021) · Physical Review A · doi:10.1103/physreva.103.042413 · Cited by 55 · see citing works
Quantifying the effects of local many-qubit errors and nonlocal two-qubit errors on the surface code
Fowler, A. G., & Martinis, J. M. (2014) · Physical Review A · doi:10.1103/physreva.89.032316 · Cited by 49 · see citing works
Quantum simulation of interacting high-dimensional systems: The influence of noise
Dür, W., Bremner, M. J., & Briegel, H. J. (2008) · Physical Review A · doi:10.1103/physreva.78.052325 · Cited by 41 · see citing works
Leakage suppression in the toric code
Suchara, M., Cross, A. W., & Gambetta, J. M. (2015) · 2015 IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2015.7282629 · Cited by 38 · see citing works
Browne, D., & Briegel, H. (2016) · Quantum Information · doi:10.1002/9783527805785.ch21 · Cited by 29 · see citing works
Pipelined correlated minimum weight perfect matching of the surface code
Paler, A., & Fowler, A. G. (2023) · Quantum · doi:10.22331/q-2023-12-12-1205 · Cited by 22 · see citing works
Low-overhead quantum computing with the color code
Thomsen, F., Kesselring, M. S., Bartlett, S. D., & Brown, B. J. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.043125 · Cited by 15 · see citing works
A quantum processor based on coherent transport of entangled atom arrays
Bluvstein, D., Levine, H., Semeghini, G., Wang, T. T., Ebadi, S., Kalinowski, M., Keesling, A., Maskara, N., Pichler, H., Greiner, M., et al. (2022) · Nature · doi:10.1038/s41586-022-04592-6 · Cited by 14 · see citing works
Improving Threshold for Fault-Tolerant Color-Code Quantum Computing by Flagged Weight Optimization
Takada, Y., & Fujii, K. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.030352 · Cited by 10 · see citing works
- Authors
- Raussendorf, R., & Harrington, J.
- Affiliations
- Perimeter Institute (CA)
- Los Alamos National Laboratory (US)
- ORCID
- Raussendorf, Robert
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2007-05-11
- Volume
- 98
- Issue
- 19
- Pages
- 190504-190504
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2056281570
- Cited by
- 812
- References
- 24
- Citations by year
- 2026: 38 · 2025: 54 · 2024: 48 · 2023: 57 · 2022: 64 · 2021: 47 · 2020: 51 · 2019: 40 · 2018: 28 · 2017: 42 · 2016: 45 · 2015: 43 · 2014: 51 · 2013: 49 · 2012: 47
- FWCI
- 29.17
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Physical Review Letters (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- 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 › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- fault-tolerant quantum computing, error threshold, quantum error correction
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
