Standard QAOA faces an intrinsic feasibility bottleneck on permutation problems that CE QAOA overcomes with an exponential gain in feasible probability for sublinear-to-linear depths under mild hypergraph growth.
Recursive QAOA outperforms the original QAOA for the MAX- CUT problem on complete graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Fundamental Limitations of QAOA on Constrained Problems and a Route to Exponential Enhancement
Standard QAOA faces an intrinsic feasibility bottleneck on permutation problems that CE QAOA overcomes with an exponential gain in feasible probability for sublinear-to-linear depths under mild hypergraph growth.