Numerical simulations of random Max-kXOR with k=3 to 10 show the classical MF-AOA benchmark matches or outperforms the QAOA on average, and reaching high approximation ratios would require very large circuit depths.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Limitations of Quantum Approximate Optimization in Solving Generic Higher-Order Constraint-Satisfaction Problems
Numerical simulations of random Max-kXOR with k=3 to 10 show the classical MF-AOA benchmark matches or outperforms the QAOA on average, and reaching high approximation ratios would require very large circuit depths.