Boundaries of quantum supremacy via random circuit sampling
Abstract
Abstract Google’s quantum supremacy experiment heralded a transition point where quantum computers can evaluate a computational task, random circuit sampling, faster than classical supercomputers. We examine the constraints on the region of quantum advantage for quantum circuits with a larger number of qubits and gates than experimentally implemented. At near-term gate fidelities, we demonstrate that quantum supremacy is limited to circuits with a qubit count and circuit depth of a few hundred. Larger circuits encounter two distinct boundaries: a return of a classical advantage and practically infeasible quantum runtimes. Decreasing error rates cause the region of a quantum advantage to grow rapidly. At error rates required for early implementations of the surface code, the largest circuit size within the quantum supremacy regime coincides approximately with the smallest circuit size needed to implement error correction. Thus, the boundaries of quantum supremacy may fortuitously coincide with the advent of scalable, error-corrected quantum computing.
- Publication Date:
- Sponsoring Org.:
- USDOE
- OSTI Identifier:
- 1969414
- Resource Type:
- Published Article
- Journal Name:
- npj Quantum Information
- Additional Journal Information:
- Journal Name: npj Quantum Information Journal Volume: 9 Journal Issue: 1; Journal ID: ISSN 2056-6387
- Publisher:
- Nature Publishing Group
- Country of Publication:
- United Kingdom
- Language:
- English
Citation Formats
Zlokapa, Alexander, Villalonga, Benjamin, Boixo, Sergio, and Lidar, Daniel A. Boundaries of quantum supremacy via random circuit sampling. United Kingdom: N. p., 2023.
Web. doi:10.1038/s41534-023-00703-x.
Zlokapa, Alexander, Villalonga, Benjamin, Boixo, Sergio, & Lidar, Daniel A. Boundaries of quantum supremacy via random circuit sampling. United Kingdom. https://doi.org/10.1038/s41534-023-00703-x
Zlokapa, Alexander, Villalonga, Benjamin, Boixo, Sergio, and Lidar, Daniel A. Tue .
"Boundaries of quantum supremacy via random circuit sampling". United Kingdom. https://doi.org/10.1038/s41534-023-00703-x.
@article{osti_1969414,
title = {Boundaries of quantum supremacy via random circuit sampling},
author = {Zlokapa, Alexander and Villalonga, Benjamin and Boixo, Sergio and Lidar, Daniel A.},
abstractNote = {Abstract Google’s quantum supremacy experiment heralded a transition point where quantum computers can evaluate a computational task, random circuit sampling, faster than classical supercomputers. We examine the constraints on the region of quantum advantage for quantum circuits with a larger number of qubits and gates than experimentally implemented. At near-term gate fidelities, we demonstrate that quantum supremacy is limited to circuits with a qubit count and circuit depth of a few hundred. Larger circuits encounter two distinct boundaries: a return of a classical advantage and practically infeasible quantum runtimes. Decreasing error rates cause the region of a quantum advantage to grow rapidly. At error rates required for early implementations of the surface code, the largest circuit size within the quantum supremacy regime coincides approximately with the smallest circuit size needed to implement error correction. Thus, the boundaries of quantum supremacy may fortuitously coincide with the advent of scalable, error-corrected quantum computing.},
doi = {10.1038/s41534-023-00703-x},
journal = {npj Quantum Information},
number = 1,
volume = 9,
place = {United Kingdom},
year = {Tue Apr 11 00:00:00 EDT 2023},
month = {Tue Apr 11 00:00:00 EDT 2023}
}
Free Publicly Available Full Text
Publisher's Version of Record
https://doi.org/10.1038/s41534-023-00703-x
https://doi.org/10.1038/s41534-023-00703-x
Other availability
Search WorldCat to find libraries that may hold this journal
Save to My Library
You must Sign In or Create an Account in order to save documents to your library.
Works referenced in this record:
A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
journal, October 2019
- Villalonga, Benjamin; Boixo, Sergio; Nelson, Bron
- npj Quantum Information, Vol. 5, Issue 1
On the complexity and verification of quantum random circuit sampling
journal, October 2018
- Bouland, Adam; Fefferman, Bill; Nirkhe, Chinmay
- Nature Physics, Vol. 15, Issue 2
Complexity-Theoretic Foundations of Quantum Supremacy Experiments
text, January 2017
- Aaronson, Scott; Chen, Lijie
- Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany
Universal Quantum Gate Set Approaching Fault-Tolerant Thresholds with Superconducting Qubits
journal, August 2012
- Chow, Jerry M.; Gambetta, Jay M.; Córcoles, A. D.
- Physical Review Letters, Vol. 109, Issue 6
Classical algorithms for quantum mean values
journal, January 2021
- Bravyi, Sergey; Gosset, David; Movassagh, Ramis
- Nature Physics, Vol. 17, Issue 3
A deceptive step towards quantum speedup detection
journal, July 2018
- Mandrà, Salvatore; Katzgraber, Helmut G.
- Quantum Science and Technology, Vol. 3, Issue 4
Quantum Algorithm for Linear Systems of Equations
journal, October 2009
- Harrow, Aram W.; Hassidim, Avinatan; Lloyd, Seth
- Physical Review Letters, Vol. 103, Issue 15
Characterizing quantum supremacy in near-term devices
journal, April 2018
- Boixo, Sergio; Isakov, Sergei V.; Smelyanskiy, Vadim N.
- Nature Physics, Vol. 14, Issue 6
What Limits the Simulation of Quantum Computers?
journal, November 2020
- Zhou, Yiqing; Stoudenmire, E. Miles; Waintal, Xavier
- Physical Review X, Vol. 10, Issue 4
Correcting coherent errors with surface codes
journal, October 2018
- Bravyi, Sergey; Englbrecht, Matthias; König, Robert
- npj Quantum Information, Vol. 4, Issue 1
Simulating Quantum Computation by Contracting Tensor Networks
journal, January 2008
- Markov, Igor L.; Shi, Yaoyun
- SIAM Journal on Computing, Vol. 38, Issue 3
Qubit Architecture with High Coherence and Fast Tunable Coupling
journal, November 2014
- Chen, Yu; Neill, C.; Roushan, P.
- Physical Review Letters, Vol. 113, Issue 22
Superconducting quantum circuits at the surface code threshold for fault tolerance
journal, April 2014
- Barends, R.; Kelly, J.; Megrant, A.
- Nature, Vol. 508, Issue 7497
Hyper-optimized tensor network contraction
journal, March 2021
- Gray, Johnnie; Kourtis, Stefanos
- Quantum, Vol. 5
Demonstration of a Scaling Advantage for a Quantum Annealer over Simulated Annealing
journal, July 2018
- Albash, Tameem; Lidar, Daniel A.
- Physical Review X, Vol. 8, Issue 3
Demonstration of two-qubit algorithms with a superconducting quantum processor
journal, June 2009
- DiCarlo, L.; Chow, J. M.; Gambetta, J. M.
- Nature, Vol. 460, Issue 7252
What is the Computational Value of Finite-Range Tunneling?
journal, August 2016
- Denchev, Vasil S.; Boixo, Sergio; Isakov, Sergei V.
- Physical Review X, Vol. 6, Issue 3
Solving the Sampling Problem of the Sycamore Quantum Circuits
journal, August 2022
- Pan, Feng; Chen, Keyang; Zhang, Pan
- Physical Review Letters, Vol. 129, Issue 9
Quantum supremacy using a programmable superconducting processor
journal, October 2019
- Arute, Frank; Arya, Kunal; Babbush, Ryan
- Nature, Vol. 574, Issue 7779
Efficient Classical Simulation of Random Shallow 2D Quantum Circuits
journal, April 2022
- Napp, John C.; La Placa, Rolando L.; Dalzell, Alexander M.
- Physical Review X, Vol. 12, Issue 2
Defining and detecting quantum speedup
journal, June 2014
- Ronnow, T. F.; Wang, Z.; Job, J.
- Science, Vol. 345, Issue 6195
How many qubits are needed for quantum computational supremacy?
journal, May 2020
- Dalzell, Alexander M.; Harrow, Aram W.; Koh, Dax Enshan
- Quantum, Vol. 4
Quantum advantage in learning from experiments
journal, June 2022
- Huang, Hsin-Yuan; Broughton, Michael; Cotler, Jordan
- Science, Vol. 376, Issue 6598
Average-Case Complexity Versus Approximate Simulation of Commuting Quantum Computations
journal, August 2016
- Bremner, Michael J.; Montanaro, Ashley; Shepherd, Dan J.
- Physical Review Letters, Vol. 117, Issue 8
Establishing the quantum supremacy frontier with a 281 Pflop/s simulation
journal, April 2020
- Villalonga, Benjamin; Lyakh, Dmitry; Boixo, Sergio
- Quantum Science and Technology, Vol. 5, Issue 3
64-qubit quantum circuit simulation
journal, August 2018
- Chen, Zhao-Yun; Zhou, Qi; Xue, Cheng
- Science Bulletin, Vol. 63, Issue 15
Closing the "quantum supremacy" gap
conference, November 2021
- Liu, Yong (Alexander); Liu, Xin (Lucy); Li, Fang (Nancy)
- Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis
Achieving quantum supremacy with sparse and noisy commuting quantum computations
journal, April 2017
- Bremner, Michael J.; Montanaro, Ashley; Shepherd, Dan J.
- Quantum, Vol. 1
Surface codes: Towards practical large-scale quantum computation
journal, September 2012
- Fowler, Austin G.; Mariantoni, Matteo; Martinis, John M.
- Physical Review A, Vol. 86, Issue 3
Fault-Tolerant Quantum Computation with High Threshold in Two Dimensions
journal, May 2007
- Raussendorf, Robert; Harrington, Jim
- Physical Review Letters, Vol. 98, Issue 19
Massively parallel quantum computer simulator, eleven years later
journal, April 2019
- De Raedt, Hans; Jin, Fengping; Willsch, Dennis
- Computer Physics Communications, Vol. 237
Procedure for systematically tuning up cross-talk in the cross-resonance gate
journal, June 2016
- Sheldon, Sarah; Magesan, Easwar; Chow, Jerry M.
- Physical Review A, Vol. 93, Issue 6
The computational complexity of linear optics
conference, January 2011
- Aaronson, Scott; Arkhipov, Alex
- Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
journal, July 2010
- Bremner, Michael J.; Jozsa, Richard; Shepherd, Dan J.
- Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, Vol. 467, Issue 2126
Quantum computational supremacy
journal, September 2017
- Harrow, Aram W.; Montanaro, Ashley
- Nature, Vol. 549, Issue 7671
A blueprint for demonstrating quantum supremacy with superconducting qubits
journal, April 2018
- Neill, C.; Roushan, P.; Kechedzhi, K.
- Science, Vol. 360, Issue 6385
Observation of Classical-Quantum Crossover of Flux Noise and Its Paramagnetic Temperature Dependence
journal, January 2017
- Quintana, C. M.; Chen, Yu; Sank, D.
- Physical Review Letters, Vol. 118, Issue 5
Efficient classical simulation of noisy random quantum circuits in one dimension
journal, September 2020
- Noh, Kyungjoo; Jiang, Liang; Fefferman, Bill
- Quantum, Vol. 4