QAOA MaxCut expectation values at depth p≥2 are #P-hard to evaluate exactly or to exponential precision, because their extreme Laurent coefficient encodes the maximum-cut count.
Quantum approximate optimization algorithm for MaxCut: A fermionic view.Physical Review A, 97(2):022304, 2018
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2026 1verdicts
ACCEPT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Evaluating QAOA expectation values can be as hard as counting optimal solutions
QAOA MaxCut expectation values at depth p≥2 are #P-hard to evaluate exactly or to exponential precision, because their extreme Laurent coefficient encodes the maximum-cut count.