Local Search Methods for Quantum Computers
| dc.creator | Hogg, Tad | |
| dc.creator | Yanik, Mehmet | |
| dc.date | 1998-02-16 | |
| dc.date.accessioned | 2026-07-07T06:14:48Z | |
| dc.date.available | 2026-07-07T06:14:48Z | |
| dc.description | 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. | |
| dc.description | 28 pages, 6 figures, for related papers see http://www.parc.xerox.com/dynamics/www/quantum.html | |
| dc.identifier | https://arxiv.org/abs/quant-ph/9802043 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/9802043 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/93599 | |
| dc.subject | Quantum Physics | |
| dc.title | Local Search Methods for Quantum Computers | |
| dc.type | text |