Establishing the quantum supremacy frontier with a 281 Pflop/s simulation
Open accessThe DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Abstract
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. 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713 · cited 1×
“ly reducing power consumption. For instance, important encryption protocols such as RSA, which is widely used in private and secure communications, can theoretically be broken using quantum computers [13]. Moreover, quantum simulation problems, including new material design and drug discovery, vlllngc2@illinois.edu, y…”
BackgroundSimulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Surface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059
Superconducting quantum circuits at the surface code threshold for fault tolerance
Barends, R., Kelly, J., Megrant, A., Veitia, A., Sank, D., Jeffrey, E., White, T. C., Mutus, J., Fowler, A. G., Campbell, B., et al. (2014) · Nature · doi:10.1038/nature13171 · Cited by 1,733
Improved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515 · cited 1×
“An intriguing idea consists in representing RQCs as a linear combination of different stabilizer circuits [48–50].”
BackgroundSimulated Quantum Computation of Molecular Energies
Aspuru-Guzik, A., Dutoi, A. D., Love, P. J., & Head-Gordon, M. (2005) · Science · doi:10.1126/science.1113479 · Cited by 1,418
Characterizing quantum supremacy in near-term devices
Boixo, S., Isakov, S. V., Smelyanskiy, V. N., Babbush, R., Ding, N., Jiang, Z., Bremner, M. J., Martinis, J. M., & Neven, H. (2018) · Nature Physics · doi:10.1038/s41567-018-0124-x · Cited by 1,175 · cited 10×
“As RQCs, we use the prescription described in references [18, 55], which has been shown to be hard to simulate.”
BackgroundMethodInfluentialSelf-citationFeynman, R. P. (1985) · Optics News · doi:10.1364/on.11.2.000011 · Cited by 1,023
Randomized benchmarking of quantum gates
Knill, E., Leibfried, D., Reichle, R., Britton, J., Blakestad, R. B., Jost, J. D., Langer, C., Ozeri, R., Seidelin, S., & Wineland, D. J. (2008) · Physical Review A · doi:10.1103/physreva.77.012307 · Cited by 1,019
Cited by
Quantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720
Self-citationStrong Quantum Computational Advantage Using a Superconducting Quantum Processor
Wu, Y., Bao, W.-S., Cao, S., Chen, F., Chen, M.-C., Chen, X., Chung, T.-H., Deng, H., Du, Y., Fan, D., et al. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.180501 · Cited by 1,059
Quantum simulation and computing with Rydberg-interacting qubits
Morgado, M., & Whitlock, S. (2021) · AVS Quantum Science · doi:10.1116/5.0036562 · Cited by 370
Qulacs: a fast and versatile quantum circuit simulator for research purpose
Suzuki, Y., Kawase, Y., Masumura, Y., Hiraga, Y., Nakadai, M., Chen, J., Nakanishi, K. M., Mitarai, K., Imai, R., Tamiya, S., et al. (2021) · Quantum · doi:10.22331/q-2021-10-06-559 · Cited by 295
Information scrambling in quantum circuits
Mi, X., Roushan, P., Quintana, C., Mandrà, S., Marshall, J., Neill, C., Arute, F., Arya, K., Atalaya, J., Babbush, R., et al. (2021) · Science · doi:10.1126/science.abg5029 · Cited by 283
Self-citationQuantum computational advantage via 60-qubit 24-cycle random circuit sampling
Zhu, Q., Cao, S., Chen, F., Chen, M.-C., Chen, X., Chung, T.-H., Deng, H., Du, Y., Fan, D., Gong, M., et al. (2022) · Science Bulletin · doi:10.1016/j.scib.2021.10.017 · Cited by 263
QuEST and High Performance Simulation of Quantum Computers
Jones, T., Brown, A., Bush, I., & Benjamin, S. C. (2019) · Scientific Reports · doi:10.1038/s41598-019-47174-9 · Cited by 253
Computational advantage of quantum random sampling
Hangleiter, D., & Eisert, J. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.035001 · Cited by 145
Quantum computational advantage via high-dimensional Gaussian boson sampling
Deshpande, A., Mehta, A., Vincent, T., Quesada, N., Hinsche, M., Ioannou, M., Madsen, L., Lavoie, J., Qi, H., Eisert, J., et al. (2022) · Science Advances · doi:10.1126/sciadv.abi7894 · Cited by 106
“This has been the strategy of choice for classical adversaries to superconducting circuits performing random circuit sampling [48, 57].”
Tannu, S. S., & Qureshi, M. (2019) · Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1145/3352460.3358257 · Cited by 100
Biology and medicine in the landscape of quantum advantages
Cordier, B. A., Sawaya, N. P. D., Guerreschi, G. G., & McWeeney, S. K. (2022) · Journal of The Royal Society Interface · doi:10.1098/rsif.2022.0541 · Cited by 87
“specific experiment [18] (and in general[19]).”
BackgroundClassical variational simulation of the Quantum Approximate Optimization Algorithm
Medvidović, M., & Carleo, G. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00440-z · Cited by 79
“The method is contrasted with state-of-the-art classical simulations based on low-rank Clifford group decompositions [26], whose complexity is exponential in the number of non-Clifford gates as well as tensor-based approaches [29].”
BackgroundMethodBoundaries of quantum supremacy via random circuit sampling
Zlokapa, A., Boixo, S., & Lidar, D. (2020) · arXiv · doi:10.48550/arxiv.2005.02464 · Cited by 55
Self-citationVariational quantum algorithm for nonequilibrium steady states
Yoshioka, N., Nakagawa, Y. O., Mitarai, K., & Fujii, K. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.043289 · Cited by 54
“[10] Benjamin Villalonga, Dmitry Lyakh, Sergio Boixo, Hartmut Neven, Travis S Humble, Rupak Biswas, Eleanor G Rieffel, Alan Ho, and Salvatore Mandrà, “Establishing the quantum supremacy frontier with a 281 pflop/s simulation,” arXiv:1905.”
BackgroundTowards Quantum-Enhanced Machine Learning for Network Intrusion Detection
Gouveia, A., & Correia, M. (2020) · 2020 IEEE 19th International Symposium on Network Computing and Applications (NCA) · doi:10.1109/nca51143.2020.9306691 · Cited by 52
“Quantum computers , and among them Noisy Intermediate-Scale Quantum (NISQ) computers , aim to leverage quantum physics to perform computational tasks beyond the capabilities of the most powerful classical computers, potentially achieving quantum supremacy [9]–[11].”
BackgroundA Cost and Power Feasibility Analysis of Quantum Annealing for NextG Cellular Wireless Networks
Kasi, S., Warburton, P., Kaewell, J., & Jamieson, K. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3326469 · Cited by 20
Efficient approximation of experimental Gaussian boson sampling
Villalonga, B., Niu, M. Y., Li, L., Neven, H., Platt, J. C., Smelyanskiy, V. N., & Boixo, S. (2021) · arXiv · doi:10.48550/arxiv.2109.11525 · Cited by 16
Self-citationPolynomial-Time Classical Simulation of Noisy IQP Circuits with Constant Depth
Rajakumar, J., Watson, J. D., & Liu, Y.-K. (2025) · Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1137/1.9781611978322.30 · Cited by 7
Counting collisions in random circuit sampling for benchmarking quantum computers
Mari, A. (2024) · APL Quantum · doi:10.1063/5.0219266 · Cited by 2
Metadata
- Authors
- Villalonga, B., Lyakh, D., Boixo, S., Neven, H., Humble, T. S., Biswas, R., Rieffel, E. G., Ho, A., & Mandrà, S.
- Venue
- Quantum Science and Technology
- Publisher
- IOP Publishing
- Published
- 2020-04-27
- Volume
- 5
- Issue
- 3
- Pages
- 034003
- ISSN
- 2058-9565 (ISSN-L)
- OpenAlex
- W2943659715
- Cited by
- 124
- References
- 22
- FWCI
- 7.96
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.