(Enter summary)
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. (Update)
Cited by: More
A Light-Based Device for Solving - The Hamiltonian Path
(Correct)
Quantum-Inspired Evolutionary Algorithms - With New Termination (2004)
(Correct)
Active bibliography (related documents): More All
0.5: Entanglement Criteria - Quantum and Topological - Kauffman, Lomonaco, Jr. (2003)
(Correct)
0.5: Quantum Lower Bound for the Collision Problem - Aaronson (2002)
(Correct)
0.4: Solving Highly Constrained Search Problems with Quantum Computers - Hogg (1999)
(Correct)
Similar documents based on text: More All
0.3: Quantum Geometric Algebra, Version 1.1 - Matzke, Manthey, Cantrell (2003)
(Correct)
0.2: When Abandoned Bits Bite Back -- - Reversibility And Quantum
(Correct)
0.1: Convergence in Evolutionary Programs with Self-Adaptation - Greenwood, Zhu (2001)
(Correct)
BibTeX entry: (Update)
G. W. Greenwood, "Finding solutions to NP problems: Philosophical differences between quantum and evolutionary search algorithms," in Proc. 2001. http://citeseer.ist.psu.edu/greenwood01finding.html More
@misc{ greenwood01finding,
author = "G. Greenwood",
title = "Finding solutions to NP problems: Philosophical differences between quantum
and evolutionary search algorithms",
text = "G. W. Greenwood, Finding solutions to NP problems: Philosophical differences
between quantum and evolutionary search algorithms, in Proc. 2001.",
year = "2001",
url = "citeseer.ist.psu.edu/greenwood01finding.html" }
Citations (may not include all citations):
4212
Computers and intractability: a guide to the theory of NP-co.. (context) - Garey, Johnson - 1979
175
Logical reversibility of computation (context) - Bennett - 1973
118
the Church-Turing principle and the universal quantum comput.. (context) - Deutsch - 1985
116
Simulating physics with computers
- Feynman - 1982
81
The Principles of Quantum Mechanics (context) - Dirac - 1958
48
Quantum mechanics helps in searching for a needle in a hayst.. (context) - Grover - 1997
30
Introduction to Algorithms (context) - Manber - 1989
21
Grover's quantum searching algorithm is optimal (context) - Zalka - 1997
11
A superior evolutionary algorithm for 3SAT
- Back, Eiben et al. - 1998
8
Quantum computing and phase transitions in combinatorial sea..
- Hogg - 1996
7
An introduction to quantum computing for non-physicists (context) - Rieffel, Polak - 2000
6
Lectures on Physics (context) - Feynman, Leighton et al. - 1965
6
Inver-over Operator for the TSP (context) - Tao, Michalewicz - 1998
4
Quantum computers and intractable (context) - Cerny - 1993
3
Proportional selection and sampling algorithms (context) - Grefenstette - 2000
3
Nested quantum search and NP-complete problems (context) - Cerf, Grover et al. - 1998
3
Quantum information processing without entanglement (context) - Knight - 2000
2
Los Alamos Physics preprint archive (context) - Aharonov
2
Los Alamos Physics preprint archive (context) - Preskill, pro - 1997
2
A rosetta stone for quantum mechanics with an introduction t.. (context) - Lomonaco - 2000
2
Quantum information science (context) - Foundation - 1999
1
What really gives a quantum computer its power (context) - Fitzgerald - 2000
1
Los Alamos Physics preprint archive (context) - Ohya, Masuda et al. - 1998
1
Quantum computation: an introduction (context) - Barenco - 1998
1
personal communication with authors (context) - Michalewicz
1
Los Alamos Physics preprint archive (context) - Braunstein, Pati et al. - 2000
1
Los Alamos Physics preprint archive (context) - Vedral, Plenio et al.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC