Skip to content

Quantum supremacy using a programmable superconducting processor

Dave Bacon, Joseph C. Bardin, R. Barends, Sergio Boixo, Fernando G. S. L. Brandão, David A. Buell, B. Chiaro, Edward Farhi, Austin G. Fowler, Matthew P. Harrigan, Sergei V. Isakov, Evan R. Jeffrey, Kostyantyn Kechedzhi, David Landhuis, Dmitry I. Lyakh, A. Megrant, Kristel F. L. Michielsen, Masoud Mohseni, Murphy Yuezhen Niu, Eleanor Gilbert Rieffel, D. Sank, Kevin J. Satzinger, Vadim Smelyanskiy, A. Vainsencher, Benjamin Villalonga, Adam Zalcman, Hartmut Neven, John M. Martinis

Nature · 2019 · 8,246 citationsOpen access

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandão, 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., … Martinis, J. M. (2019). Quantum supremacy using a programmable superconducting processor. Nature, 574(7779), 505–510. https://doi.org/10.1038/s41586-019-1666-5

In text: (Arute et al., 2019)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

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.

  1. Quantum theory, the Church–Turing principle and the universal quantum computer1985
  2. Scheme for reducing decoherence in quantum computer memory1995
  3. Quantum Mechanics Helps in Searching for a Needle in a Haystack1997
  4. Wave function of the Universe1983

Metadata from OpenAlex (CC0). Citations are generated from the published record.