# Improved Hamiltonian simulation via a truncated Taylor series and corrections

@article{Novo2016ImprovedHS,
title={Improved Hamiltonian simulation via a truncated Taylor series and corrections},
author={Leonardo Novo and Dominic W. Berry},
journal={Quantum Inf. Comput.},
year={2016},
volume={17},
pages={623-635}
}
• Published 30 November 2016
• Mathematics
• Quantum Inf. Comput.
We describe an improved version of the quantum simulation method based on the implementation of a truncated Taylor series of the evolution operator. The idea is to add an extra step to the previously known algorithm which implements an operator that corrects the weightings of the Taylor series. This way, the desired accuracy is achieved with an improvement in the overall complexity of the algorithm. This quantum simulation method is applicable to a wide range of Hamiltonians of interest…
21 Citations
• Physics
Quantum Inf. Process.
• 2018
A fixed-quantum circuit design for the simulation of the Hamiltonian dynamics, $${\mathcal {H}}(t)$$H(t), through the truncated Taylor series method described by Berry et al.
• Computer Science
• 2017
This work presents a quantum algorithm for systems of (possibly inhomogeneous) linear ordinary differential equations with constant coefficients that produces a quantum state that is proportional to the solution at a desired final time using a Taylor series.
• Computer Science
Communications in Mathematical Physics
• 2017
This work presents a quantum algorithm for systems of (possibly inhomogeneous) linear ordinary differential equations with constant coefficients that produces a quantum state that is proportional to the solution at a desired final time using a Taylor series.
• Physics
Quantum
• 2022
It is shown that it is more efficient to apply LCU using a truncation that retains larger magnitude terms as determined by an iterative procedure, and it is found that the adaptive method can typically improve the simulation accuracy by an order of magnitude, for a given circuit depth.
• Physics
• 2018
We present a low-space overhead simulation algorithm based on the truncated Dyson series for time-dependent quantum dynamics. This algorithm is applied to simulating time-independent Hamiltonians by
• Computer Science
• 2018
Simulations of low-density jellium are identified as a promising first setting to explore quantum supremacy in electronic structure and a proposal to simulate the uniform electron gas using a low-depth variational ansatz realizable on near-term quantum devices is proposed.
• Physics
• 2019
We present a low-space overhead simulation algorithm based on the truncated Dyson series for time-dependent quantum dynamics. This algorithm is applied to simulating time-independent Hamiltonians by
• Materials Science
Quantum Information Processing
• 2018
In this paper, we present a method for Hamiltonian simulation in the context of eigenvalue estimation problems, which improves earlier results dealing with Hamiltonian simulation through the
• Computer Science
Physics of Plasmas
• 2023
This work extends previous results on embedding nonlinear systems within linear systems by explicitly deriving the connection between the Koopman evolution operator, the Perron–Frobenius evolutionoperator, and the Koopsman–von Neumann evolution (KvN) operator.
• Computer Science
• 2023
This work designed a quantum machine learning leveraged on the Hamiltonian encoding that performed the trigonometric interpolation, binary and multiclass classifier, and a quantum signal processing application and proposed a block diagram of determining approximately the Fourier coefficient.

## References

SHOWING 1-10 OF 23 REFERENCES

• Mathematics
Physical review letters
• 2015
A simple, efficient method for simulating Hamiltonian dynamics on a quantum computer by approximating the truncated Taylor series of the evolution operator by using a method for implementing linear combinations of unitary operations together with a robust form of oblivious amplitude amplification.
• Computer Science
Quantum Inf. Comput.
• 2012
The main tool is a general method to nearly deterministically implement linear combinations of nearby unitary operations, which is optimal among a large class of methods.
• Computer Science
• 2015
We introduce novel algorithms for the quantum simulation of fermionic systems which are dramatically more efficient than those based on the Lie–Trotter–Suzuki decomposition. We present the first
• Computer Science
• 2010
A range of techniques to simulate Hamiltonians with badly behaved derivatives are proposed, including using adaptive time steps, adapting the order of the integrators, and omitting regions about discontinuities.
• Physics, Computer Science
• 2007
We present an efficient quantum algorithm for simulating the evolution of a quantum state for a sparse Hamiltonian H over a given time t in terms of a procedure for computing the matrix entries of H
• Computer Science
• 2007
We present an efficient quantum algorithm for simulating the evolution of a quantum state for a sparse Hamiltonian H over a given time t in terms of a procedure for computing the matrix entries of H.
• Computer Science
2015 IEEE 56th Annual Symposium on Foundations of Computer Science
• 2015
An algorithm for sparse Hamiltonian simulation whose complexity is optimal (up to log factors) as a function of all parameters of interest is presented, and a new lower bound is proved showing that no algorithm can have sub linear dependence on tau.
• Physics
Physical review letters
• 2011
We consider the manifold of all quantum many-body states that can be generated by arbitrary time-dependent local Hamiltonians in a time that scales polynomially in the system size, and show that it
• Physics, Computer Science
STOC '03
• 2003
The ASG approach to quantum algorithms provides intriguing links between quantum computation and many different areas: the analysis of spectral gaps and groundstates of Hamiltonians in physics, rapidly mixing Markov chains, statistical zero knowledge, and quantum random walks.
• Physics
Physical review letters
• 2017
It is argued that physical intuition can lead to optimal simulation methods by showing that a focus on simple single-qubit rotations elegantly furnishes an optimal algorithm for Hamiltonian simulation, a universal problem that encapsulates all the power of quantum computation.