The claimed QMA1-hardness of sparse balancedness and sparse bipartitedness is not established, because the main spectral equivalence is false.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2024 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard
The claimed QMA1-hardness of sparse balancedness and sparse bipartitedness is not established, because the main spectral equivalence is false.