Finding Solutions to NP Problems: Philosophical Difference Between Quantum and Evolutionary Search Algorithms

Simple item page
dc.creatorGreenwood, G. W.
dc.date2000-10-05
dc.date.accessioned2026-07-07T06:00:56Z
dc.date.available2026-07-07T06:00:56Z
dc.descriptionThere is no known polynomial-time algorithm that can solve an NP problem. Evolutionary search has been shown to be a viable method of finding acceptable solutions within a reasonable time period. Recently quantum computers have surfaced as another alternative method. But these two methods use radically different philosophies for solving NP problems even though both search methods are non-deterministic. This paper uses instances of {\bf SAT}, {\bf 3SAT} and {\bf TSP} to describe how these two methods differ in their approach to solving NP problems.
dc.description12 pages, 3 figures, submitted to Congress on Evolutionary Computation 2001
dc.identifierhttps://arxiv.org/abs/quant-ph/0010021
dc.identifierhttp://arxiv.org/abs/quant-ph/0010021
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/89115
dc.subjectQuantum Physics
dc.titleFinding Solutions to NP Problems: Philosophical Difference Between Quantum and Evolutionary Search Algorithms
dc.typetext

Files

Collections

arXiv