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}
}
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… 

A generalized circuit for the Hamiltonian dynamics through the truncated series

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.

Quantum Algorithm for Linear Differential Equations with Exponentially Improved Dependence on Precision

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.

Quantum Algorithm for Linear Differential Equations with Exponentially Improved Dependence on Precision

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.

Tailoring Term Truncations for Electronic Structure Calculations Using a Linear Combination of Unitaries

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.

Hamiltonian Simulation in the Interaction Picture

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

Low-Depth Quantum Simulation of Materials

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.

J un 2 01 9 Hamiltonian Simulation in the Interaction Picture

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

A generalized circuit for the Hamiltonian dynamics through the truncated series

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

Quantum computing for fusion energy science applications

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.

Fourier series weight in quantum machine learning

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

Simulating Hamiltonian dynamics with a truncated Taylor series.

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.

Hamiltonian simulation using linear combinations of unitary operations

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.

Exponentially more precise quantum simulation of fermions in second quantization

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

Simulating quantum dynamics on a quantum computer

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.

Communications in Mathematical Physics Efficient Quantum Algorithms for Simulating Sparse Hamiltonians

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

Efficient Quantum Algorithms for Simulating Sparse Hamiltonians

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.

Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters

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.

Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space.

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

Adiabatic quantum state generation and statistical zero knowledge

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.

Optimal Hamiltonian Simulation by Quantum Signal Processing.

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.