We describe a simple, efficient method for simulating Hamiltonian dynamics on a quantum computer by approximating the truncated Taylor series of the evolution operator. Our method can simulate the time evolution of a wide variety of physical systems. As in another recent algorithm, the cost of our method depends only logarithmically on the inverse of the desired precision, which is optimal. However, we simplify the algorithm and its analysis by using a method for implementing linear combinations of unitary operations together with a robust form of oblivious amplitude amplification.
As established in the seminal work by Berry et al.[1], expanding the time evolution operator using truncated Taylor series (up to some order
K) makes a good candidate for simulating Hamiltonian dynamics. Here, we adapt the method but present an alternative quantum circuit that maintains an equivalent asymptotic elementary gate cost but has an exponentially reduced number of ancilla qubits. This is realized by utilizing mid-circuit measurements (with early abort-and-restart of circuit execution), and transforming a series of multi-controlled
(Hk) to a series of singly-controlled
(Hk′), where
H is a linear combination of unitaries and
k,k′ are integers. The proposed circuit utilizes a total of
⌈log(K)⌉+⌈log(L)⌉+n qubits, where
L is the number of terms in the Hamiltonian and
n is the system qubit size. Our shorter width circuit with mid-measurements protocol is implemented and evaluated using the programming language Guppy[2,3].