Quantum Simulation of Real-Space Dynamics

Abstract

Quantum simulation is a prominent application of quantum computers. While there is extensive previous work on simulating finite-dimensional systems, less is known about quantum algorithms for real-space dynamics. We conduct a systematic study of such algorithms. In particular, we show that the dynamics of a ddimensional Schrödinger equation with η particles can be simulated with gate complexity1 Oe(ηdF poly(log(g0/∊))), where ∊ is the discretization error, g0 controls the higher-order derivatives of the wave function, and F measures the time-integrated strength of the potential. Compared to the best previous results, this exponentially improves the dependence on ∊ and g0 from poly(g0/∊) to poly(log(g0/∊)) and polynomially improves the dependence on T and d, while maintaining best known performance with respect to η. For the case of Coulomb interactions, we give an algorithm using η3(d + η)T poly(log(ηdTg0/(∆∊)))/∆ one- and two-qubit gates, and another using η3(4d)d/2T poly(log(ηdTg0/(∆∊)))/∆ one- and two-qubit gates and QRAM operations, where T is the evolution time and the parameter ∆ regulates the unbounded Coulomb interaction. We give applications to several computational problems, including faster real-space simulation of quantum chemistry, rigorous analysis of discretization error for simulation of a uniform electron gas, and a quadratic improvement to a quantum algorithm for escaping saddle points in nonconvex optimization.