Fast Classical Simulation of Hamiltonian Dynamics by Simultaneous Diagonalization Using Clifford Transformation with Parallel Computation
arXiv:2206.11664 · doi:10.1016/j.cpc.2023.108720
Abstract
Simulating quantum many-body dynamics is important both for fundamental understanding of physics and practical applications for quantum information processing. Therefore, classical simulation methods have been developed so far. Specifically, the Trotter-Suzuki decomposition can analyze a highly complex quantum dynamics, if the number of qubits is sufficiently small so that main memory can store the state vector. However, simulation of quantum dynamics via Trotter-Suzuki decomposition requires huge number of steps, each of which accesses the state vector, and hence the simulation time becomes impractically long. To settle this issue, we propose a technique to accelerate simulation of quantum dynamics via simultaneous diagonalization of mutually commuting Pauli groups, which is also attracting a lot of attention to reduce the measurement overheads in quantum algorithms. We group the Hamiltonian into mutually commputing Pauli strings, and each of them are diagonalized in the computational basis via a Clifford transformation. Since diagonal operators are applied on the state vector simultaneously with minimum memory access, this method successfully use performance of highly parallel processors such as Graphics Processing Units (GPU). Compared to an implementation using one of the fastest simulators of quantum computers, the numerical experiments have shown that our method provides a few tens of times acceleration.
arXiv comment14 + 2 pages, 7 + 1 figures
References in corpus (11)
- A variational eigenvalue solver on a quantum processor
- Quantum Annealing in the Transverse Ising Model
- Gapless Spin-Fluid Ground State in a Random Quantum Heisenberg Magnet
- Comments on the Sachdev-Ye-Kitaev model
- Improved Simulation of Stabilizer Circuits
- Observation of a Discrete Time Crystal
- Measuring the scrambling of quantum information
- Verified Quantum Information Scrambling
- Measurement Optimization in the Variational Quantum Eigensolver Using a Minimum Clique Cover
- A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
- Scrambling of Quantum Information in Quantum Many-Body Systems