Time-Dependent Hamiltonian Simulation in the Low-Energy Subspace
Shuo Zhou, Zhaokai Pan, Weiyuan Gong, Tongyang Li

TL;DR
This paper advances the understanding of simulating time-dependent Hamiltonians in the low-energy subspace, providing improved algorithms and theoretical bounds relevant for quantum physics and computation.
Contribution
It introduces improved Trotter formulas for low-energy subspace simulation and establishes lower bounds on query complexity for such Hamiltonian simulations.
Findings
Enhanced Trotter number bounds for low-energy Hamiltonian simulation
Derived low-energy simulation error with commutator scaling
Proved lower bounds on query complexity for general time-dependent Hamiltonians
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.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum many-body systems · Quantum Information and Cryptography
