GROVER'S QUANTUM SEARCHING ALGORITHM IS OPTIMAL
暂无分享,去创建一个
I show that for any number of oracle lookups up to about {pi}/4thinsp{radical} (N) , Grover{close_quote}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. {copyright} {ital 1999} {ital The American Physical Society}
[1] Lov K. Grover. A fast quantum mechanical algorithm for database search , 1996, STOC '96.
[2] C. Fuchs. Distinguishability and Accessible Information in Quantum Theory , 1996, quant-ph/9601020.
[3] Gilles Brassard,et al. Tight bounds on quantum searching , 1996, quant-ph/9605034.
[4] Lov K. Grover. Quantum Mechanics Helps in Searching for a Needle in a Haystack , 1997, quant-ph/9706033.