Q-GPU: A Recipe of Optimizations for Quantum Circuit Simulation Using GPUs

被引:0
作者
Zhao, Yilun [1 ]
Guo, Yanan [2 ]
Yao, Yuan [1 ]
Dumi, Amanda [3 ]
Mulvey, Devin M. [3 ]
Upadhyay, Shiv [3 ]
Zhang, Youtao [1 ]
Jordan, Kenneth D. [3 ]
Yang, Jun [2 ]
Tang, Xulong [1 ]
机构
[1] Univ Pittsburgh, Dept Comp Sci, Pittsburgh, PA 15260 USA
[2] Univ Pittsburgh, Dept Elect & Comp Engn, Pittsburgh, PA USA
[3] Univ Pittsburgh, Dept Chem, Pittsburgh, PA 15260 USA
来源
2022 IEEE INTERNATIONAL SYMPOSIUM ON HIGH-PERFORMANCE COMPUTER ARCHITECTURE (HPCA 2022) | 2022年
基金
美国国家科学基金会;
关键词
Quantum Circuit Simulation; GPU; CLASSICAL SIMULATION;
D O I
10.1109/HPCA53966.2022.00059
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In recent years, quantum computing has undergone significant developments and has established its supremacy in many application domains. While quantum hardware is accessible to the public through the cloud environment, a robust and efficient quantum circuit simulator is necessary to investigate the constraints and foster quantum computing development, such as quantum algorithm development and quantum device architecture exploration. In this paper, we observe that most of the publicly available quantum circuit simulators (e.g., QISKit from IBM, QDK from Microsoft, and Qsim-Cirq from Google) suffer from slow simulation and poor scalabfiity when the number of qubits increases. To this end, we systematically investigate the deficiencies in quantum circuit simulation (QCS) and propose Q-GPU, a framework that leverages GPUs with comprehensive optimizations to allow efficient and scalable QCS. Specifically, Q-GPU features i) proactive state amplitude transfer, ii) zero state amplitude pruning, iii) delayed qubit involvement, and iv) lossless non-zero state amplitude compression. Experimental results across nine representative quantum circuits indicate that Q-GPU significantly reduces the execution time of the state-of-the-art GPU-based QCS by 71.89% (3.55x speedup). Q-GPU also outperforms the state-of-the-art OpenMP CPU implementation, the Google Qsim-Cirq simulator, and the Microsoft QDK simulator by 1.49 x, 2.02 x, and 10.82 x, respectively.
引用
收藏
页码:726 / 740
页数:15
相关论文
共 57 条
  • [1] Improved simulation of stabilizer circuits
    Aaronson, S
    Gottesman, D
    [J]. PHYSICAL REVIEW A, 2004, 70 (05): : 052328 - 1
  • [2] Bond breaking with auxiliary-field quantum monte carlo
    Al-Saidi, W. A.
    Zhang, Shiwei
    Krakauer, Henry
    [J]. JOURNAL OF CHEMICAL PHYSICS, 2007, 127 (14)
  • [3] Aleksandrowicz G, 2019, QISKIT OPEN SOURCE F, DOI [DOI 10.5281/ZENODO.2562111, 10.5281/zenodo.2562111]
  • [4] Amariutei A., 2011, 15 INT C SYST THEOR, P1
  • [5] Multiparticle entanglement purification for two-colorable graph states -: art. no. 012319
    Aschauer, H
    Dür, W
    Briegel, HJ
    [J]. PHYSICAL REVIEW A, 2005, 71 (01):
  • [6] Avila Anderson, 2014, S APPL COMPUTING, P860, DOI [DOI 10.1145/2554850.2554892, 10.1145/2554850.2554892 (page 156, DOI 10.1145/2554850.2554892(PAGE156]
  • [7] The density matrix renormalization group in chemistry and molecular physics: Recent developments and new challenges
    Baiardi, Alberto
    Reiher, Markus
    [J]. JOURNAL OF CHEMICAL PHYSICS, 2020, 152 (04)
  • [8] Quantum complexity theory
    Bernstein, E
    Vazirani, U
    [J]. SIAM JOURNAL ON COMPUTING, 1997, 26 (05) : 1411 - 1473
  • [9] Characterizing quantum supremacy in near-term devices
    Boixo, Sergio
    Isakov, Sergei, V
    Smelyanskiy, Vadim N.
    Babbush, Ryan
    Ding, Nan
    Jiang, Zhang
    Bremner, Michael J.
    Martinis, John M.
    Neven, Hartmut
    [J]. NATURE PHYSICS, 2018, 14 (06) : 595 - 600
  • [10] On the complexity and verification of quantum random circuit sampling
    Bouland, Adam
    Fefferman, Bill
    Nirkhe, Chinmay
    Vazirani, Umesh
    [J]. NATURE PHYSICS, 2019, 15 (02) : 159 - +