An Entropy-Governed Speedup for Quantum Algorithms on Local Hamiltonians

Low-energy estimation and state preparation for general k-local Hamiltonians are fundamental challenges in quantum complexity theory. For constant relative accuracy, Buhrman et al. (PRL 2025) recently broke the natural Grover bound O\(2^n/2\), where n denotes the number of qubits, for both problems. In this paper, for any sufficiently small parameter dge 0, we present an even faster quantum algorithm that outputs a quantum state with energy bounded by the minimum energy over all depth-d states (i.e., states obtained by applying a depth-d circuit to the all-zero state), together with an estimate of this energy. For the class of Hamiltonians with depth-d ground states, our algorithm furthermore achieves exactly the same energy guarantees as Buhrman et al. Our results also provide insight into the distinction between strongly entangled states and those admitting efficient classical descriptions.