Trotter Product Formula
The Trotter product formula explains how an exponential generated by a sum can be obtained as a limit of products of exponentials generated by the parts:
In quantum mechanics, if
then
under appropriate mathematical hypotheses. The formula is useful precisely when and are individually simpler than their sum, even when .
Splitting a noncommuting Hamiltonian
Section titled “Splitting a noncommuting Hamiltonian”If two Hamiltonian terms commute, then
Most interesting decompositions do not commute: kinetic and potential energy, local terms in a many-body Hamiltonian, drift and control Hamiltonians, or terms assigned to different quantum gates. The naive factorization is then false at finite time.
The Trotter idea is that short-time errors can be made small, then controlled by taking many short steps.
First-Order Formula
Section titled “First-Order Formula”Let
The first-order product approximation is
For bounded operators or finite matrices, converges to the exact unitary:
For unbounded self-adjoint and , a standard sufficient hypothesis is that is essentially self-adjoint on ; its self-adjoint closure defines . The product then converges strongly on each state, not generally in operator norm. This existence theorem does not supply the finite-matrix error rates below without further regularity assumptions.
Local Error from BCH
Section titled “Local Error from BCH”The Baker–Campbell–Hausdorff Formula gives the leading finite-step error. For one step,
The leading correction is controlled by the commutator. If , the product is exact for every . If the commutator is large in the relevant norm or on the relevant states, many short steps may be needed.
The local one-step error is typically for the first-order formula. Over steps, the accumulated global error is typically , with constants depending on commutators and higher nested commutators.
Symmetric Second-Order Formula
Section titled “Symmetric Second-Order Formula”A common improvement is the symmetric, or Strang, splitting:
Then
The symmetry under cancels the leading even-order error terms in the exponent. For sufficiently regular bounded problems, the local error is and the global error is .
The order of the half steps matters. The alternative
is another second-order splitting, but it is not the same finite-step approximation unless the terms commute.
More Than Two Terms
Section titled “More Than Two Terms”For a Hamiltonian split into many parts,
a first-order step is
with a chosen operator order. The product order is part of the approximation.
A symmetric second-order step can be written as a forward sweep followed by a backward sweep:
Different orderings can have the same formal order but different error constants.
Higher-Order Suzuki–Trotter Preview
Section titled “Higher-Order Suzuki–Trotter Preview”Higher-order product formulas combine lower-order steps with carefully chosen fractional time steps. A standard recursive construction starts from a symmetric step and defines
for integers , where
This cancels additional terms in the error expansion. The gain in asymptotic order comes with more exponentials per step, sometimes with negative or larger-than-one substeps. Practical performance depends on the Hamiltonian, commutators, hardware or numerical representation, and target accuracy.
Split-Operator Method
Section titled “Split-Operator Method”For a particle with
the second-order split-operator step is often written
This is powerful because is diagonal in position space and is diagonal in momentum space. A numerical implementation alternates between position and momentum representations using Fourier transforms.
An FFT implementation also imposes a finite periodic grid. Decrease the time step and refine the spatial grid separately; norm conservation alone cannot detect phase error or wraparound. The Trotter notebook compares step-size errors against an exact matrix solution.
Quantum Simulation Connection
Section titled “Quantum Simulation Connection”In Hamiltonian simulation, a many-term Hamiltonian may be decomposed as
where each is easier to implement than . Product formulas then turn continuous-time dynamics into a sequence of implementable unitary steps. The discrete-step viewpoint is developed in Quantum Maps and Discrete-Time Evolution.
The same mathematical idea appears in digital–analog simulation, lattice models, quantum chemistry algorithms, and control sequences. Hamiltonian simulation studies the gate costs and error bounds of this construction.
Path-Integral Time Slicing
Section titled “Path-Integral Time Slicing”The product formula also explains why path integrals start from many short-time kernels. For
one inserts many small steps and uses a kinetic-potential splitting. In the continuum limit, the repeated integrations over intermediate positions lead to the path-integral expression. Propagators to path integrals develops the intermediate-position construction.
Common Mistakes
Section titled “Common Mistakes”- Writing for noncommuting and .
- Confusing the exact product formula with a finite- approximation.
- Quoting an error order without checking commutator size, domains, or regularity.
- Forgetting that product order matters at finite step size.
- Assuming a higher-order formula is automatically faster in a real computation.
- Applying a split-operator step on a grid without checking boundary conditions and Fourier conventions.
- Treating Trotterization as the same thing as time ordering; both involve ordered products, but they solve different organizational problems.
References
Section titled “References”-
N. Hatano and M. Suzuki, “Finding exponential product formulas of higher orders”, in Quantum Annealing and Other Optimization Methods, Lecture Notes in Physics 679, 37–68, Springer, 2005.
-
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2010.
-
M. Reed and B. Simon, Methods of Modern Mathematical Physics I: Functional Analysis, revised and enlarged ed., Academic Press, 1980.
-
G. Strang, “On the Construction and Comparison of Difference Schemes,” SIAM Journal on Numerical Analysis 5, 506-517, 1968.
-
M. Suzuki, “Generalized Trotter’s Formula and Systematic Approximants of Exponential Operators and Inner Derivations with Applications to Many-Body Problems,” Communications in Mathematical Physics 51, 183-190, 1976.
-
H. F. Trotter, “On the product of semi-groups of operators”, Proceedings of the American Mathematical Society 10, 545-551, 1959.
Exercises
Section titled “Exercises”- Show that the first-order product is exact at finite when .
Solution
If , then the exponentials commute and combine:
Raising to the th power gives
- Use the Baker–Campbell–Hausdorff expansion to identify the leading correction to one first-order step.
Solution
Set
The BCH formula gives
Since
the exponent contains the correction
- For , explain why the split-operator step naturally alternates between position and momentum representations.
Solution
acts by multiplication in the position representation, so is easy to apply to . is diagonal in momentum representation, so is easy to apply to . A split step therefore applies the potential factor in position space, Fourier transforms to momentum space for the kinetic factor, then transforms back for the final potential factor.
- Why does a finite Trotter step preserve norm even though it is approximate?
Solution
If each is self-adjoint, then every factor is unitary. A product of unitary operators is unitary. Therefore the finite product preserves norm exactly, even though it approximates the unitary generated by the full sum only up to a finite-step error.