A Dequantized Algorithm for the Guided Local Hamiltonian Problem
A Dequantized Algorithm for the Guided Local Hamiltonian Problem
The local Hamiltonian (LH) problem, the quantum analog of the classical constraint satisfaction problem, is a cornerstone of quantum computation and complexity theory. It is known to be QMA-complete, indicating that it is challenging even for quantum computers. Interestingly, the guided local Hamiltonian (GLH) problem -- an LH problem with …