Unifying framework for quantum simulation algorithms for time-dependent Hamiltonian dynamics
Open Access
- 19 November 2025
- journal article
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (4)
Abstract
Recently, there has been growing interest in simulating time-dependent Hamiltonians using quantum algorithms, driven by diverse applications, such as quantum adiabatic computing. While techniques for simulating time-independent Hamiltonian dynamics are well established, time-dependent Hamiltonian dynamics is less explored and it is unclear how to systematically organize existing methods and to find new methods. Sambe-Howland's continuous clock elegantly transforms time-dependent Hamiltonian dynamics into time-independent Hamiltonian dynamics, which means that by taking different discretizations, existing methods for time-independent Hamiltonian dynamics can be exploited for time-dependent dynamics. In this work, we systemically investigate how Sambe-Howland's clock can serve as a unifying framework for simulating time-dependent Hamiltonian dynamics. First, we demonstrate the versatility of this approach by showcasing its compatibility with analog quantum computing and digital quantum computing. Second, for digital quantum computers, we illustrate how this framework, combined with time-independent methods (e.g., product formulas, multiproduct formulas, qDrift, and linear combination of unitaries-Taylor), can facilitate the development of efficient algorithms for simulating time-dependent dynamics. This framework allows us to (1) resolve the problem of finding minimum-gate time-dependent product formulas; (2) establish a unified picture of both Suzuki's and Huyghebaert and De Raedt's approaches; (3) generalize Huyghebaert and De Raedt's first- and second-order formula to arbitrary orders; (4) answer an unsolved question in establishing time-dependent multiproduct formulas; (5) and recover continuous qDrift on the same footing as time-independent qDrift. Third, we demonstrate the efficacy of our higher-order Huyghebaert and De Raedt's algorithm through digital adiabatic simulation.Keywords
All Related Versions
Funding Information
- National Natural Science Foundation of China (12341104, 12426637, 12471411)
- Shanghai Jiao Tong University
- Fundamental Research Funds for the Central Universities
- Science and Technology Commission of Shanghai Municipality (24LZ1401200, 21JC1402900)
This publication has 66 references indexed in Scilit:
- Time-Dependent Hamiltonian Simulation via Magnus Expansion: Algorithm and SuperconvergenceCommunications in Mathematical Physics, 2025
- A Partially Random Trotter Algorithm for Quantum Hamiltonian SimulationsCommunications on Applied Mathematics and Computation, 2023
- Control of Quantum Noise: On the Role of DilationsAnnales Henri Poincare, 2022
- Efficient Quantum Algorithms for Simulating Sparse HamiltoniansCommunications in Mathematical Physics, 2006
- Fractal decomposition of exponential operators with applications to many-body theories and Monte Carlo simulationsPhysics Letters A, 1990
- Fourth-order symplectic integrationPhysica D: Nonlinear Phenomena, 1990
- Product formula algorithms for solving the time dependent Schrödinger equationComputer Physics Reports, 1987
- Simulating physics with computersInternational Journal of Theoretical Physics, 1982
- Generalized Trotter's formula and systematic approximants of exponential operators and inner derivations with applications to many-body problemsCommunications in Mathematical Physics, 1976
- Stationary scattering theory for time-dependent HamiltoniansMathematische Annalen, 1974