Claim record · edition 0.1.0
Whether QAOA delivers a practical advantage over strong classical baselines on real optimization instances remains unresolved.
QAOA is the standard gate-based approach to QUBO and Ising problems and the usual comparison point for quantum-inspired classical methods. Settling the question requires end-to-end comparisons at matched accuracy and cost.
Limits of this claim
This records an open question. It is neither a claim that QAOA will fail nor that classical methods are permanently ahead.
Supporting sources
primary paper · identifier verified
A Quantum Approximate Optimization Algorithm
Edward Farhi, Jeffrey Goldstone, Sam Gutmann · 2014
arXiv:1411.4028
Primary source for QAOA, the quantum method against which quantum-inspired classical optimizers are usually compared.
Source record →primary paper · identifier verified
Ising formulations of many NP problems
Andrew Lucas · 2013
arXiv:1302.5843
Catalogues explicit Ising encodings for NP-hard problems — the step that turns a combinatorial problem into a spin model a tensor network can act on.
Source record →