Quantum advantage for combinatorial optimization problems, Simplified

Abstract

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.

Cited by in corpus (1)

• Generating Hard Ising Instances With Planted Solutions Using Post-Quantum Cryptographic Protocols