%0 Generic %1 strano2023exact %A Strano, Daniel %A Bollay, Benn %A Blaauw, Aryan %A Shammah, Nathan %A Zeng, William J. %A Mari, Andrea %D 2023 %K quantumcomputing %T Exact and approximate simulation of large quantum circuits on a single GPU %U http://arxiv.org/abs/2304.14969 %X 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ödinger 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 $4\%$, a task commonly considered hard without super-computing resources.

@misc{strano2023exact, abstract = {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.}, added-at = {2023-05-02T16:07:19.000+0200}, author = {Strano, Daniel and Bollay, Benn and Blaauw, Aryan and Shammah, Nathan and Zeng, William J. and Mari, Andrea}, biburl = {https://www.bibsonomy.org/bibtex/2ad0c10fbf61c4ff323612a9f81f22e01/cmcneile}, description = {Exact and approximate simulation of large quantum circuits on a single GPU}, interhash = {15456590efc7f058affa736cc304d894}, intrahash = {ad0c10fbf61c4ff323612a9f81f22e01}, keywords = {quantumcomputing}, note = {cite arxiv:2304.14969}, timestamp = {2023-05-02T16:07:19.000+0200}, title = {Exact and approximate simulation of large quantum circuits on a single GPU}, url = {http://arxiv.org/abs/2304.14969}, year = 2023 }