Cited by 7,720Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum Mechanics and Applications

The DOI matches its Crossref record; 57 of the 57 references it cites were found in a registry or an index.

Quantum supremacy using a programmable superconducting processor

Open access
Arute, Frank, Arya, Kunal, Babbush, Ryan, Bacon, Dave, Bardin, Joseph C., Barends, Rami, Biswas, Rupak, Boixo, Sergio, Brandao, Fernando G. S. L., Buell, David A., Burkett, Brian, Chen, Yu, Chen, Zijun, Chiaro, Ben, Collins, Roberto, Courtney, William, Dunsworth, Andrew, Farhi, Edward, Foxen, Brooks, Fowler, Austin, Gidney, Craig, Giustina, Marissa, Graff, Rob, Guerin, Keith, Habegger, Steve, Harrigan, Matthew P., Hartmann, Michael J., Ho, Alan, Hoffmann, Markus, Huang, Trent, Humble, Travis S., Isakov, Sergei V., Jeffrey, Evan, Jiang, Zhang, Kafri, Dvir, Kechedzhi, Kostyantyn, Kelly, Julian, Klimov, Paul V., Knysh, Sergey, Korotkov, Alexander, Kostritsa, Fedor, Landhuis, David, Lindmark, Mike, Lucero, Erik, Lyakh, Dmitry, Mandrà, Salvatore, McClean, Jarrod R., McEwen, Matthew, Megrant, Anthony, Mi, Xiao, Michielsen, Kristel, Mohseni, Masoud, Mutus, Josh, Naaman, Ofer, Neeley, Matthew, Neill, Charles, Niu, Murphy Yuezhen, Ostby, Eric, Petukhov, Andre, Platt, John C., Quintana, Chris, Rieffel, Eleanor G., Roushan, Pedram, Rubin, Nicholas C., Sank, Daniel, Satzinger, Kevin J., Smelyanskiy, Vadim, Sung, Kevin J., Trevithick, Matthew D., Vainsencher, Amit, Villalonga, Benjamin, White, Theodore, Yao, Z. Jamie, Yeh, Ping, Zalcman, Adam, Neven, Hartmut, Martinis, John M.·2019·Nature

Abstract

The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor1. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits2–7 to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 253 (about 1016). Measurements from repeated experiments sample the resulting probability distribution, which we verify using classical simulations. Our Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times—our benchmarks currently indicate that the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. This dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy8–14 for this specific computational task, heralding a much-anticipated computing paradigm. Quantum supremacy is demonstrated using a programmable superconducting processor known as Sycamore, taking approximately 200 seconds to sample one instance of a quantum circuit a million times, which would take a state-of-the-art supercomputer around ten thousand years to compute.

Overview

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1038/s41586-019-1666-5

Cites

57 of 57 references verified0 citation errors · 0 not checkable

Statistics

Verification

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.

A few free checks a day · papers already verified open instantly · results are public

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?

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

Show all 51 references

Research works printed but not linked: 3

  1. Farhi, E. & Neven, H. Classification with quantum neural networks on near term processors. Preprint at https://arxiv.org/abs/1802.06002 (2018). · arXiv
  2. Cross, A. W., Magesan, E., Bishop, L. S., Smolin, J. A. & Gambetta, J. M. Scalable randomised benchmarking of non-Clifford gates. npj Quant. Inform. 2, 16012 (2016).
  3. Villalonga, B. et al. A flexible high-performance simulator for the verification and benchmarking of quantum circuits implemented on real hardware. npj Quant. Inform. (in the press); preprint at https://arxiv.org/abs/1811.09599 (2018). · arXiv

Cited by

Sorted by citations

Metadata

Authors
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., Burkett, B., Chen, Y., Chen, Z., Chiaro, B., Collins, R., Courtney, W., Dunsworth, A., Farhi, E., Foxen, B., Fowler, A., Gidney, C., Giustina, M., Graff, R., Guerin, K., Habegger, S., Harrigan, M. P., Hartmann, M. J., Ho, A., Hoffmann, M., Huang, T., Humble, T. S., Isakov, S. V., Jeffrey, E., Jiang, Z., Kafri, D., Kechedzhi, K., Kelly, J., Klimov, P. V., Knysh, S., Korotkov, A., Kostritsa, F., Landhuis, D., Lindmark, M., Lucero, E., Lyakh, D., Mandrà, S., McClean, J. R., McEwen, M., Megrant, A., Mi, X., Michielsen, K., Mohseni, M., Mutus, J., Naaman, O., Neeley, M., Neill, C., Niu, M. Y., Ostby, E., Petukhov, A., Platt, J. C., Quintana, C., Rieffel, E. G., Roushan, P., Rubin, N. C., Sank, D., Satzinger, K. J., Smelyanskiy, V., Sung, K. J., Trevithick, M. D., Vainsencher, A., Villalonga, B., White, T., Yao, Z. J., Yeh, P., Zalcman, A., Neven, H., & Martinis, J. M.
Affiliations
  • Google (United States) (US)
  • Ames Research Center (US)
  • University of California, Santa Barbara (US)
  • Oak Ridge National Laboratory (US)
  • University of California, Riverside (US)
  • Forschungszentrum Jülich (DE)
Corresponding author
Martinis, John M.
Venue
Nature
Published
2019-10-23
Volume
574
Issue
7779
Pages
505-510
ISSN
  • 0028-0836 (ISSN-L)
  • 1476-4687
OpenAlex
W2982169647
Cited by
7,720
References
51
Citations by year
2026: 701 · 2025: 1157 · 2024: 1143 · 2023: 1234 · 2022: 1230 · 2021: 1315 · 2020: 875 · 2019: 60
FWCI
397.23
Type
journal article
Language
en
Open access
Locations
  • Nature (publishedVersion, other-oa)
  • arXiv (Cornell University) (publishedVersion)
  • PubMed (publishedVersion)
  • Comillas Repository (Comillas Pontifical University) (publishedVersion, cc-by-nc-nd)
  • CaltechAUTHORS (California Institute of Technology) (submittedVersion)
  • RePEc: Research Papers in Economics (submittedVersion)
  • OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (submittedVersion)
  • RWTH Publications (RWTH Aachen) (submittedVersion)
Funders
  • U.S. Department of Energy (AC05-00OR22725, DE--AC05--00OR22725, DE-AC05?, Contract DE-AC05-00OR22725, 00OR22725)
  • National Aeronautics and Space Administration (DE-AC05-00OR22725)
  • Office of Science (DEAC05- 00OR22725, AC05-00OR22725)
  • Ames Research Center
  • University of California, Santa Barbara
  • Air Force Research Laboratory (F4HBKC4162G001, DE-AC05-00OR22725)
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 Mechanics and Applications
Keywords
quantum advantage, superconducting qubits, classical simulation of quantum circuits, programmable quantum processors, quantum computing

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