1 paper
Ashley Montanaro, Changpeng Shao, Dominic Verdon
Quantum k-SAT (the problem of determining whether a k-local Hamiltonian is frustration-free) is known to be QMA_1-complete for k >= 3, and hence likely hard for quantum computers t…