Exact and approximate simulation of large quantum circuits on a single GPU

We benchmark the performances of Qrack, an open-source software library for the high-performance classical simulation of (gate-model) quantum computers. Qrack simulates, in the Schr\"odinger picture, the exact quantum state of $n$ qubits evolving under the application of a circuit composed of elementary quantum gates. Moreover, Qrack can also run approximate simulations in which a tunable reduction of the quantum state fidelity is traded for a significant reduction of the execution time and memory footprint. In this work, we give an overview of both simulation methods (exact and approximate), highlighting the main physics-based and software-based techniques. Moreover, we run computationally heavy benchmarks on a single GPU, executing large quantum Fourier transform circuits and large random circuits. Compared with other classical simulators, we report competitive execution times for the exact simulation of Fourier transform circuits with up to 27 qubits. We also demonstrate the approximate simulation of all amplitudes of random circuits acting on 54 qubits with 7 layers at average fidelity higher $\approx 4\%$, a task commonly considered hard without super-computing resources.

[1]  P. Zhang,et al.  A Herculean task: Classical simulation of quantum computers , 2023, 2302.08880.

[2]  P. Zoller,et al.  Practical quantum advantage in quantum simulation , 2022, Nature.

[3]  Joel J. Wallman,et al.  Efficiently improving the performance of noisy quantum computers , 2022, Quantum.

[4]  Jordan S. Cotler,et al.  Quantum advantage in learning from experiments , 2021, Science.

[5]  Trevor Vincent,et al.  Jet: Fast quantum circuit simulations with parallel task-based tensor-network contraction , 2021, Quantum.

[6]  J. Eisert,et al.  Quantum computational advantage via high-dimensional Gaussian boson sampling , 2021, Science advances.

[7]  S. White,et al.  The ITensor Software Library for Tensor Network Calculations , 2020, SciPost Physics Codebases.

[8]  M. Szegedy,et al.  Efficient parallelization of tensor network contraction for simulating quantum computation , 2021, Nature Computational Science.

[9]  P. Zhang,et al.  Simulating the Sycamore quantum supremacy circuits , 2021, 2103.03074.

[10]  John Preskill,et al.  Information-theoretic bounds on quantum advantage in machine learning , 2021, Physical review letters.

[11]  Keisuke Fujii,et al.  Qulacs: a fast and versatile quantum circuit simulator for research purpose , 2020, Quantum.

[12]  Igor L. Markov,et al.  Faster Schrödinger-style simulation of quantum circuits , 2020, 2021 IEEE International Symposium on High-Performance Computer Architecture (HPCA).

[13]  S. Kourtis,et al.  Hyper-optimized tensor network contraction , 2020, Quantum.

[14]  P. Zhang,et al.  Solving the sampling problem of the Sycamore quantum supremacy circuits , 2021 .

[15]  Jian-Wei Pan,et al.  Quantum computational advantage using photons , 2020, Science.

[16]  Bo Yuan,et al.  Classical Simulation of Quantum Supremacy Circuits , 2020, 2005.06787.

[17]  John C. Platt,et al.  Quantum supremacy using a programmable superconducting processor , 2019, Nature.

[18]  Adam Zalcman,et al.  TensorNetwork: A Library for Physics and Machine Learning , 2019, ArXiv.

[19]  Rupak Biswas,et al.  A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware , 2018, npj Quantum Information.

[20]  Adam Kelly,et al.  Simulating Quantum Computers Using OpenCL , 2018, 1805.00988.

[21]  John Preskill,et al.  Quantum Computing in the NISQ era and beyond , 2018, Quantum.

[22]  Robert König,et al.  Quantum advantage with shallow circuits , 2017, Science.

[23]  John A. Gunnels,et al.  Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral , 2017 .

[24]  Aram W. Harrow,et al.  Quantum computational supremacy , 2017, Nature.

[25]  Scott Aaronson,et al.  Complexity-Theoretic Foundations of Quantum Supremacy Experiments , 2016, CCC.

[26]  Krysta Marie Svore,et al.  LIQUi|>: A Software Design Architecture and Domain-Specific Language for Quantum Computing , 2014, ArXiv.

[27]  U. Schollwoeck The density-matrix renormalization group in the age of matrix product states , 2010, 1008.3477.

[28]  Frank Verstraete,et al.  Matrix product state representations , 2006, Quantum Inf. Comput..

[29]  Steven G. Johnson,et al.  The Design and Implementation of FFTW3 , 2005, Proceedings of the IEEE.

[30]  Scott Aaronson,et al.  Improved Simulation of Stabilizer Circuits , 2004, ArXiv.

[31]  G. Vidal Efficient classical simulation of slightly entangled quantum computations. , 2003, Physical review letters.

[32]  Alan R. Jones,et al.  Fast Fourier Transform , 1970, SIGP.