Saved in:
Bibliographic Details
Main Authors: Mineh, Lana, Chapman, Adrian, Santos, Raul A.
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2508.17542
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912551981285376
author Mineh, Lana
Chapman, Adrian
Santos, Raul A.
author_facet Mineh, Lana
Chapman, Adrian
Santos, Raul A.
contents We introduce an algorithm to improve the error scaling of product formulas by randomly sampling the generator of their exact error unitary. Our approach takes an arbitrary product formula of time $t$, $S_k(t)$ with error $O(t^{k+1})$ and produces a stochastic formula with expected error scaling as $O(t^{2k+2})$ with respect to the exact dynamics. For a given fixed error $ε$ and total evolution time $T$ this leads to an improved gate complexity of $N=O(T(T/ε)^{\frac{1}{2k+1}})$ compared to the $O(T(T/ε)^{\frac{1}{k}})$ gate complexity of a $k$-th order product formula. This is achieved by appending an additional circuit with depth at-most logarithmic in the number of qubits, and without needing extra ancillas. We prove that each instance of these stochastic formulas quickly concentrates to the expected value. These results are based on an exact characterization of the error unitaries for product formulas. Through extensive numerical simulations we assess the performance of this approach in several spin and fermionic systems. We show that the expansion of these error unitaries naturally leads to generalized Zassenhaus formulas, a result which could be of independent mathematical interest.
format Preprint
id arxiv_https___arxiv_org_abs_2508_17542
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Improving time dynamics simulation by sampling the error unitary
Mineh, Lana
Chapman, Adrian
Santos, Raul A.
Quantum Physics
We introduce an algorithm to improve the error scaling of product formulas by randomly sampling the generator of their exact error unitary. Our approach takes an arbitrary product formula of time $t$, $S_k(t)$ with error $O(t^{k+1})$ and produces a stochastic formula with expected error scaling as $O(t^{2k+2})$ with respect to the exact dynamics. For a given fixed error $ε$ and total evolution time $T$ this leads to an improved gate complexity of $N=O(T(T/ε)^{\frac{1}{2k+1}})$ compared to the $O(T(T/ε)^{\frac{1}{k}})$ gate complexity of a $k$-th order product formula. This is achieved by appending an additional circuit with depth at-most logarithmic in the number of qubits, and without needing extra ancillas. We prove that each instance of these stochastic formulas quickly concentrates to the expected value. These results are based on an exact characterization of the error unitaries for product formulas. Through extensive numerical simulations we assess the performance of this approach in several spin and fermionic systems. We show that the expansion of these error unitaries naturally leads to generalized Zassenhaus formulas, a result which could be of independent mathematical interest.
title Improving time dynamics simulation by sampling the error unitary
topic Quantum Physics
url https://arxiv.org/abs/2508.17542