Skip to content
DraconiticResearch
Search Sources API
203,203 studies31 sourcesUpdated 16 min ago
PreprintCC BY-SA 4.0arXiv

Suzuki-Trotter Decompositions and other Methods for Quantum Time Evolution

Abstract

(Suzuki-)Trotter decompositions, splitting methods, (Lie) product formulae... The most common numerical methods for the time evolution of quantum systems come with many names. And they are used practically everywhere with applications ranging from the solution of classical equations of motion and various Monte Carlo simulations to the real and imaginary time evolution on classical as well as quantum computers. Here we review the state of the art of said methods, focussing especially on the progress made over the last few years. We highlight recently discovered efficient time evolution algorithms and explain how best to use them in practice. A central part of this work is the estimation of error bounds that has improved greatly within the past decade. The relevance of time evolution methods for quantum computing is discussed with a focus on noisy hardware. Finally, a comprehensive overview of generalisations, related methods and alternatives to Trotterization is provided. This includes time-dependent Hamiltonian dynamics, processed methods, multi-product formulae, symplectic integrators, TDVP for tensor networks, quantum signal processing, Crouch-Grossman methods and more. The overall perspective in this work is that of a theoretical physicist. All mathematical proofs as well as some technical details are omitted for easier readability. Instead, this review serves as a hands-on guide and, of course, as a starting point for references that provide further details.

Related

  1. Efficient Quantum Simulation of Linearized Vlasov--Poisson Dynamics Using Trotter and THRIFT Hamiltonian Simulation Methods
    Kartick Paul, Rahul V, S. Aravinda +1
    arXivPreprintarXiv licenceFull textComputational physicsPlasma physicsarXiv
  2. Sparse-QITE: Discovering Compact Generators for Quantum Imaginary-Time Evolution via Regularization Methods
    Rafael Gómez-Lurbe, Luca Ion, Alberto Acevedo +1
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  3. Effects of Trotter Error, Digitization Error, and Initial State Overlap on Tapered Quantum Phase Estimation for Minimum Eigenvalue Computation
    Elijah Pelofske, Stephan Eidenbenz
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingCondensed matterarXiv
  4. Estimates of ground state energies for the quantum SK and 2D-EA models, using deGennes-Suzuki-Kubo mean-field annealing dynamics
    Soumyaditya Das, Soumyajyoti Biswas, Bikas K. Chakrabarti
    arXivPreprintarXiv licenceFull textCondensed matterStatistical & nonlinear physicsarXiv
  5. Quantum Partial Information Decompositions, an Operational Order on Ensembles, and Direct Quantifications of Objective Information
    Alexander Nico-Katz
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
BibTeX
@misc{ostmeyer2026suzukitrotter,
  title = {{Suzuki-Trotter Decompositions and other Methods for Quantum Time Evolution}},
  author = {Johann Ostmeyer},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.19184},
  eprint = {2609.19184},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.19184},
  note = {CC BY-SA 4.0},
}
RIS
TY  - UNPB
TI  - Suzuki-Trotter Decompositions and other Methods for Quantum Time Evolution
AU  - Johann Ostmeyer
PY  - 2026
DA  - 2026/09/15
PB  - arXiv
DO  - 10.48550/arxiv.2609.19184
UR  - https://arxiv.org/abs/2609.19184
AB  - (Suzuki-)Trotter decompositions, splitting methods, (Lie) product formulae... The most common numerical methods for the time evolution of quantum systems come with many names. And they are used practically everywhere with applications ranging from the solution of classical equations of motion and various Monte Carlo simulations to the real and imaginary time evolution on classical as well as quantum computers. Here we review the state of the art of said methods, focussing especially on the progress made over the last few years. We highlight recently discovered efficient time evolution algorithms and explain how best to use them in practice. A central part of this work is the estimation of error bounds that has improved greatly within the past decade. The relevance of time evolution methods for quantum computing is discussed with a focus on noisy hardware. Finally, a comprehensive overview of generalisations, related methods and alternatives to Trotterization is provided. This includes time-dependent Hamiltonian dynamics, processed methods, multi-product formulae, symplectic integrators, TDVP for tensor networks, quantum signal processing, Crouch-Grossman methods and more. The overall perspective in this work is that of a theoretical physicist. All mathematical proofs as well as some technical details are omitted for easier readability. Instead, this review serves as a hands-on guide and, of course, as a starting point for references that provide further details.
ER  -