Local Search Methods for Quantum Computers

Details Local Search Methods for Quantum Computers Local Search Methods for Quantum Computers

1998-02-16

arxiv.org/abs/quant-ph/9802043v1

Physics

Quantum Physics

28 pages, 6 figures, for related papers see http://www.parc.xerox.com/dynamics/www/quantum.html

Scientific paper

Local search algorithms use the neighborhood relations among search states and often perform well for a variety of NP-hard combinatorial search problems. This paper shows how quantum computers can also use these neighborhood relations. An example of such a local quantum search is evaluated empirically for the satisfiability (SAT) problem and shown to be particularly effective for highly constrained instances. For problems with an intermediate number of constraints, it is somewhat less effective at exploiting problem structure than incremental quantum methods, in spite of the much smaller search space used by the local method.

Affiliated with

Also associated with

No associations

Rating

Local Search Methods for Quantum Computers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Local Search Methods for Quantum Computers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Local Search Methods for Quantum Computers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-486453