DeepAI
Log In Sign Up

A Theory of Trotter Error

12/18/2019
by   Andrew M. Childs, et al.
0

The Lie-Trotter formula, together with its higher-order generalizations, provides a direct approach to decomposing the exponential of a sum of operators. Despite significant effort, the error scaling of such product formulas remains poorly understood. We develop a theory of Trotter error that overcomes the limitations of prior approaches based on truncating the Baker-Campbell-Hausdorff expansion. Our analysis directly exploits the commutativity of operator summands, producing tighter error bounds for both real- and imaginary-time evolutions. Whereas previous work achieves similar goals for systems with geometric locality or Lie-algebraic structure, our approach holds in general. We give a host of improved algorithms for digital quantum simulation and quantum Monte Carlo methods, including simulations of second-quantized plane-wave electronic structure, k-local Hamiltonians, rapidly decaying power-law interactions, clustered Hamiltonians, the transverse field Ising model, and quantum ferromagnets, nearly matching or even outperforming the best previous results. We obtain further speedups using the fact that product formulas can preserve the locality of the simulated system. Specifically, we show that local observables can be simulated with complexity independent of the system size for power-law interacting systems, which implies a Lieb-Robinson bound as a byproduct. Our analysis reproduces known tight bounds for first- and second-order formulas. Our higher-order bound overestimates the complexity of simulating a one-dimensional Heisenberg model with an even-odd ordering of terms by only a factor of 5, and is close to tight for power-law interactions and other orderings of terms. This suggests that our theory can accurately characterize Trotter error in terms of both asymptotic scaling and constant prefactor.

READ FULL TEXT

page 1

page 2

page 3

page 4

12/16/2020

Nearly tight Trotterization of interacting electrons

We consider simulating quantum systems on digital quantum computers. We ...
01/03/2019

Nearly optimal lattice simulation by product formulas

Product formulas provide a straightforward yet surprisingly efficient ap...
10/16/2017

Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications

In this paper, we study the algebraic formula complexity of multiplying ...
03/31/2022

Quantum simulation of real-space dynamics

Quantum simulation is a prominent application of quantum computers. Whil...
12/11/2020

Handy Formulas for Binomial Moments

Despite the relevance of the binomial distribution for probability theor...
11/16/2022

On the complexity of implementing Trotter steps

Quantum dynamics can be simulated on a quantum computer by exponentiatin...
01/10/2019

On the Descriptive Complexity of Color Coding

Color coding is an algorithmic technique used in parameterized complexit...