The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor. 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 qubits 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. Finally, this dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy for this specific computational task, heralding a much-anticipated computing paradigm.
@article{osti_1607005,
author = {Arute, Frank and Arya, Kunal and Babbush, Ryan and Bacon, Dave and Bardin, Joseph C. and Barends, Rami and Biswas, Rupak and Boixo, Sergio and Brandao, Fernando G. S. L. and Buell, David A. and others},
title = {Quantum supremacy using a programmable superconducting processor},
annote = {The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor. 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 qubits 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. Finally, this dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy for this specific computational task, heralding a much-anticipated computing paradigm.},
doi = {10.1038/s41586-019-1666-5},
url = {https://www.osti.gov/biblio/1607005},
journal = {Nature (London)},
issn = {ISSN 0028-0836},
number = {7779},
volume = {574},
place = {United States},
publisher = {Nature Publishing Group},
year = {2019},
month = {10}}
Conference on Coherence and Quantum Optics, The Rochester Conferences on Coherence and Quantum Optics and the Quantum Information and Measurement meetinghttps://doi.org/10.1364/cqo.2013.m3.1
ASPLOS '21: 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systemshttps://doi.org/10.1145/3445814.3446758
