Quantum search heuristics

Tad Hogg
Phys. Rev. A 61, 052311 – Published 14 April 2000
PDFExport Citation

Abstract

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.

  • Received 19 October 1999

DOI:https://doi.org/10.1103/PhysRevA.61.052311

©2000 American Physical Society

Authors & Affiliations

Tad Hogg*

  • Xerox Palo Alto Research Center, 3333 Coyote Hill Road, Palo Alto, California 94304

  • *URL: http://www.parc.xerox.com/hogg

References (Subscription Required)

Click to Expand
Issue

Vol. 61, Iss. 5 — May 2000

Reuse & Permissions
Access Options

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×