Title :
Finding solutions to NP problems: philosophical differences between quantum and evolutionary search algorithms
Author_Institution :
Dept. of Electr. & Comput. Eng., Portland State Univ., OR, USA
Abstract :
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
Keywords :
computational complexity; computational geometry; quantum computing; 3SAT; NP problems; SAT; TSP; evolutionary search algorithms; philosophical differences; quantum computer; quantum search algorithms; Biology computing; Computational modeling; Evolutionary computation; Genetic mutations; NP-hard problem; Quantum computing; Quantum entanglement; Quantum mechanics; Search methods; Space exploration;
Conference_Titel :
Evolutionary Computation, 2001. Proceedings of the 2001 Congress on
Conference_Location :
Seoul
Print_ISBN :
0-7803-6657-3
DOI :
10.1109/CEC.2001.934274
