arXiv:2610.03672
Ordering-Aware Theory of Trotter Error
Zhenning Liu, Zhi-Yuan Wei, Michael Foss-Feig, Alexey V. Gorshkov, Andrew M. Childs
Abstract
Product formulas are a basic tool for simulating quantum many-body dynamics, but a fundamental degree of freedom in their application---the ordering of Hamiltonian terms---has remained largely unexplored. Here we systematically study such ordering effects, quantifying their impact on simulation accuracy and exploiting them to design more accurate product-formula simulations. We develop an efficiently computable, ordering-sensitive bound on the finite-step-size Trotter error for geometrically local Hamiltonians for arbitrarily high-order product formulas. For translation-invariant one-dimensional chains, our bounds are close to exact second-, fourth-, and sixth-order Trotter errors in small-system tests, while on large-scale systems they improve on previous higher-order analytical bounds by orders of magnitude. We further use the local structure of the error bounds and estimates to optimize ordering efficiently, reducing the long-chain problem to a minimum-mean-weight-cycle problem on a weighted de Bruijn graph. For random translation-invariant chains, sequential (staircase-like) orderings consistently outperform standard brickwall circuits; when circuit depth is restricted, the optimizer instead favors wave-like parallel-sequential orderings, which preserve much of the accuracy advantage over brickwall circuits. These results establish ordering as a useful degree of freedom for both understanding and improving product-formula simulation.
AI Summary
The paper asks how Hamiltonian-term ordering affects product-formula error and how to choose an ordering efficiently. Its main setting is one-dimensional nearest-neighbor chains, with ordering optimization specialized to translation-invariant Hamiltonians and Suzuki formulas. It constructs ordering-sensitive, finite-step spectral-norm error bounds for arbitrary-order product formulas. Exact and product-formula evolutions are compared through increments obtained by adding local terms. Each increment is evaluated exactly within a finite window; omitted contributions are bounded using boundary commutators. Grouping $q$ increments and enlarging the window to $L=p+q+v$ terms retains additional cancellations, at classical cost $2^{O(p+q+v)}$ per window. For 500 random translation-invariant ten-qubit Hamiltonians at step size $0.1$, the $q=2$ fourth-order bound averages approximately $1.4$ times the exact error and correctly selects between sequential and brickwall orderings in $495/500$ cases. Comparisons extending to 256 qubits show orders-of-magnitude reductions over previous bounds, although exact errors are unavailable at those sizes. Ordering optimization encodes neighboring-term precedence as a binary string and maps local error costs to weighted de Bruijn graphs. Minimum-mean-cycle optimization finds asymptotically bound-minimizing periodic patterns. In exhaustive eight-qubit tests, unrestricted selections have actual errors averaging 3.5% and 4.2% above optimum at fourth and sixth order; depth-three constraints usually select wave-like patterns. The optimization minimizes a bound or predictor, not the actual error. Sequential superiority is empirical and Hamiltonian-dependent. Bounds require recomputation at each step size; larger windows cost exponentially more. Higher-dimensional ordering optimization and cancellation between simulation steps remain unresolved.
AI also assisted with later-stage numerical verification presented in \cref{sec:numerics} (based on code written by the authors), literature searches, and the writing and editing of the manuscript.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 24 pages, 11 figures