The claimed QMA1-hardness of sparse balancedness and sparse bipartitedness is not established, because the main spectral equivalence is false.
Zaslavsky, Negative (and positive) circles in signed gra phs: A problem collection, AKCE International Journal of Gr aphs and Combinatorics 15, 31 (2018)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
quant-ph 1years
2024 1verdicts
REJECT 1roles
method 1polarities
use method 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.