Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1502.04536 · Physical Review A

Optimal Trotterization in universal quantum simulators under faulty control

George C. Knee, William J. Munro

Published May 26, 2015• 21 citations
arXivHTMLPDF

Abstract

Universal quantum simulation may provide insights into those many-body systems that cannot be described classically and that cannot be efficiently simulated with current technology. The Trotter formula, which decomposes a desired unitary time evolution of the simulator into a stroboscopic sequence of repeated elementary evolutions, is a key algorithmic component which makes quantum simulation of dynamics tractable. The Trotter number $n$ sets the time scale on which a computer running this algorithm is switched from one elementary evolution to another. In the ideal case, the precision of the simulation can be arbitrarily controlled by increasing $n$. We study a more realistic scenario where each gate is applied imperfectly. The resultant trade-off in errors leads to an ultimate limit on the precision of the simulation. We calculate the optimum Trotter number ${n}^{*}$ that achieves this limit, which is the minimum statistical distance from the actual simulation to the ideal one.

DOI
10.1103/physreva.91.052327

Related papers

Adaptive Trotterization for Time-Dependent Hamiltonian Quantum Dynamics Using Piecewise Conservation Laws

Hongzheng Zhao, Marin Bukov, Markus Heyl +1 more

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.

arXiv:2307.10327•Physical Review Letters•Jul 2, 2024•16 citations

Quantum localization bounds Trotter errors in digital quantum simulation

Markus Heyl, Philipp Hauke, Peter Zoller

A fundamental challenge in digital quantum simulation (DQS) is the control of an inherent error, which appears when discretizing the time evolution of a quantum many-body system as a sequence of quantum gates, called Trotterization. Here, we show that quantum localization-by constraining the time evolution through quantum interference-strongly bounds these errors for local observables, leading to an error independent of system size and simulation time. DQS is thus intrinsically much more robust than suggested by known error bounds on the global many-body wave function. This robustness is characterized by a sharp threshold as a function of the Trotter step size, which separates a localized region with controllable Trotter errors from a quantum chaotic regime. Our findings show that DQS with comparatively large Trotter steps can retain controlled errors for local observables. It is thus possible to reduce the number of gate operations required to represent the desired time evolution faithfully.

arXiv:1806.11123•Science Advances•Apr 5, 2019•129 citations

Halving the Cost of Controlled Time-Evolution

William A. Simon, Peter J. Love

Quantum simulation is a promising application for quantum computing. Quantum simulation algorithms may require the ability to control the time evolution unitary. Naive techniques to control a unitary can substantially increase the required computational resources. A standard approach to controlling Trotterized time evolution doubles the number of single-qubit arbitrary rotations. Here, we describe a compilation scheme that does not increase the number of arbitrary rotations for symmetric Trotterizations, which applies to second-order and higher Suzuki-Trotter decompositions. This halves the number of arbitrary rotations required to implement controlled, Trotterized time evolution compared to the standard approach. Arbitrary rotations contribute significantly to resource estimates in a fault-tolerant architecture due to the number of required magic states. Therefore, arbitrary rotations dominate the $T$-cost of fault-tolerant implementations of quantum simulation. This construction reduces the number of arbitrary rotations for controlled Trotter evolution to that of uncontrolled Trotter evolution, thereby reducing the cost of fault-tolerant quantum simulation.

quant-pharXiv:2511.13855•Nov 19, 2025•0 citations

Learning effective Hamiltonians for adaptive time-evolution quantum algorithms

Hongzheng Zhao, Ao Chen, Shu-Wei Liu +3 more

Digital quantum simulation of many-body dynamics relies on Trotterization to decompose the target time evolution into elementary quantum gates operating at a fixed equidistant time discretization. Recent advances have outlined protocols enabling more efficient adaptive Trotter protocols, which have been shown to exhibit a controlled error in the dynamics of local observables and correlation functions. However, it has remained open to which extent the errors on the actual generator of the dynamics, i.e., the target many-body Hamiltonian, remain controlled. Here, we propose to use quantum Hamiltonian learning to numerically obtain the effective Hamiltonian and apply it on the recently introduced ADA-Trotter algorithm as a concrete demonstration. Our key observation is that deviations from the target generator remain bounded on all simulation times. This result suggests that the ADA-Trotter not only generates reliable digital quantum simulation of local dynamics, but also controllably approximates the global quantum state of the target system. Our proposal is sufficiently general and readily applicable to other adaptive time-evolution algorithms.

arXiv:2406.06198•Jun 10, 2024•0 citations

Quantum localization bounds Trotter errors in digital quantum simulation

Heyl, M., Hauke, P., Zoller, P.

A fundamental challenge in digital quantum simulation (DQS) is the control of an inherent error, which appears when discretizing the time evolution of a quantum many-body system as a sequence of quantum gates, called Trotterization. Here, we show that quantum localization-by constraining the time evolution through quantum interference-strongly bounds these errors for local observables, leading to an error independent of system size and simulation time. DQS is thus intrinsically much more robust than suggested by known error bounds on the global many-body wave function. This robustness is characterized by a sharp threshold as a function of the Trotter step size, which separates a localized region with controllable Trotter errors from a quantum chaotic regime. Our findings show that DQS with comparatively large Trotter steps can retain controlled errors for local observables. It is thus possible to reduce the number of gate operations required to represent the desired time evolution faithfully.

•Apr 12, 2019•97 citations

Beyond Trotterization: Variational Product Formulas for Quantum Simulation

Ibsal Assi, Michael Vogl, Meenu Kumari +1 more

We propose a variational alternative to the Trotter-Suzuki decomposition that provides greater control over errors while preserving the unitary structure of time evolution. The variational parameters in our ansatz are derived from a global action principle, where Euler-Lagrange equations govern their optimal dynamics. Unlike conventional wavefunction-based variational methods, our approach specifically targets the time evolution operation and this allows a single set of optimized parameters to be applied to any initial state for a fixed Hamiltonian avoiding costly optimization procedures. Our method outperforms the standard Trotter-Suzuki formulas, typically achieving higher accuracy than higher-order Suzuki schemes. This translates directly to quantum computing applications, where it enables the design of quantum circuits with fewer gates which reduces noise and improves precision. Although we focus on quantum dynamics, the method is broadly applicable to problems involving general time-evolution operators. Applied to various model Hamiltonians, our approach reduces errors by factors of 2 to 5 compared to Trotter-Suzuki decompositions, demonstrating its promise for accurate quantum simulation with improved efficiency. In certain cases, the variational ansatz achieves higher accuracy than more complex higher-order Suzuki formulas while reducing the gate count by nearly half within a single circuit layer. Furthermore, we derive approximate analytical expressions for the variational parameters up to cubic order in time, valid for generic Hamiltonians. These approximations enable long-time quantum simulations with improved accuracy over equivalent Suzuki decompositions, providing ready-to-use evolution formulas that match Suzuki's gate complexity while delivering better performance.

quant-pharXiv:2511.15124•Nov 20, 2025•0 citations
Universal quantum simulation may provide insights into those many-body systems that cannot be described classically and that cannot be efficiently simulated with current technology. The Trotter formula, which decomposes a desired unitary time evolution of the simulator into a stroboscopic sequence of repeated elementary evolutions, is a key algorithmic component which makes quantum simulation of dynamics tractable. The Trotter number nnn sets the time scale on which a computer running this algorithm is switched from one elementary evolution to another. In the ideal case, the precision of the simulation can be arbitrarily controlled by increasing nnn. We study a more realistic scenario where each gate is applied imperfectly. The resultant trade-off in errors leads to an ultimate limit on the precision of the simulation. We calculate the optimum Trotter number n∗{n}^{*}n∗ that achieves this limit, which is the minimum statistical distance from the actual simulation to the ideal one.
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.
A fundamental challenge in digital quantum simulation (DQS) is the control of an inherent error, which appears when discretizing the time evolution of a quantum many-body system as a sequence of quantum gates, called Trotterization. Here, we show that quantum localization-by constraining the time evolution through quantum interference-strongly bounds these errors for local observables, leading to an error independent of system size and simulation time. DQS is thus intrinsically much more robust than suggested by known error bounds on the global many-body wave function. This robustness is characterized by a sharp threshold as a function of the Trotter step size, which separates a localized region with controllable Trotter errors from a quantum chaotic regime. Our findings show that DQS with comparatively large Trotter steps can retain controlled errors for local observables. It is thus possible to reduce the number of gate operations required to represent the desired time evolution faithfully.
Quantum simulation is a promising application for quantum computing. Quantum simulation algorithms may require the ability to control the time evolution unitary. Naive techniques to control a unitary can substantially increase the required computational resources. A standard approach to controlling Trotterized time evolution doubles the number of single-qubit arbitrary rotations. Here, we describe a compilation scheme that does not increase the number of arbitrary rotations for symmetric Trotterizations, which applies to second-order and higher Suzuki-Trotter decompositions. This halves the number of arbitrary rotations required to implement controlled, Trotterized time evolution compared to the standard approach. Arbitrary rotations contribute significantly to resource estimates in a fault-tolerant architecture due to the number of required magic states. Therefore, arbitrary rotations dominate the TTT-cost of fault-tolerant implementations of quantum simulation. This construction reduces the number of arbitrary rotations for controlled Trotter evolution to that of uncontrolled Trotter evolution, thereby reducing the cost of fault-tolerant quantum simulation.
Digital quantum simulation of many-body dynamics relies on Trotterization to decompose the target time evolution into elementary quantum gates operating at a fixed equidistant time discretization. Recent advances have outlined protocols enabling more efficient adaptive Trotter protocols, which have been shown to exhibit a controlled error in the dynamics of local observables and correlation functions. However, it has remained open to which extent the errors on the actual generator of the dynamics, i.e., the target many-body Hamiltonian, remain controlled. Here, we propose to use quantum Hamiltonian learning to numerically obtain the effective Hamiltonian and apply it on the recently introduced ADA-Trotter algorithm as a concrete demonstration. Our key observation is that deviations from the target generator remain bounded on all simulation times. This result suggests that the ADA-Trotter not only generates reliable digital quantum simulation of local dynamics, but also controllably approximates the global quantum state of the target system. Our proposal is sufficiently general and readily applicable to other adaptive time-evolution algorithms.
A fundamental challenge in digital quantum simulation (DQS) is the control of an inherent error, which appears when discretizing the time evolution of a quantum many-body system as a sequence of quantum gates, called Trotterization. Here, we show that quantum localization-by constraining the time evolution through quantum interference-strongly bounds these errors for local observables, leading to an error independent of system size and simulation time. DQS is thus intrinsically much more robust than suggested by known error bounds on the global many-body wave function. This robustness is characterized by a sharp threshold as a function of the Trotter step size, which separates a localized region with controllable Trotter errors from a quantum chaotic regime. Our findings show that DQS with comparatively large Trotter steps can retain controlled errors for local observables. It is thus possible to reduce the number of gate operations required to represent the desired time evolution faithfully.
We propose a variational alternative to the Trotter-Suzuki decomposition that provides greater control over errors while preserving the unitary structure of time evolution. The variational parameters in our ansatz are derived from a global action principle, where Euler-Lagrange equations govern their optimal dynamics. Unlike conventional wavefunction-based variational methods, our approach specifically targets the time evolution operation and this allows a single set of optimized parameters to be applied to any initial state for a fixed Hamiltonian avoiding costly optimization procedures. Our method outperforms the standard Trotter-Suzuki formulas, typically achieving higher accuracy than higher-order Suzuki schemes. This translates directly to quantum computing applications, where it enables the design of quantum circuits with fewer gates which reduces noise and improves precision. Although we focus on quantum dynamics, the method is broadly applicable to problems involving general time-evolution operators. Applied to various model Hamiltonians, our approach reduces errors by factors of 2 to 5 compared to Trotter-Suzuki decompositions, demonstrating its promise for accurate quantum simulation with improved efficiency. In certain cases, the variational ansatz achieves higher accuracy than more complex higher-order Suzuki formulas while reducing the gate count by nearly half within a single circuit layer. Furthermore, we derive approximate analytical expressions for the variational parameters up to cubic order in time, valid for generic Hamiltonians. These approximations enable long-time quantum simulations with improved accuracy over equivalent Suzuki decompositions, providing ready-to-use evolution formulas that match Suzuki's gate complexity while delivering better performance.