Intermediate-Scale Full State Quantum Circuit Simulation by Using Lossy Data Compression

ORAL

Abstract

To develop, evaluate, and validate new quantum algorithms or quantum computers, we need tools to assess their correctness and fidelity. This requires the capabilities of quantum circuit simulation. However, the number of quantum state amplitudes increases exponentially with the number of qubits, leading to the exponential growth of the memory requirement for the simulations. In this work, we present our quantum circuit simulation by using lossy data compression. We simulate quantum circuits by full-state update technique, and the lossy data compression is applied to the quantum state vector. Our preliminary results suggest that we should be able to significantly increase the size of quantum simulations beyond 50 qubits for certain algorithms.

*This research used resources of the Argonne Leadership Computing Facility, which is a DOE Office of Science User Facility supported under Contract DE-AC02-06CH11357. This research was supported by the ECP, Project Number: 17-SC-20-SC. The material was supported by DOE Office of Science, under contract DE-AC02-06CH11357, and by the NSF under Grant No. 1619253. This work is funded in part by EPiQC, an NSF Expedition in Computing, under grant CCF-1730449. This work is also funded in part by NSF PHY-1818914 and a research gift from Intel.

Presenters

  • Xin-Chuan Wu

    • Department of Computer Science, University of Chicago

Authors

  • Xin-Chuan Wu

    • Department of Computer Science, University of Chicago
  • Sheng Di

    • Argonne National Laboratory
  • Franck Cappello

    • Argonne National Laboratory
  • Hal Finkel

    • Argonne National Laboratory
  • Yuri Alexeev

    • Argonne National Laboratory
  • Fred Chong

    • Department of Computer Science, University of Chicago