We provide a general method for efficiently simulating time-dependent Hamiltonian dynamics on a circuit-model-based quantum computer. Our approach is based on approximating the truncated Dyson series of the evolution operator, extending the earlier proposal by Berry et al. [Phys. Rev. Lett. 114, 090502 (2015)] to evolution generated by explicitly time-dependent Hamiltonians. Two alternative strategies are proposed to implement time ordering while exploiting the superposition principle for sampling the Hamiltonian at different times. The resource cost of our simulation algorithm retains the optimal logarithmic dependence on the inverse of the desired precision.
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].