Quantum simulation of chemistry via quantum fast multipole method

Abstract

Here we describe an approach for simulating quantum chemistry on quantum computers with significantly lower asymptotic complexity than prior work. The approach uses a real-space first-quantised representation of the molecular Hamiltonian which we propagate using high-order product formulae. Essential for this low complexity is the use of a technique similar to the fast multipole method for computing the Coulomb operator with $\widetilde{\cal O}(η)$ complexity for a simulation with $η$ particles. We show how to modify this algorithm so that it can be implemented on a quantum computer. We ultimately demonstrate an approach with $t(η^{4/3}N^{1/3} + η^{1/3} N^{2/3} ) (ηNt/ε)^{o(1)}$ gate complexity, where $N$ is the number of grid points, $ε$ is target precision, and $t$ is the duration of time evolution. This is roughly a speedup by ${\cal O}(η)$ over most prior algorithms. We provide lower complexity than all prior work for $N<η^6$ (the regime of practical interest), with only first-quantised interaction-picture simulations providing better performance for $N>η^6$. As with the classical fast multipole method, large numbers $η\gtrsim 10^3$ would be needed to realise this advantage.