analiza aiqbench
This research introduces Probabilistic Trotter Error Reversal (PTER), a novel algorithmic framework that treats systematic errors in Suzuki-Trotter formulas as coherent dynamics to be reversed rather than bounded deviations. By utilizing quasi-probabilistic decompositions, the method achieves unbiased Hamiltonian simulation with improved gate-count scaling while maintaining low overhead for current quantum platforms. Numerical validation on Heisenberg spin chains confirms its resource advantages at modest system sizes, offering a practical pathway toward higher-accuracy simulations as qubit counts scale up.
Unbiased Hamiltonian Simulation by Reversing Trotter Error Dynamics
arXiv:2606.29741v2 Announce Type: replace 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 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.
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 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.
arXiv:2606.29741 [quant-ph]
(or arXiv:2606.29741v2 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2606.29741 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 233 cuvinte
Subiecte conexe
Structure-Aware Variance Reduction for Unbiased Randomized Hamiltonian Simulation
arXiv · 21 sept. 2026

Noise cancellation keeps quantum simulations running longer
Quantum Zeitgeist · 12 oct. 2026

Faster Quantum Simulation Of Markovian Open Quantum Systems Via Randomisation
Quantum Journal · 3 sept. 2026

Error bounds for quantum formulas now include time-varying systems
Quantum Zeitgeist · 29 sept. 2026