Clique Homology is $${{\mathsf{QMA}}}_{1}$$ QMA 1 -hard
Abstract We address the long-standing question of the computational complexity of determining homology groups of simplicial complexes, a fundamental task in computational topology, posed by Kaibel and Pfetsch over twenty years ago. We show that decision problem is $${{\mathsf{QMA}}}_{1}$$ QMA 1 -har...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2024-11-01
|
| Series: | Nature Communications |
| Online Access: | https://doi.org/10.1038/s41467-024-54118-z |