๐ค AI Summary
This work proposes an efficient digital quantum simulation method for time-dependent Hamiltonian evolution, under the assumption that the initial state is confined to a low-energy subspace. By integrating product formulas, adiabatic perturbation theory, and time-dependent commutator-based error analysis, the authors deriveโfor the first timeโa rigorous error bound for simulating dynamics within this low-energy subspace. The analysis demonstrates a significant reduction in the required number of Trotter steps compared to full-space simulation and establishes a lower bound on the query complexity for general time-dependent quantum simulation. The approach exhibits superior resource efficiency and promising applicability in nonequilibrium many-body dynamics and adiabatic quantum state preparation.
๐ Abstract
Hamiltonian simulations are key subroutines in adiabatic quantum computation, quantum control, and quantum many-body physics, where quantum dynamics often happen in the low-energy sector. In contrast to time-independent Hamiltonian simulations, a comprehensive understanding of quantum simulation algorithms for time-dependent Hamiltonians under the low-energy assumption remains limited hitherto. In this paper, we investigate how much we can improve upon the standard performance guarantee assuming the initial state is supported on a low-energy subspace. In particular, we compute the Trotter number of digital quantum simulation based on product formulas for time-dependent spin Hamiltonians under the low-energy assumption that the initial state is supported on a small number of low-energy eigenstates, and show improvements over the standard cost for simulating full unitary simulations. Technically, we derive the low-energy simulation error with commutator scaling for product formulas by leveraging adiabatic perturbation theory to analyze the time-variant energy spectrum of the underlying Hamiltonian. We further discuss the applications to simulations of non-equilibrium quantum many-body dynamics and adiabatic state preparation. Finally, we prove a lower bound of query complexity for generic time-dependent Hamiltonian simulations.