How large is the error you make when you replace true evolution by a product formula? The answer
controls everything practical: how many Trotter steps you need, and therefore the depth and runtime of
your circuit. This lesson turns the abstract big-O bounds into concrete numbers.
The first-order error term
Split H=A+B and compare exact evolution to the first-order step. Expanding both sides to second
order in t using the Baker–Campbell–Hausdorff identity,
The linear terms match. The quadratic terms differ only by the commutator: using
H2=A2+AB+BA+B2,
e−iHt−e−iAte−iBt=21[A,B]t2+O(t3).
If A and B commute the formula is exact; all Trotter error comes from non-commutativity. Taking
operator norms gives the standard single-step bound
e−iHt−e−iAte−iBt≤2t2[A,B]+O(t3).
Worked estimate for H=X+Z
Take the toy single-qubit Hamiltonian from the previous lesson, A=X, B=Z. The commutator is
[X,Z]=XZ−ZX=−2iY,
(recall XZ=−iY and ZX=+iY). A Pauli operator scaled by a constant has spectral norm equal to
that constant's magnitude, so ∥[X,Z]∥=∥−2iY∥=2. The single-step error
bound at t=0.1 is therefore
2t2∥[X,Z]∥=20.12⋅2=0.01.
Splitting into r steps
To evolve for a long time t accurately, divide it into r steps of length t/r. Each step costs
2(t/r)2∥[A,B]∥, and the r errors add up:
total error≤r⋅2(t/r)2∥[A,B]∥=2rt2∥[A,B]∥.
So total error scales as O(1/r) — to reach accuracy ε you need
r=O(2εt2∥[A,B]∥) steps. This linear-in-1/ε
cost is the headline weakness of first-order Trotter.
Higher-order improvement
The symmetric 2nd-order step has per-step error O((t/r)3), so the total error is O(t3/r2) and
r=O(1/ε). More generally, the order-2k Suzuki formula gives
r=O((1/ε)1/2k) — each extra order pushes the exponent of 1/ε
down, which is why high-precision simulations favour 4th order and beyond.
Try it
Compute the leading first-order Trotter error bound for one step of H=X+Z at t=0.1, using
∥[X,Z]∥=2. Return the number; the grader checks it equals 0.01.
Run your code to see the quantum state.
Sign in on the full site to ask questions and join the discussion.