Finding solutions to NP problems: Philosophical differences between quantum and evolutionary search algorithms

Proceedings of the IEEE Conference on Evolutionary Computation, ICEC

Volumn 2, Issue , 2001, Pages 815-822

  Greenwood, G W ^a  

^a Portland State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER ARCHITECTURE; COMPUTER SCIENCE; MATHEMATICAL TRANSFORMATIONS; POLYNOMIALS; PROBLEM SOLVING;

QUANTUM COMPUTER SYSTEMS;

EVOLUTIONARY ALGORITHMS;

EID: 0034863169     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. A superior evolutionary algorithm for 3SAT
2. Inver-over Operator for the TSP
3. Simulating physics with computers
4. Quantum information science
5. Logical reversibility of computation
6. Quantum theory, the Church-Turing principle and the universal quantum computer
7. Quantum mechanics helps in searching for a needle in a haystack
8. Quantum computers and intractable (NP-complete) computing problems
9. Quantum information processing without entanglement
10. What really gives a quantum computer its power?
11. Proportional selection and sampling algorithms