Pith. sign in

REVIEW 1 cited by

Trotter error time scaling separation via commutant decomposition

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2409.16634 v2 pith:LP4GATUV submitted 2024-09-25 quant-ph

classification quant-ph
keywords errortimeboundstrottercommutantcomponentsdecompositionestimate
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Suppressing the Trotter error in dynamical quantum simulation typically requires running deeper circuits, posing a great challenge for noisy near-term quantum devices. Studies have shown that the empirical error is usually much smaller than the one suggested by existing bounds, implying the actual circuit cost required is much less than the ones based on those bounds. Here, we improve the estimate of the Trotter error over existing bounds, by introducing a general framework of commutant decomposition that separates disjoint error components that have fundamentally different scaling with time. In particular we identify two error components that each scale as $O(\tau^pt)$ and $O(\tau^p)$ for a $p$th-order product formula evolving to time $t$ using a fixed step size $\tau$, it implies one would scale linearly with time $t$ and the other would be constant of $t$. We show that this formalism not only straightforwardly reproduces previous results but also provides a better error estimate for higher-order product formulas. We demonstrate the improvement both analytically and numerically. We also apply the analysis to observable error relating to the heating in Floquet dynamics and thermalization, which is of independent interest.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Reducing the Gate Count with Efficient Trotter-Suzuki Schemes

    hep-lat 2026-02 conditional novelty 5.0 of 10

    Recommended order-4 and order-6 Trotter-Suzuki schemes reduce the computational cost needed to reach a target accuracy on the Heisenberg XXZ model compared with standard schemes.

Pith tools