Establishing the quantum supremacy frontier with a 281 Pflop/s simulation

Villalonga Correa, Benjamin; Liakh, Dmitry; Boixo, Sergio; Neven, Hartmut; Humble, Travis S.; Biswas, Rupak; Rieffel, Eleanor G.; Ho, Alan; Mandra, Salvatore

doi:10.1088/2058-9565/ab7eeb

Establishing the quantum supremacy frontier with a 281 Pflop/s simulation

Journal Article · Mon Apr 27 00:00:00 EDT 2020 · Quantum Science and Technology

DOI:https://doi.org/10.1088/2058-9565/ab7eeb· OSTI ID:1649588

Villalonga Correa, Benjamin ^[1]; ^[2]; Boixo, Sergio ^[3]; Neven, Hartmut ^[3]; ^[2]; Biswas, Rupak ^[4]; Rieffel, Eleanor G. ^[4]; Ho, Alan ^[3]; ^[5]

NASA Ames Research Center (ARC), Moffett Field, Mountain View, CA (United States); USRA Research Inst. for Advanced Computer Science (RIACS), Mountain View, CA (United States); Univ. of Illinois at Urbana-Champaign, IL (United States)
Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
Google, Inc., Venice, CA (United States)
NASA Ames Research Center (ARC), Moffett Field, Mountain View, CA (United States)
NASA Ames Research Center (ARC), Moffett Field, Mountain View, CA (United States); Stinger Ghaffarian Technologies Inc., Greenbelt, MD (United States)

Noisy intermediate-scale quantum (NISQ) computers are entering an era in which they can perform computational tasks beyond the capabilities of the most powerful classical computers, thereby achieving 'quantum supremacy', a major milestone in quantum computing. NISQ supremacy requires comparison with a state-of-the-art classical simulator. In this paper, we report HPC simulations of hard random quantum circuits (RQC), which have been recently used as a benchmark for the first experimental demonstration of quantum supremacy, sustaining an average performance of 281 Pflop/s (true single precision) on Summit, currently the fastest supercomputer in the world. These simulations were carried out using qFlex, a tensor-network-based classical high-performance simulator of RQCs. Our results show an advantage of many orders of magnitude in energy consumption of NISQ devices over classical supercomputers. In addition, we propose a standard benchmark for NISQ computers based on qFlex.

View Accepted Manuscript (DOE)

Research Organization:: Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)

Sponsoring Organization:: National Aeronautic and Space Administration (NASA); USDOE Office of Science (SC)

Grant/Contract Number:: AC05-00OR22725

OSTI ID:: 1649588

Journal Information:: Quantum Science and Technology, Journal Name: Quantum Science and Technology Journal Issue: 3 Vol. 5; ISSN 2058-9565

Publisher:: IOPscienceCopyright Statement

Country of Publication:: United States

Language:: English

References (39)

Domain‐specific virtual processors as a portable programming and execution model for parallel computational workloads on modern heterogeneous high‐performance computing architectures Lyakh, Dmitry I. International Journal of Quantum Chemistry, Vol. 119, Issue 12 https://doi.org/10.1002/qua.25926	journal	March 2019
An efficient tensor transpose algorithm for multicore CPU, Intel Xeon Phi, and NVidia Tesla GPU Lyakh, Dmitry I. Computer Physics Communications, Vol. 189 https://doi.org/10.1016/j.cpc.2014.12.013	journal	April 2015
Low-Depth Quantum Simulation of Materials Babbush, Ryan; Wiebe, Nathan; McClean, Jarrod Physical Review X, Vol. 8, Issue 1 https://doi.org/10.1103/physrevx.8.011044	journal	March 2018
Simulated Quantum Computation of Molecular Energies Aspuru-Guzik, A. Science, Vol. 309, Issue 5741 https://doi.org/10.1126/science.1113479	journal	September 2005
The computational complexity of linear optics Aaronson, Scott; Arkhipov, Alex Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11 https://doi.org/10.1145/1993636.1993682	conference	January 2011
Improved classical simulation of quantum circuits dominated by Clifford gates Bravyi, Sergey; Gosset, David arXiv https://doi.org/10.48550/arxiv.1601.07601	text	January 2016
Unbiased Simulation of Near-Clifford Quantum Circuits Bennink, Ryan S.; Ferragut, Erik M.; Humble, Travis S. arXiv https://doi.org/10.48550/arxiv.1703.00111	text	January 2017
Tensor Networks in a Nutshell Biamonte, Jacob; Bergholm, Ville arXiv https://doi.org/10.48550/arxiv.1708.00006	preprint	January 2017
Simulation of low-depth quantum circuits as complex undirected graphical models Boixo, Sergio; Isakov, Sergei V.; Smelyanskiy, Vadim N. arXiv https://doi.org/10.48550/arxiv.1712.05384	preprint	January 2017
A fast quantum mechanical algorithm for database search Grover, Lov K. arXiv https://doi.org/10.48550/arxiv.quant-ph/9605043	preprint	January 1996
Quantum supremacy using a programmable superconducting processor Martinis, John; Boixo, Sergio; Neven, Hartmut Dryad https://doi.org/10.5061/dryad.k6t1rj8	dataset	January 2019
Simulating physics with computers Feynman, Richard P. International Journal of Theoretical Physics, Vol. 21, Issue 6-7 https://doi.org/10.1007/bf02650179	journal	June 1982
Massively parallel quantum computer simulator De Raedt, K.; Michielsen, K.; De Raedt, H. Computer Physics Communications, Vol. 176, Issue 2 https://doi.org/10.1016/j.cpc.2006.08.007	journal	January 2007
64-qubit quantum circuit simulation Chen, Zhao-Yun; Zhou, Qi; Xue, Cheng Science Bulletin, Vol. 63, Issue 15 https://doi.org/10.1016/j.scib.2018.06.007	journal	August 2018
Superconducting quantum circuits at the surface code threshold for fault tolerance Barends, R.; Kelly, J.; Megrant, A. Nature, Vol. 508, Issue 7497 https://doi.org/10.1038/nature13171	journal	April 2014
State preservation by repetitive error detection in a superconducting quantum circuit Kelly, J.; Barends, R.; Fowler, A. G. Nature, Vol. 519, Issue 7541 https://doi.org/10.1038/nature14270	journal	March 2015
Digitized adiabatic quantum computing with a superconducting circuit Barends, R.; Shabani, A.; Lamata, L. Nature, Vol. 534, Issue 7606 https://doi.org/10.1038/nature17658	journal	June 2016
16-qubit IBM universal quantum computer can be fully entangled Wang, Yuanhao; Li, Ying; Yin, Zhang-qi npj Quantum Information, Vol. 4, Issue 1 https://doi.org/10.1038/s41534-018-0095-x	journal	September 2018
A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware Villalonga, Benjamin; Boixo, Sergio; Nelson, Bron npj Quantum Information, Vol. 5, Issue 1 https://doi.org/10.1038/s41534-019-0196-1	journal	October 2019
Characterizing quantum supremacy in near-term devices Boixo, Sergio; Isakov, Sergei V.; Smelyanskiy, Vadim N. Nature Physics, Vol. 14, Issue 6 https://doi.org/10.1038/s41567-018-0124-x	journal	April 2018
Improved simulation of stabilizer circuits Aaronson, Scott; Gottesman, Daniel Physical Review A, Vol. 70, Issue 5 https://doi.org/10.1103/physreva.70.052328	journal	November 2004
Randomized benchmarking of quantum gates Knill, E.; Leibfried, D.; Reichle, R. Physical Review A, Vol. 77, Issue 1 https://doi.org/10.1103/physreva.77.012307	journal	January 2008
Characterizing quantum gates via randomized benchmarking Magesan, Easwar; Gambetta, Jay M.; Emerson, Joseph Physical Review A, Vol. 85, Issue 4 https://doi.org/10.1103/physreva.85.042311	journal	April 2012
Surface codes: Towards practical large-scale quantum computation Fowler, Austin G.; Mariantoni, Matteo; Martinis, John M. Physical Review A, Vol. 86, Issue 3 https://doi.org/10.1103/physreva.86.032324	journal	September 2012
Unbiased simulation of near-Clifford quantum circuits Bennink, Ryan S.; Ferragut, Erik M.; Humble, Travis S. Physical Review A, Vol. 95, Issue 6 https://doi.org/10.1103/physreva.95.062337	journal	June 2017
Quantum Algorithms to Simulate Many-Body Physics of Correlated Fermions Jiang, Zhang; Sung, Kevin J.; Kechedzhi, Kostyantyn Physical Review Applied, Vol. 9, Issue 4 https://doi.org/10.1103/physrevapplied.9.044036	journal	April 2018
Scalable and Robust Randomized Benchmarking of Quantum Processes Magesan, Easwar; Gambetta, J. M.; Emerson, Joseph Physical Review Letters, Vol. 106, Issue 18 https://doi.org/10.1103/physrevlett.106.180504	journal	May 2011
Improved Classical Simulation of Quantum Circuits Dominated by Clifford Gates Bravyi, Sergey; Gosset, David Physical Review Letters, Vol. 116, Issue 25 https://doi.org/10.1103/physrevlett.116.250501	journal	June 2016
Average-Case Complexity Versus Approximate Simulation of Commuting Quantum Computations Bremner, Michael J.; Montanaro, Ashley; Shepherd, Dan J. Physical Review Letters, Vol. 117, Issue 8 https://doi.org/10.1103/physrevlett.117.080501	journal	August 2016
Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity Babbush, Ryan; Gidney, Craig; Berry, Dominic W. Physical Review X, Vol. 8, Issue 4 https://doi.org/10.1103/physrevx.8.041015	journal	October 2018
Quantum Accelerators for High-Performance Computing Systems Britt, Keith A.; Mohiyaddin, Fahd A.; Humble, Travis S. 2017 IEEE International Conference on Rebooting Computing (ICRC) https://doi.org/10.1109/ICRC.2017.8123664	conference	November 2017
Algorithms for quantum computation: discrete logarithms and factoring Shor, P. W. Proceedings 35th Annual Symposium on Foundations of Computer Science https://doi.org/10.1109/SFCS.1994.365700	conference	January 1994
Simulated execution of hybrid quantum computing systems Humble, Travis S.; Sadlier, Ronadl J.; Britt, Keith A. Quantum Information Science, Sensing, and Computation X https://doi.org/10.1117/12.2303824	conference	May 2018
A blueprint for demonstrating quantum supremacy with superconducting qubits Neill, C.; Roushan, P.; Kechedzhi, K. Science, Vol. 360, Issue 6385 https://doi.org/10.1126/science.aao4309	journal	April 2018
Simulating Quantum Computation by Contracting Tensor Networks Markov, Igor L.; Shi, Yaoyun SIAM Journal on Computing, Vol. 38, Issue 3 https://doi.org/10.1137/050644756	journal	January 2008
Quantum Mechanical Computers Feynman, Richard P. Optics News, Vol. 11, Issue 2 https://doi.org/10.1364/on.11.2.000011	journal	January 1985
Validating quantum-classical programming models with tensor network simulations McCaskey, Alexander; Dumitrescu, Eugene; Chen, Mengsu PLOS ONE, Vol. 13, Issue 12 https://doi.org/10.1371/journal.pone.0206704	journal	December 2018
Achieving quantum supremacy with sparse and noisy commuting quantum computations Bremner, Michael J.; Montanaro, Ashley; Shepherd, Dan J. Quantum, Vol. 1 https://doi.org/10.22331/q-2017-04-25-8	journal	April 2017
Quantum Computing in the NISQ era and beyond Preskill, John Quantum, Vol. 2 https://doi.org/10.22331/q-2018-08-06-79	journal	August 2018

Cited By (3)

Dimension Reduction Using Quantum Wavelet Transform on a High-Performance Reconfigurable Computer Mahmud, Naveed; El-Araby, Esam International Journal of Reconfigurable Computing, Vol. 2019 https://doi.org/10.1155/2019/1949121	journal	November 2019
Alibaba Cloud Quantum Development Platform: Large-Scale Classical Simulation of Quantum Circuits Zhang, Fang; Huang, Cupjin; Newman, Michael arXiv https://doi.org/10.48550/arxiv.1907.11217	preprint	January 2019
How Many Simulations Do We Exist In? A Practical Mathematical Solution to the Simulation Argument Ashrafian, Hutan arXiv https://doi.org/10.48550/arxiv.2001.10439	preprint	January 2020

Similar Records

Characterizing quantum supremacy in near-term devices

Journal Article · Sun Apr 22 20:00:00 EDT 2018 · Nature Physics · OSTI ID:1543766

Simulations of Quantum Approximate Optimization Algorithm on HPC-QC Integrated Systems

Conference · Tue Dec 31 23:00:00 EST 2024 · OSTI ID:2538268

Quantum supremacy using a programmable superconducting processor

Journal Article · Tue Oct 22 20:00:00 EDT 2019 · Nature (London) · OSTI ID:1607005

Related Subjects

97 MATHEMATICS AND COMPUTING

Establishing the quantum supremacy frontier with a 281 Pflop/s simulation

Citation Formats

References (39)

Cited By (3)

Similar Records

Related Subjects