Unweighted gapped clique homology is QMA1^{g2}-complete for a fixed inverse-polynomial gap, proven by replacing vertex weights with clique multiplicities.
Complexity of simplicial homology and independence complexes of chordal graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Unweighted Gapped Clique Homology is $\mathsf{QMA}_1$-complete
Unweighted gapped clique homology is QMA1^{g2}-complete for a fixed inverse-polynomial gap, proven by replacing vertex weights with clique multiplicities.