Finding solutions to NP problems: philosophical differences between quantum and evolutionary search algorithms
G.W. Greenwood · 2002
This paper uses instances of SAT, 3SAT and TSP to describe how evolutionary search (running on a classical computer) differs from quantum search (running on a quantum computer) for solving NP problems.