Quantum advantage for combinatorial optimization problems, Simplified
Márió Szegedy · arXiv (Cornell University) · 2022
We observe that fault-tolerant quantum computers have an optimal advantage over classical computers in approximating solutions to many NP optimization problems. This observation however gives nothing in practice.