A Monte Carlo approach to bound Trotter error

• URL: http://arxiv.org/abs/2510.11621v1
• Date: Mon, 13 Oct 2025 17:03:13 GMT
• Title: A Monte Carlo approach to bound Trotter error
• Authors: Nick S. Blunt, Aleksei V. Ivanov, Andreas Juul Bay-Smidt,
• Abstract summary: We show that the spectral norm of an operator can be upper bounded by the spectral norm of an equivalent sign-problem-free operator.<n>We demonstrate that this Monte Carlo-based bound is often extremely tight, and even exact in some instances.<n>For the uniform electron gas we reduce the cost of performing Trotterization from the literature by an order of magnitude.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Trotter product formulas are a natural and powerful approach to perform quantum simulation. However, the error analysis of product formulas is challenging, and their cost is often overestimated. It is established that Trotter error can be bounded in terms of spectral norms of nested commutators of the Hamiltonian partitions [Childs et al., Phys. Rev. X 11, 011020], but evaluating these expressions is challenging, often achieved by repeated application of the triangle inequality, significantly loosening the bound. Here, we show that the spectral norm of an operator can be upper bounded by the spectral norm of an equivalent sign-problem-free operator, which can be calculated efficiently to large system sizes using projector Monte Carlo simulation. For a range of Hamiltonians and considering second-order formulas, we demonstrate that this Monte Carlo-based bound is often extremely tight, and even exact in some instances. For the uniform electron gas we reduce the cost of performing Trotterization from the literature by an order of magnitude. For the Pariser-Parr-Pople model for linear acene molecules, which has $\mathcal{O}(N^2)$ long-range interaction terms, we show that it suffices to use $\mathcal{O}(N^{0.57})$ Trotter steps and circuit depth $\mathcal{O}(N^{1.57})$ to implement Hamiltonian simulation. We hope that this approach will lead to a better understanding of the potential accuracy of Trotterization in a range of important applications.

Related papers

• Entanglement-Dependent Error Bounds for Hamiltonian Simulation [0.0]
  We prove that the first-order Trotter error scales as $mathcalO(t2 S_textmax operatornamepolylog(n)/r)$ rather than the worst-case $mathcalO(t2 n/r)$.<n>These results have immediate applications to quantum chemistry, condensed matter simulation, and resource estimation for fault-tolerant quantum computing.
  arXiv  Detail & Related papers  (2026-01-31T06:34:37Z)
• Slow Mixing of Quantum Gibbs Samplers [47.373245682678515]
  We present a quantum generalization of these tools through a generic bottleneck lemma.<n>This lemma focuses on quantum measures of distance, analogous to the classical Hamming distance but rooted in uniquely quantum principles.<n>We show how to lift classical slow mixing results in the presence of a transverse field using Poisson Feynman-Kac techniques.
  arXiv  Detail & Related papers  (2024-11-06T22:51:27Z)
• Trotter error time scaling separation via commutant decomposition [6.418044102466421]
  We improve the estimate of the Trotter error over existing bounds by introducing a general framework of commutant decomposition.<n>We show that this formalism not only straightforwardly reproduces previous results but also provides a better error estimate for higher-order product formulas.
  arXiv  Detail & Related papers  (2024-09-25T05:25:50Z)
• Exponentially Reduced Circuit Depths Using Trotter Error Mitigation [0.0]
  Richardson and extrapolation have been proposed to mitigate the Trotter error incurred by use of these formulae. This work provides an improved, rigorous analysis of these techniques for calculating time-evolved expectation values. We demonstrate that, to achieve error $epsilon$ in a simulation of time $T$ using a $ptextth$-order product formula with extrapolation, circuits of depths $Oleft(T1+1/p textrmpolylog (1/epsilon)right)$ are sufficient.
  arXiv  Detail & Related papers  (2024-08-26T16:08:07Z)
• On the complexity of implementing Trotter steps [2.1369834525800138]
  We develop methods to perform faster Trotter steps with complexity sublinear in number of terms. We also realize faster Trotter steps when certain blocks of Hamiltonian coefficients have low rank. Our result suggests the use of Hamiltonian structural properties as both necessary and sufficient to implement Trotter synthesis steps with lower gate complexity.
  arXiv  Detail & Related papers  (2022-11-16T19:00:01Z)
• Time Dependent Hamiltonian Simulation Using Discrete Clock Constructions [42.3779227963298]
  We provide a framework for encoding time dependent dynamics as time independent systems. First, we create a time dependent simulation algorithm based on performing qubitization on the augmented clock system. Second, we define a natural generalization of multiproduct formulas for time-ordered exponentials.
  arXiv  Detail & Related papers  (2022-03-21T21:29:22Z)
• Average-case Speedup for Product Formulas [69.68937033275746]
  Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states. Our results open doors to the study of quantum algorithms in the average case.
  arXiv  Detail & Related papers  (2021-11-09T18:49:48Z)
• Hamiltonian simulation with random inputs [74.82351543483588]
  Theory of average-case performance of Hamiltonian simulation with random initial states. Numerical evidence suggests that this theory accurately characterizes the average error for concrete models.
  arXiv  Detail & Related papers  (2021-11-08T19:08:42Z)
• High-Dimensional Gaussian Process Inference with Derivatives [90.8033626920884]
  We show that in the low-data regime $ND$, the Gram matrix can be decomposed in a manner that reduces the cost of inference to $mathcalO(N2D + (N2)3)$. We demonstrate this potential in a variety of tasks relevant for machine learning, such as optimization and Hamiltonian Monte Carlo with predictive gradients.
  arXiv  Detail & Related papers  (2021-02-15T13:24:41Z)
• Time-dependent unbounded Hamiltonian simulation with vector norm scaling [2.973326951020451]
  The accuracy of quantum dynamics simulation is usually measured by the error of the unitary evolution operator in the operator norm. For unbounded operators, after suitable discretization, the norm of the Hamiltonian can be very large, which significantly increases the simulation cost. We demonstrate that under suitable assumptions of the Hamiltonian and the initial vector, if the error is measured in terms of the vector norm, the computational cost may not increase at all.
  arXiv  Detail & Related papers  (2020-12-24T05:01:58Z)
• Quantum algorithms for spectral sums [50.045011844765185]
  We propose new quantum algorithms for estimating spectral sums of positive semi-definite (PSD) matrices. We show how the algorithms and techniques used in this work can be applied to three problems in spectral graph theory.
  arXiv  Detail & Related papers  (2020-11-12T16:29:45Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.