Abstract
Estimating the ground state energy of a multiparticle system with relative error <!-- MATH $\varepsilon$ --> using deterministic classical algorithms has cost that grows exponentially with the number of particles. The problem depends on a number of state variables that is proportional to the number of particles and suffers from the curse of dimensionality. Quantum computers can vanquish this curse. In particular, we study a ground state eigenvalue problem and exhibit a quantum algorithm that achieves relative error <!-- MATH $\varepsilon$ --> using a number of qubits <!-- MATH $C^\prime d\log \varepsilon ^{-1}$ --> with total cost (number of queries plus other quantum operations) <!-- MATH $Cd\varepsilon ^{-(3+\delta )}$ --> , where 0$"> is arbitrarily small and and are independent of and <!-- MATH $\varepsilon$ --> .