Quantum supremacy using a programmable superconducting processor
By F. Arute, K. Arya, Ryan Babbush, D. Bacon, J. Bardin, R. Barends, R. Biswas, Sergio Boixo, Fernando G. S. L. Brandão, D. Buell and 67 more. Nature, 2019
7,893 citations recorded by the source corpus.
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.
Subfields: Artificial Intelligence, Atomic and Molecular Physics, and Optics
View Paper: https://www.semanticscholar.org/paper/0b51d0e3f828d9277c93842cb9600a003f396717
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Göran Wendin
- Patrick J. Coles
- M. Cerezo
- Lukasz Cincio
- Jarrod R. McClean
- Suguru Endo
- Simon C. Benjamin
- Ryan Babbush
In Atomic and Molecular Physics, and Optics
- Göran Wendin
- Franco Nori
- Steven M. Girvin
- A. Nahum
- Patrick J. Coles
- M. Cerezo
- Shannon Whitlock
- M. Morgado
Citations in the corpus
- Experimental photonic quantum memristor (2021, background): “[24] Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph C Bardin, Rami Barends, Rupak Biswas, Sergio Boixo,”
- Harnessing the Power of the Second Quantum Revolution (2020, methodology): “The Google quantum supremacy experiment employs strongly believed arguments based on the complexity hierarchy to study this in the context of sampling the output of a low-depth 2D random circuit [139].”
- Development of Quantum Interconnects (QuICs) for Next-Generation Information Technologies (2021, background): “Industrial quantum computers have recently reached 53 qubits [122], but scaling up to hundreds to thousands of qubits on a single chip is presently well out of reach.”
- QuantumNAS: Noise-Adaptive Search for Robust Quantum Circuits (2021, background): “Google also arguably demonstrated the ”Quantum Supremacy” – their 72-qubit system could provide computing power larger than today’s most powerful supercomputers [2].”
- Connecting ansatz expressibility to gradient magnitudes and barren plateaus (2021, background): “[1] Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph C Bardin, Rami Barends, Rupak Biswas, Sergio Boixo, Fernando GSL Brandao, David A Buell, et al.”
- Probabilistic error cancellation with sparse Pauli–Lindblad models on noisy quantum processors (2022, methodology): “The bound states that, given a quantum circuit with l layers whose learning layer satisfies equation (2), we can estimate the ideal expectation value 〈A〉 of an observable A with ∥A∥ ≤ 1 by the average mitigated estimate ⟨ ̂ AN⟩ using N error-mitigated circuit instances, such that”
- Observation of separated dynamics of charge and spin in the Fermi-Hubbard model (2020, methodology): “[39].”