Phys. Rev. A 72, 052316 (2005) [8 pages]Solving satisfiability problems by the ground-state quantum computerReceived 28 November 2004; published 17 November 2005 A quantum algorithm is proposed to solve the satisfiability (SAT) problems by the ground-state quantum computer. The scale of the energy gap of the ground-state quantum computer is analyzed for the 3-bit exact cover problem. The time cost of this algorithm on the general SAT problems is discussed. © 2005 The American Physical Society URL:
http://link.aps.org/doi/10.1103/PhysRevA.72.052316
DOI:
10.1103/PhysRevA.72.052316
PACS:
03.67.Lx
|
|
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.