There is a sharp threshold at interaction degree 3 where classical sampling from depth-1 QAOA becomes hard enough to collapse the polynomial hierarchy, contrasting with efficient simulation at degree 2 for logarithmic depth.
SIAM Journal on Computing , volume=
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
-
A sharp interaction-degree threshold for simulating QAOA
There is a sharp threshold at interaction degree 3 where classical sampling from depth-1 QAOA becomes hard enough to collapse the polynomial hierarchy, contrasting with efficient simulation at degree 2 for logarithmic depth.