Quantum advantage for combinatorial optimization problems, Simplified
Mario Szegedy
所有作者
Mario Szegedy
文献摘要
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.