Establishing the Quantum Supremacy Frontier with a 281 Pflop/s Simulation

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.

arXiv commentThe paper has been published in Quantum Science and Technology

References in corpus (26)

• Quantum Computing in the NISQ era and beyond
• Surface codes: Towards practical large-scale quantum computation
• Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
• Improved Simulation of Stabilizer Circuits
• Simulated Quantum Computation of Molecular Energies
• Characterizing Quantum Supremacy in Near-Term Devices
• Randomized Benchmarking of Quantum Gates
• State preservation by repetitive error detection in a superconducting quantum circuit
• Robust randomized benchmarking of quantum processes
• Simulating quantum computation by contracting tensor networks
• Digitized adiabatic quantum computing with a superconducting circuit
• Characterizing Quantum Gates via Randomized Benchmarking
• A blueprint for demonstrating quantum supremacy with superconducting qubits
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Improved classical simulation of quantum circuits dominated by Clifford gates
• Average-case complexity versus approximate simulation of commuting quantum computations
• Low Depth Quantum Simulation of Electronic Structure
• Massive Parallel Quantum Computer Simulator
• Achieving quantum supremacy with sparse and noisy commuting quantum computations
• Quantum algorithms to simulate many-body physics of correlated fermions
• A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
• 64-Qubit Quantum Circuit Simulation
• 16-qubit IBM universal quantum computer can be fully entangled
• Unbiased Simulation of Near-Clifford Quantum Circuits
• Validating Quantum-Classical Programming Models with Tensor Network Simulations
• Quantum Accelerators for High-Performance Computing Systems

Cited by in corpus (52)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Strong quantum computational advantage using a superconducting quantum processor
• Quantum simulation and computing with Rydberg-interacting qubits
• Qulacs: a fast and versatile quantum circuit simulator for research purpose
• Information Scrambling in Computationally Complex Quantum Circuits
• QuEST and High Performance Simulation of Quantum Computers
• Hyper-optimized tensor network contraction
• CutQC: Using Small Quantum Computers for Large Quantum Circuit Evaluations
• Efficient classical simulation of random shallow 2D quantum circuits
• Computational advantage of quantum random sampling
• Closing the "Quantum Supremacy" Gap: Achieving Real-Time Simulation of a Random Quantum Circuit Using a New Sunway Supercomputer
• Quantum Computational Advantage via High-Dimensional Gaussian Boson Sampling
• Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation
• Biology and medicine in the landscape of quantum advantages
• Calculation of the Green's function on near-term quantum computers
• Classical variational simulation of the Quantum Approximate Optimization Algorithm
• Hamiltonian Simulation Algorithms for Near-Term Quantum Hardware
• Is quantum computing green? An estimate for an energy-efficiency quantum advantage
• ADAPT: Mitigating Idling Errors in Qubits via Adaptive Dynamical Decoupling
• Classical algorithms for quantum mean values
• Experimental quantum kernel machine learning with nuclear spins in a solid
• Tropical Tensor Network for Ground States of Spin Glasses
• Boundaries of quantum supremacy via random circuit sampling
• Jet: Fast quantum circuit simulations with parallel task-based tensor-network contraction
• Variational Quantum Algorithm for Non-equilibrium Steady States
• Effective quantum volume, fidelity and computational cost of noisy quantum processing experiments
• Application-Motivated, Holistic Benchmarking of a Full Quantum Computing Stack
• Recovering single precision accuracy from Tensor Cores while surpassing the FP32 theoretical peak performance
• Modeling and mitigation of cross-talk effects in readout noise with applications to the Quantum Approximate Optimization Algorithm
• JigSaw: Boosting Fidelity of NISQ Programs via Measurement Subsetting
• Simulation of quantum many-body dynamics with Tensor Processing Units: Floquet prethermalization
• Verifying Random Quantum Circuits with Arbitrary Geometry Using Tensor Network States Algorithm
• A performance characterization of quantum generative models
• Cache Blocking Technique to Large Scale Quantum Computing Simulation on Supercomputers
• A quantum hamiltonian simulation benchmark
• Simple heuristics for efficient parallel tensor contraction and quantum circuit simulation
• Assessing and Advancing the Potential of Quantum Computing: A NASA Case Study
• A quantum circuit simulator and its applications on Sunway TaihuLight supercomputer
• Lifetime-based Optimization for Simulating Quantum Circuits on a New Sunway Supercomputer
• Supervised learning of random quantum circuits via scalable neural networks
• Fast simulation of quantum algorithms using circuit optimization
• Simulation of Quantum Computers: Review and Acceleration Opportunities
• Simulator Demonstration of Large Scale Variational Quantum Algorithm on HPC Cluster
• Feynman-path type simulation using stabilizer projector decomposition of unitaries
• Fast simulation of planar Clifford circuits
• RosneT: A Block Tensor Algebra Library for Out-of-Core Quantum Computing Simulation
• GPU acceleration of ab initio simulations of large-scale identical particles based on path integral molecular dynamics
• High-fidelity State Transfer Between Leaky Quantum Memories
• HybridQ: A Hybrid Simulator for Quantum Circuits
• Counting collisions in random circuit sampling for benchmarking quantum computers
• Matrix Product State on a Quantum Computer
• Diagonal-Budgeted Trotterization for Efficient Quantum Hamiltonian Simulation