Minimum Trotterization Formulas for a Time-Dependent Hamiltonian
arXiv:2212.06788 · doi:10.22331/q-2023-11-06-1168
Abstract
When a time propagator for duration consists of two noncommuting parts , Trotterization approximately decomposes the propagator into a product of exponentials of and . Various Trotterization formulas have been utilized in quantum and classical computers, but much less is known for the Trotterization with the time-dependent generator . Here, for given by the sum of two operators and with time-dependent coefficients , we develop a systematic approach to derive high-order Trotterization formulas with minimum possible exponentials. In particular, we obtain fourth-order and sixth-order Trotterization formulas involving seven and fifteen exponentials, respectively, which are no more than those for time-independent generators. We also construct another fourth-order formula consisting of nine exponentials having a smaller error coefficient. Finally, we numerically benchmark the fourth-order formulas in a Hamiltonian simulation for a quantum Ising chain, showing that the 9-exponential formula accompanies smaller errors per local quantum gate than the well-known Suzuki formula.
15 pages, 5 figure
References in corpus (5)
- The Magnus expansion and some of its applications
- Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space
- Optimised Trotter Decompositions for Classical and Quantum Computing
- Optimal Hamiltonian simulation for time-periodic systems
- Time Dependent Hamiltonian Simulation Using Discrete Clock Constructions
Cited by in corpus (8)
- Beyond-classical computation in quantum simulation
- Adaptive Trotterization for time-dependent Hamiltonian quantum dynamics using piecewise conservation laws
- Block encoding bosons by signal processing
- Measuring Trotter error and its application to precision-guaranteed Hamiltonian simulations
- On Strong Bounds for Trotter and Zeno Product Formulas with Bosonic Applications
- Quantum simulation of time-dependent Hamiltonians via commutator-free quasi-Magnus operators
- Unifying framework for quantum simulation algorithms for time-dependent Hamiltonian dynamics
- Multi-target quantum compilation algorithm