Generic QAOA's claimed exponential feasibility bottleneck on permutation-constrained problems is not proven; the main bound has a 2^N normalization error and is false as stated.
Grover mixers for QAOA: Shifting complexity from mixer design to state preparation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Fundamental Limitations of QAOA on Constrained Problems and a Route to Exponential Enhancement
Generic QAOA's claimed exponential feasibility bottleneck on permutation-constrained problems is not proven; the main bound has a 2^N normalization error and is false as stated.