Short-path quantum algorithms for MAX-k-CSPs are dequantized to classical algorithms with time 2^{(1-c')n} where c' > c, showing no super-quadratic quantum advantage.
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
UNVERDICTED 1representative citing papers
citing papers explorer
-
Dequantizing Short-Path Quantum Algorithms
Short-path quantum algorithms for MAX-k-CSPs are dequantized to classical algorithms with time 2^{(1-c')n} where c' > c, showing no super-quadratic quantum advantage.