A quantum graph-coloring framework with log-color encoding and a QFT-based mixer is presented; its chromatic-number term is flawed because label-sum minimization does not imply color-count minimization.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
A Resource-Efficient Quantum Framework for Graph Coloring and Chromatic Number Estimation
A quantum graph-coloring framework with log-color encoding and a QFT-based mixer is presented; its chromatic-number term is flawed because label-sum minimization does not imply color-count minimization.