Nearly-frustration-free ground state preparation

Solving for quantum ground states is important for understanding the properties of quantum many-body systems, and quantum computers are potentially well-suited for solving for quantum ground states. Recent work [1] has presented a nearly optimal scheme that prepares ground states on a quantum computer for completely generic Hamiltonians, whose query complexity scales as δ⁻¹, i.e. inversely with their normalized gap. Here we consider instead the ground state preparation problem restricted to a special subset of Hamiltonians, which includes those which we term “nearly-frustration-free”: the class of Hamiltonians for which the ground state energy of their block-encoded and hence normalized Hamiltonian α⁻¹H is within δ^y of -1, where δ is the spectral gap of α⁻¹H and 0 ≤ y ≤ 1. For this subclass, we describe an algorithm whose dependence on the gap is asymptotically better, scaling as δ^y/2−1, and show that this new dependence is optimal up to factors of log δ. In addition, we give examples of physically motivated Hamiltonians which live in this subclass. Finally, we describe an extension of this method which allows the preparation of excited states both for generic Hamiltonians as well as, at a similar speedup as the ground state case, for those which are nearly frustration-free.