Absence of quantum advantage for log-depth QAOA on the binary paint shop problem implies a classical mean-field algorithm achieving a paint-swap ratio of approximately 0.2799, outperforming known heuristics and quantum methods.
Local algorithms and the failure of log-depth quantum advantage on sparse random csps
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
No quantum advantage implies improved bounds and classical algorithms for the binary paint shop problem
Absence of quantum advantage for log-depth QAOA on the binary paint shop problem implies a classical mean-field algorithm achieving a paint-swap ratio of approximately 0.2799, outperforming known heuristics and quantum methods.