Quantum advantage for combinatorial optimization problems
A generalization and a detailed proof of the statement that, assuming that the problem of integer factoring is not solvable in polynomial time, there exists an optimization problem for which there exists a polynomial-time quantum 0 .
W. Remmerswaal
· 2 citations