Memory-Efficient Quantum Circuit Simulation by Using Lossy Data Compression
arXiv:1811.05630
Abstract
In order to evaluate, validate, and refine the design of new quantum algorithms or quantum computers, researchers and developers need methods to assess their correctness and fidelity. This requires the capabilities of quantum circuit simulations. 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 memory-efficient quantum circuit simulation by using lossy data compression. Our empirical data shows that we reduce the memory requirement to 16.5% and 2.24E-06 of the original requirement for QFT and Grover's search, respectively. This finding further suggests that we can simulate deep quantum circuits up to 63 qubits with 0.8 petabytes memory.
arXiv comment2 pages, 2 figures. The 3rd International Workshop on Post-Moore Era Supercomputing (PMES)
References in corpus (8)
- Simulating quantum computation by contracting tensor networks
- Massive Parallel Quantum Computer Simulator
- 0.5 Petabyte Simulation of a 45-Qubit Quantum Circuit
- 64-Qubit Quantum Circuit Simulation
- qHiPSTER: The Quantum High Performance Software Testing Environment
- Simulation of low-depth quantum circuits as complex undirected graphical models
- Classical Simulation of Intermediate-Size Quantum Circuits
- Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral