Digital quantum simulation relies on Trotterization to discretize time evolution into elementary quantum gates. On current quantum processors with notable gate imperfections, there is a critical trade-off between improved accuracy for finer time steps, and increased error rate on account of the larger circuit depth. We present an adaptive Trotterization algorithm to cope with time dependent Hamiltonians, where we propose a concept of piecewise "conserved" quantities to estimate errors in the time evolution between two (nearby) points in time; these allow us to bound the errors accumulated over the full simulation period. They reduce to standard conservation laws in the case of time independent Hamiltonians, for which we first developed an adaptive Trotterization scheme [H. Zhao et al., Making Trotterization adaptive and energy-self-correcting for NISQ devices and beyond, PRX Quantum 4, 030319 (2023).2691-339910.1103/PRXQuantum.4.030319]. We validate the algorithm for a time dependent quantum spin chain, demonstrating that it can outperform the conventional Trotter algorithm with a fixed step size at a controlled error.
Download full-text PDF |
Source |
---|---|
http://dx.doi.org/10.1103/PhysRevLett.133.010603 | DOI Listing |
Phys Rev Lett
July 2024
Max Planck Institute for the Physics of Complex Systems, Nöthnitzer Straße 38, 01187 Dresden, Germany.
Digital quantum simulation relies on Trotterization to discretize time evolution into elementary quantum gates. On current quantum processors with notable gate imperfections, there is a critical trade-off between improved accuracy for finer time steps, and increased error rate on account of the larger circuit depth. We present an adaptive Trotterization algorithm to cope with time dependent Hamiltonians, where we propose a concept of piecewise "conserved" quantities to estimate errors in the time evolution between two (nearby) points in time; these allow us to bound the errors accumulated over the full simulation period.
View Article and Find Full Text PDFJ Chem Theory Comput
July 2023
ByteDance Research, Zhonghang Plaza, No. 43, North Third Ring West Road, Haidian District, Beijing 100089, China.
Quantum imaginary time evolution (QITE) is one of the promising candidates for finding the eigenvalues and eigenstates of a Hamiltonian on a quantum computer. However, the original proposal suffers from large circuit depth and measurements due to the size of the Pauli operator pool and Trotterization. To alleviate the requirement for deep circuits, we propose a time-dependent drifting scheme inspired by the qDRIFT algorithm [Campbell, E.
View Article and Find Full Text PDFEnter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!