State of practice: evaluating GPU performance of state vector and tensor network methods

Abstract

The frontier of quantum computing (QC) simulation on classical hardware is quickly reaching the hard scalability limits for computational feasibility. Nonetheless, there is still a need to simulate large quantum systems classically, as the Noisy Intermediate Scale Quantum (NISQ) devices are yet to be considered fault tolerant and performant enough in terms of operations per second. Each of the two main exact simulation techniques, state vector and tensor network simulators, boasts specific limitations. The exponential memory requirement of state vector simulation, when compared to the qubit register sizes of currently available quantum computers, quickly saturates the capacity of the top HPC machines currently available. Tensor network contraction approaches, which encode quantum circuits into tensor networks and then contract them over an output bit string to obtain its probability amplitude, still fall short of the inherent complexity of finding an optimal contraction path, which maps to a max-cut problem on a dense mesh, a notably NP-hard problem. This article aims at investigating the limits of current state-of-the-art simulation techniques on a test bench made of eight widely used quantum subroutines, each in 31 different configurations, with special emphasis on performance. We then correlate the performance measures of the simulators with the metrics that characterise the benchmark circuits, identifying the main reasons behind the observed performance trend. From our observations, given the structure of a quantum circuit and the number of qubits, we highlight how to select the best simulation strategy, obtaining a speedup of up to an order of magnitude.

13 pages, 10 figures, 1 table

References in corpus (27)

• Planck 2015 results. XIII. Cosmological parameters
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• A variational eigenvalue solver on a quantum processor
• Efficient classical simulation of slightly entangled quantum computations
• A Quantum Approximate Optimization Algorithm
• Simulating quantum computation by contracting tensor networks
• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• An approximate Fourier transform useful in quantum factoring
• Interacting Quantum Observables: Categorical Algebra and Diagrammatics
• Correlated Charge Noise and Relaxation Errors in Superconducting Qubits
• Impact of ionizing radiation on superconducting qubit coherence
• Resolving catastrophic error bursts from cosmic rays in large arrays of superconducting qubits
• When does a physical system compute?
• Hyper-optimized tensor network contraction
• Tensor Networks in a Nutshell
• QASMBench: A Low-level QASM Benchmark Suite for NISQ Evaluation and Simulation
• Verifying Random Quantum Circuits with Arbitrary Geometry Using Tensor Network States Algorithm
• Lectures on Quantum Tensor Networks
• Benchmarking Quantum Computer Simulation Software Packages: State Vector Simulators
• Performance Evaluation and Acceleration of the QTensor Quantum Circuit Simulator on GPUs
• Simple heuristics for efficient parallel tensor contraction and quantum circuit simulation
• A Herculean task: Classical simulation of quantum computers
• Validating quantum-supremacy experiments with exact and fast tensor network contraction
• Multi-Tensor Contraction for XEB Verification of Quantum Circuits
• Simulator Demonstration of Large Scale Variational Quantum Algorithm on HPC Cluster
• Efficient techniques to GPU Accelerations of Multi-Shot Quantum Computing Simulations
• Distributed Simulation of Statevectors and Density Matrices