A Complete Proof of ${\mathsf{QMA}}_1$-Hardness for Weighted Gapped Clique Homology

Tal Barak

The computational complexity of simplicial homology has been studied since the question was raised by Kaibel and Pfetsch, and clique homology was later shown to be ${\mathsf{QMA}}_1$…