Phys. Rev. A 60, 2746–2751 (1999)Grover’s quantum searching algorithm is optimalReceived 20 February 1998; revised 28 December 1998; published in the issue dated October 1999 I show that for any number of oracle lookups up to about π/4√N, Grover’s quantum searching algorithm gives the maximal possible probability of finding the desired element. I explain why this is also true for quantum algorithms which use measurements during the computation. I also show that unfortunately quantum searching cannot be parallelized better than by assigning different parts of the search space to independent quantum computers. © 1999 The American Physical Society URL:
http://link.aps.org/doi/10.1103/PhysRevA.60.2746
DOI:
10.1103/PhysRevA.60.2746
PACS:
03.67.Lx, 03.65.Bz
|
|
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.