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

Bulletin of the American Physical Society

Trotter Error Scaling with System Size in Quantum Simulations

Matthias Troyer, Natalie Pearson, David Poulin

Published Mar 5, 2019• 1 citation
OpenAlex

Related papers

Lindbladian Simulation with Commutator Bounds

Xinzhao Wang, Shuo Zhou, Xiaoyang Wang +3 more

Trotter decomposition provides a simple approach to simulating open quantum systems by decomposing the Lindbladian into a sum of individual terms. While it is established that Trotter errors in Hamiltonian simulation depend on nested commutators of the summands, such a relationship remains poorly understood for Lindbladian dynamics. In this Letter, we derive commutator-based Trotter error bounds for Lindbladian simulation, yielding an $O(\sqrt{N})$ scaling in the number of Trotter steps for locally interacting systems on $N$ sites. When estimating observable averages, we apply Richardson extrapolation to achieve polylogarithmic precision while maintaining the commutator scaling. To bound the extrapolation remainder, we develop a general truncation bound for the Baker-Campbell-Hausdorff expansion that bypasses common convergence issues in physically relevant systems. For local Lindbladians, our results demonstrate that the Trotter-based methods outperform prior simulation techniques in system-size scaling while requiring only $O(1)$ ancillas. Numerical simulations further validate the predicted system-size and precision scaling.

quant-pharXiv:2603.28602•Mar 31, 2026•11 citations

Error Scaling with System Size in Digital Quantum Simulations

Natalie Pearson, Matthias Troyer, David Poulin

Bulletin of the American Physical Society•Jun 3, 2021•0 citations

Trotter Errors and the Emergence of Chaos in Quantum Simulation

Kevin W. Kuper, Jon Pajaud, Karthik Chinni +2 more

As noisy intermediate-scale quantum (NISQ) processors increase in size and complexity, their use as general purpose quantum simulators will rely on algorithms based on the Trotter-Suzuki expansion. We run quantum simulations on a small, highly accurate quantum processor, and show how one can optimize simulation accuracy by balancing algorithmic (Trotter) errors against native errors specific to the quantum hardware at hand. We further study the interplay between native errors, Trotter errors, and the emergence of chaos as seen in measurements of a time averaged fidelity-out-of-time-ordered-correlator

arXiv:2212.03843•Dec 7, 2022•5 citations

Unbiased Hamiltonian Simulation by Reversing Trotter Error Dynamics

Keisuke Murota, Yuta Kikuchi, Enrico Rinaldi +2 more

Owing to their simplicity and low overhead, Suzuki-Trotter formulas remain the de facto Hamiltonian simulation methods on current quantum computing platforms. Systematic Trotter errors, however, will quickly become limiting when scaling to larger problems and aiming for higher accuracy. We present a mechanism that removes the systematic error of any $k$-th order Suzuki-Trotter simulation, at the cost of a constant sampling overhead. The key insight is that the Trotter error is itself a coherent dynamics to be reversed, rather than a deviation to be bounded. By identifying the structure of this error in closed form, we carry out that reversal through quasi-probabilistic decompositions. The resulting algorithm, called Probabilistic Trotter Error Reversal (PTER), is unbiased and still improves the gate-count scaling of Suzuki-Trotter formulas while retaining their simplicity. Numerical simulations of a Heisenberg spin chain support the predicted resource advantage already at modest system sizes.

quant-pharXiv:2606.29741•Jun 30, 2026•2 citations

Scaling up quantum simulations

Jürgen Berges

Nature•May 15, 2019•5 citations

Quantum Monte Carlo Simulations: An Introduction

Kurt Binder, Dieter W. Heermann

Graduate texts in physics•Jan 1, 2010•2 citations
Trotter decomposition provides a simple approach to simulating open quantum systems by decomposing the Lindbladian into a sum of individual terms. While it is established that Trotter errors in Hamiltonian simulation depend on nested commutators of the summands, such a relationship remains poorly understood for Lindbladian dynamics. In this Letter, we derive commutator-based Trotter error bounds for Lindbladian simulation, yielding an O(N)O(\sqrt{N})O(N​) scaling in the number of Trotter steps for locally interacting systems on NNN sites. When estimating observable averages, we apply Richardson extrapolation to achieve polylogarithmic precision while maintaining the commutator scaling. To bound the extrapolation remainder, we develop a general truncation bound for the Baker-Campbell-Hausdorff expansion that bypasses common convergence issues in physically relevant systems. For local Lindbladians, our results demonstrate that the Trotter-based methods outperform prior simulation techniques in system-size scaling while requiring only O(1)O(1)O(1) ancillas. Numerical simulations further validate the predicted system-size and precision scaling.
As noisy intermediate-scale quantum (NISQ) processors increase in size and complexity, their use as general purpose quantum simulators will rely on algorithms based on the Trotter-Suzuki expansion. We run quantum simulations on a small, highly accurate quantum processor, and show how one can optimize simulation accuracy by balancing algorithmic (Trotter) errors against native errors specific to the quantum hardware at hand. We further study the interplay between native errors, Trotter errors, and the emergence of chaos as seen in measurements of a time averaged fidelity-out-of-time-ordered-correlator
Owing to their simplicity and low overhead, Suzuki-Trotter formulas remain the de facto Hamiltonian simulation methods on current quantum computing platforms. Systematic Trotter errors, however, will quickly become limiting when scaling to larger problems and aiming for higher accuracy. We present a mechanism that removes the systematic error of any kkk-th order Suzuki-Trotter simulation, at the cost of a constant sampling overhead. The key insight is that the Trotter error is itself a coherent dynamics to be reversed, rather than a deviation to be bounded. By identifying the structure of this error in closed form, we carry out that reversal through quasi-probabilistic decompositions. The resulting algorithm, called Probabilistic Trotter Error Reversal (PTER), is unbiased and still improves the gate-count scaling of Suzuki-Trotter formulas while retaining their simplicity. Numerical simulations of a Heisenberg spin chain support the predicted resource advantage already at modest system sizes.