Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > NICHOLAS SPOONER:
All reports by Author Nicholas Spooner:

TR26-174 | 11th September 2026
Eshan Chattopadhyay, Oren Renard, Nicholas Spooner

Frustration Free Stoquastic Local Hamiltonian with Sub-Constant Gap is in $\NP$

We continue the study of the Stoquastic Local Hamiltonian problem, a physically motivated restriction of the $\QMA$-complete Local Hamiltonian problem \cite{KSV02}. For the $\beta$-gapped, frustration-free case, \citet{BBT06} showed that the problem is $\MA$-complete when $\beta= \frac{1}{\poly(n)}$. \citet{AG19} derandomized this algorithm and proved membership in $\NP$ for constant gap $\beta = ... more >>>




ISSN 1433-8092 | Imprint