Related Experiment Video
Updated: Jun 19, 2025

Generation and Coherent Control of Pulsed Quantum Frequency Combs
Published on: June 8, 2018
Adaptive Trotterization for Time-Dependent Hamiltonian Quantum Dynamics Using Piecewise Conservation Laws
Hongzheng Zhao1,2,3, Marin Bukov2, Markus Heyl2,4
1School of Physics, <a href="https://ror.org/02v51f717">Peking University</a>, 100871 Beijing, China.
Abstract:
Digital quantum simulation relies on Trotterization to discretize time evolution into elementary quantum gates. On current quantum processors with notable gate imperfections, there is a critical trade-off between improved accuracy for finer time steps, and increased error rate on account of the larger circuit depth. We present an adaptive Trotterization algorithm to cope with time dependent Hamiltonians, where we propose a concept of piecewise "conserved" quantities to estimate errors in the time evolution between two (nearby) points in time; these allow us to bound the errors accumulated over the full simulation period. They reduce to standard conservation laws in the case of time independent Hamiltonians, for which we first developed an adaptive Trotterization scheme [H. Zhao et al., Making Trotterization adaptive and energy-self-correcting for NISQ devices and beyond, PRX Quantum 4, 030319 (2023).2691-339910.1103/PRXQuantum.4.030319]. We validate the algorithm for a time dependent quantum spin chain, demonstrating that it can outperform the conventional Trotter algorithm with a fixed step size at a controlled error.
Related Concept Videos
Conservation of Linear Momentum for a System of Particles
The impulsive force at play during this interaction is of extremely short duration, rendering its impulse negligible. When...
Linear Approximation in Time Domain
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
Euler Equations of Motion
Conservation of Momentum: Introduction
Conservation of Angular Momentum
Euler's Equations of Motion

