Higher Order Decompositions of Ordered Operator Exponentials

@article{Wiebe2008HigherOD,
  title={Higher Order Decompositions of Ordered Operator Exponentials},
  author={Nathan Wiebe and Dominic W. Berry and Peter H{\o}yer and Barry C. Sanders},
  journal={arXiv: Mathematical Physics},
  year={2008}
}
We present a decomposition scheme based on Lie-Trotter-Suzuki product formulae to represent an ordered operator exponential as a product of ordinary operator exponentials. We provide a rigorous proof that does not use a time-displacement superoperator, and can be applied to non-analytic functions. Our proof provides explicit bounds on the error and includes cases where the functions are not infinitely differentiable. We show that Lie-Trotter-Suzuki product formulae can still be used for… 

Figures from this paper

Multi-product operator splitting as a general method of solving autonomous and nonautonomous equations
Prior to the recent development of symplectic integrators, the time-stepping operator eh(A+B) was routinely decomposed into a sum of products of eh A and eh B in the study of hyperbolic partial
Multi-pr oduct operator splitting as a general method of solving autonomous and nonautonomous equations
om integrators. By the use of Suzuki’s forwardtime derivative operator to enforce the time-ordered exponential, we show that the same decomposition can be used to solve nonautonomous equations. In
Product formulas for exponentials of commutators
TLDR
By presenting an algorithm for quantum search using evolution according to a commutator, it is shown that the scaling of the number of exponentials in the authors' product formulas with the evolution time is nearly optimal.
A Trotter-Suzuki approximation for Lie groups with applications to Hamiltonian simulation
We present a product formula to approximate the exponential of a skew-Hermitian operator that is a sum of generators of a Lie algebra. The number of terms in the product depends on the structure
A Theory of Trotter Error
TLDR
A theory of Trotter error is developed that overcomes the limitations of prior approaches based on truncating the Baker-Campbell-Hausdorff expansion, and 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.
Simple digital quantum algorithm for symmetric first-order linear hyperbolic systems
TLDR
This paper is devoted to the derivation of a digital quantum algorithm for the Cauchy problem for symmetric first-order linear hyperbolic systems, thanks to the reservoir technique, and it is demonstrated that the quantum algorithm is more efficient than the classical version.
Simple digital quantum algorithm for some first order linear hyperbolic systems
TLDR
This paper shows that the combination of the reservoir method, Trotter-like approximation, as well as quantum walks allows for the derivation of algorithms only based on simple unitary transformations, thus perfectly suitable for quantum computing for some class of hyperbolic systems.
Optimization of quantum Hamiltonian evolution: from two projection operators to local Hamiltonians
TLDR
It is shown how a construction based on Grover's algorithm scales linearly in time and logarithmically in the error bound, and is exponentially superior in error complexity to the scheme based on the straightforward application of the Lie–Trotter formula.
Time-dependent Hamiltonian Simulation of Highly Oscillatory Dynamics
TLDR
This is the first quantum algorithm that is both insensitive to the rapid changes of the time-dependent Hamiltonian and exhibits commutator scaling and is demonstrate that for the simulation of the Schrödinger equation, this method exhibits superconvergence and achieves a surprising second order convergence rate.
Variational quantum eigensolver for approximate diagonalization of downfolded Hamiltonians using generalized unitary coupled cluster ansatz
In this paper, we discuss the utilization of variational quantum solver (VQE) and recently introduced generalized unitary coupled cluster (GUCC) formalism for the diagonalization of
...
...

References

SHOWING 1-10 OF 27 REFERENCES
General Decomposition Theory of Ordered Exponentials
A general decomposition theory of ordered exponentials is presented by reducing the problem to the decomposition of ordinary exponential operators in terms of the super-operator _??_ defined by
PRODUCT FORMULA METHODS FOR TIME-DEPENDENT SCHRODINGER PROBLEMS
This paper introduces a family of explicit and unconditionally stable algorithms for solving linear differential equations which contain a time-dependent Hermitian operator. Rigorous upper bounds are
On the exponential solution of differential equations for a linear operator
The present investigation was stimulated by a recent paper of K. 0. Friedrichs 113, who arrived at some purely algebraic problems in connection with the theory of linear operators in quantum
Gradient symplectic algorithms for solving the Schrödinger equation with time-dependent potentials
We show that the method of factorizing the evolution operator to fourth order with purely positive coefficients, in conjunction with Suzuki’s method of implementing time-ordering of operators,
Gradient symplectic algorithms for solving the radial Schrodinger equation.
TLDR
The power of this class of gradient algorithms for solving classical dynamics problems is demonstrated by solving the spectrum of highly singular radial potentials using Killingbeck's method of backward Newton-Ralphson iterations.
Convergence of general decompositions of exponential operators
A general theorem is proved concerning the convergence of decompositions of exponential operators in a Banach space (or normed space). As a corollary, the convergence of fractal decompositions is
...
...