Evaluating the evidence for exponential quantum advantage in ground-state quantum chemistry

The extent of problems in quantum chemistry for which quantum algorithms could provide a speedup is still unclear, as well as the kind of speedup one should expect. Here, the authors look at the problem of ground state energy estimation, and gather theoretical and numerical evidence for the fact that an exponential quantum advantage is unlikely for generic problems of interest. Due to intense interest in the potential applications of quantum computing, it is critical to understand the basis for potential exponential quantum advantage in quantum chemistry. Here we gather the evidence for this case in the most common task in quantum chemistry, namely, ground-state energy estimation, for generic chemical problems where heuristic quantum state preparation might be assumed to be efficient. The availability of exponential quantum advantage then centers on whether features of the physical problem that enable efficient heuristic quantum state preparation also enable efficient solution by classical heuristics. Through numerical studies of quantum state preparation and empirical complexity analysis (including the error scaling) of classical heuristics, in both ab initio and model Hamiltonian settings, we conclude that evidence for such an exponential advantage across chemical space has yet to be found. While quantum computers may still prove useful for ground-state quantum chemistry through polynomial speedups, it may be prudent to assume exponential speedups are not generically available for this problem.

Automated summary

The authors find that an exponential quantum advantage is unlikely for generic problems in quantum chemistry, specifically for ground state energy estimation. Despite the intense interest in quantum computing applications, evidence for such an exponential advantage has yet to be found. While polynomial speedups may still be possible, assuming exponential speedups for this problem may not be realistic.