Unbiased Hamiltonian Simulation by Reversing Trotter Error Dynamics

• URL: http://arxiv.org/abs/2606.29741v1
• Date: Mon, 29 Jun 2026 03:35:05 GMT
• Title: Unbiased Hamiltonian Simulation by Reversing Trotter Error Dynamics
• Abstract summary: Suzuki--Trotter formulas remain the de facto Hamiltonian simulation methods on current quantum computing platforms.<n>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.<n>The resulting algorithm, called Probabilistic Trotter Error Reversal (PTER), is unbiased, improves the gate-count scaling compared to Suzuki--Trotter formulas, and still retains their simplicity.
• Score: 1.2961927705739584
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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 a suitable form, we carry out that reversal through quasi-probabilistic decompositions. The resulting algorithm, called Probabilistic Trotter Error Reversal (PTER), is unbiased, improves the gate-count scaling compared to Suzuki--Trotter formulas, and still retains their simplicity. Numerical simulations of a Heisenberg spin chain support the predicted resource advantage already at modest system sizes.Keisuke Murota, Yuta Kikuchi, Enrico Rinaldi, Frédéric Sauvage, Synge Todo

Related papers

• Scalable Lindblad Noise Learning via Stochastic Tensor-Network Simulation [48.887627688666974]
  Learning dissipation rates in large-scale open quantum systems is a major obstacle for near-term quantum technologies.<n>Here, we propose a scalable noise-learning framework for Lindblad dissipation rates that combines a simulation method, the Jump Method (TJM)<n>We demonstrate the approach on two noise models in the Ising model, in which independent dissipation rates are learned for each site up to $N_mathrmsite=16$.<n>This combination of scalable numerics and rigorous theoretical guarantees positions TJM-based noise learning as a practical foundation for characterizing dissipation in large quantum devices.
  arXiv  Detail & Related papers  (2026-08-25T15:07:11Z)
• Structure-Aware Variance Reduction for Unbiased Randomized Hamiltonian Simulation [0.0]
  Hamiltonian simulation methods are often governed by a trade-off between systematic bias and sampling overhead.<n>We show how classical variance-reduction techniques can be applied to such methods without changing their mean channel.
  arXiv  Detail & Related papers  (2026-06-22T16:17:55Z)
• Symmetric Trotterization in digital quantum simulation of quantum spin dynamics [0.0]
  A higher-order Suzuki-Trotter decomposition can be exploited to mitigate the Trotter error in digital quantum simulation.<n>This work revisits the second-order symmetric Trotterization in terms of the Trotter error.<n>The effectiveness of the symmetric Trotterization is evaluated in a prototype superconducting quantum device.
  arXiv  Detail & Related papers  (2026-03-09T02:51:14Z)
• The Hidden Cost of Approximation in Online Mirror Descent [56.99972253009168]
  Online mirror descent (OMD) is a fundamental algorithmic paradigm that underlies many algorithms in optimization, machine learning and sequential decision-making.<n>In this work we initiate a systematic study into inexact OMD, and uncover an intricate relation between regularizer smoothness and robustness to approximation errors.
  arXiv  Detail & Related papers  (2025-11-27T10:09:07Z)
• Error mitigation of shot-to-shot fluctuations in analog quantum simulators [46.54051337735883]
  We introduce an error mitigation technique that addresses shot-to-shot fluctuations in the parameters for the Hamiltonian governing the system dynamics.<n>We rigorously prove that amplifying this shot-to-shot noise and extrapolating to the zero-noise limit recovers noiseless results for realistic noise distributions.<n> Numerically, we predict a significant enhancement in the effective many-body coherence time for Rydberg atom arrays under realistic conditions.
  arXiv  Detail & Related papers  (2025-06-19T18:00:00Z)
• Quantum simulation of many-body dynamics with noise-robust Trotter decomposition based on symmetric structures [3.7159810638207813]
  Suzuki-Trotter decomposition provides framework for simulating quantum dynamics on quantum hardware.<n>We propose a new Trotter decomposition that is intrinsically circuit-efficient for simulating quantum dynamics on near-term devices.<n>Our results establish a practical route toward noise-resilient quantum simulation in many-body dynamics.
  arXiv  Detail & Related papers  (2025-05-07T16:31:39Z)
• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• Optimal-order Trotter-Suzuki decomposition for quantum simulation on noisy quantum computers [0.05343200742664294]
  We show that when the gate error is decreased by approximately an order of magnitude relative to typical modern values, higher-order Trotterization becomes advantageous.<n>This form of Trotterization yields a global minimum of the overall simulation error.
  arXiv  Detail & Related papers  (2024-05-02T09:48:52Z)
• Measuring Trotter error and its application to precision-guaranteed Hamiltonian simulations [0.8009842832476994]
  We develop a method for measuring the Trotter error without ancillary qubits on quantum circuits. We make Trotterization precision-guaranteed, developing an algorithm named Trotter$(m,n)$. We find the adaptively chosen $mathrmdt$ to be about ten times larger than that inferred from known upper bounds of Trotter errors.
  arXiv  Detail & Related papers  (2023-07-11T16:12:38Z)
• Improved Accuracy for Trotter Simulations Using Chebyshev Interpolation [0.5729426778193399]
  We show how errors due to Trotterized time evolution can be mitigated through the use of algorithmic techniques. Our approach is to extrapolate to zero Trotter step size, akin to zero-noise extrapolation techniques for mitigating hardware errors.
  arXiv  Detail & Related papers  (2022-12-29T01:21:26Z)
• Simple and high-precision Hamiltonian simulation by compensating Trotter error with linear combination of unitary operations [10.952846838192723]
  We propose Hamiltonian simulation algorithms using LCU to compensate Trotter error.<n>Our first algorithm exponentially improves the accuracy scaling of the Kth-order Trotter formula.<n>For lattice Hamiltonians, the algorithm enjoys almost linear system-size dependence.
  arXiv  Detail & Related papers  (2022-12-08T21:14:12Z)
• Self-healing of Trotter error in digital adiabatic state preparation [52.77024349608834]
  We prove that the first-order Trotterization of a complete adiabatic evolution has a cumulative infidelity that scales as $mathcal O(T-2 delta t2)$ instead of $mathcal O(T2delta t2)$ expected from general Trotter error bounds. This result suggests a self-healing mechanism and explains why, despite increasing $T$, infidelities for fixed-$delta t$ digitized evolutions still decrease for a wide variety of Hamiltonians.
  arXiv  Detail & Related papers  (2022-09-13T18:05:07Z)
• 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)
• 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.