Complexity of the Guided Local Hamiltonian Problem: Improved Parameters and Extension to Excited States
Chris Cade, Marten Folkertsma, Jordi Weggemans
TL;DR
This paper strengthens the classification of the guided Local Hamiltonian problem by proving BQP-hardness for 2-local Hamiltonians with guiding-state fidelity as large as $1 - \mathrm{poly}(n)^{-1}$ and extending the hardness to estimating excited-state energies. The authors build on the Feynman-Kitaev circuit-to-Hamiltonian framework, employing pre-idling, gap amplification, and perturbative gadgets to reduce locality while preserving the low-energy structure and fidelity of the guiding state. They also establish containment in BQP for relevant parameter regimes, showing that GLHLE remains tractable under certain locality and fidelity constraints. The work highlights the nuanced source of quantum hardness in Hamiltonian problems, balancing precision requirements with guiding-state properties, and opens avenues for understanding the hardness landscape in relation to physical Hamiltonians and the quantum PCP conjecture.
Abstract
Recently it was shown that the so-called guided local Hamiltonian problem -- estimating the smallest eigenvalue of a $k$-local Hamiltonian when provided with a description of a quantum state ('guiding state') that is guaranteed to have substantial overlap with the true groundstate -- is BQP-complete for $k \geq 6$ when the required precision is inverse polynomial in the system size $n$, and remains hard even when the overlap of the guiding state with the groundstate is close to a constant $\left(\frac12 - Ω\left(\frac{1}{\mathop{poly}(n)}\right)\right)$. We improve upon this result in three ways: by showing that it remains BQP-complete when i) the Hamiltonian is 2-local, ii) the overlap between the guiding state and target eigenstate is as large as $1 - Ω\left(\frac{1}{\mathop{poly}(n)}\right)$, and iii) when one is interested in estimating energies of excited states, rather than just the groundstate. Interestingly, iii) is only made possible by first showing that ii) holds.
