Gapped Clique Homology on weighted graphs is ${\text{QMA}}_1$-hard and contained in $\text{QMA}$

Robbie King, Tamara Kohler

We study the complexity of a classic problem in computational topology, the homology problem: given a description of some space $X$ and an integer $k$, decide if $X$ contains a $k$…