Phys. Rev. A 61, 052311 (2000) [7 pages]Quantum search heuristicsReceived 19 October 1999; revised 12 January 2000; published 14 April 2000 An alternative quantum algorithm for combinatorial search, adjusting amplitudes based on number of conflicts in search states, performs well, on average, for hard random satisfiability problems near a phase transition in search difficulty. The algorithm exploits correlations among problem properties more effectively than some current heuristics, and improves on prior quantum algorithms that ignore these correlations. © 2000 The American Physical Society URL:
http://link.aps.org/doi/10.1103/PhysRevA.61.052311
DOI:
10.1103/PhysRevA.61.052311
PACS:
03.67.Lx, 89.70.+c, 02.70.-c
|
|
About | Terms and Conditions | Subscriptions | Search | Help
Use of the American Physical Society websites and journals implies that the user has read and agrees to our Terms and Conditions and any applicable Subscription Agreement. Physical Review®, Physical Review Letters®, Reviews of Modern Physics®, and Physical Review Special Topics® are trademarks of the American Physical Society.