The complexity class $QMA$ is the quantum complexity analogue of the complexity class NP. See https://en.wikipedia.org/wiki/QMA.
One of the main results about $QMA$ is that the problem "2-local Hamiltonian" is QMA-hard (and therefore NP-hard). (See the introduction of https://arxiv.org/abs/quant-ph/0504050).
On the other hand, I imagine that one could just build the Hamiltonian and cool it down to solve any instance of the problem.
Why doesn't this work?
Background information: A 2-local Hamiltonian $H$ is an operator on the Hilbert space $(\mathbb{C}^2)^{\otimes n}$ which is of the form $H = \sum_j H_j$ where each $H_j$ acts non-trivially on at most $2$ qubits.
Let in the following $\lambda(H)$ denote the smallest eigenvalue of $H$.
The problem "2-local Hamiltonian" is defined by given a 2 local Hamiltonian on $n$ qubits and two real numbers $\alpha, \beta$ such that $ \beta -\alpha \geq \frac{1}{poly(n)}$ and a promise that either $\lambda(H) \leq \alpha$ or $\lambda(H) \geq \beta$ then determine which of the two cases you are in.