Grover{close_quote}s quantum searching algorithm is optimal

Journal Article · Fri Oct 01 00:00:00 EDT 1999 · Physical Review A

DOI:https://doi.org/10.1103/PhysRevA.60.2746· OSTI ID:686548

Zalka, C ^[1]

---

1. T-6, Theoretical Astrophysics, MS B288, Los Alamos National Laboratory, Los Alamos, New Mexico 87545 (United States)

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}

• OSTI ID: 686548
• Journal Information: Physical Review A, Journal Name: Physical Review A Journal Issue: 4 Vol. 60; ISSN 1050-2947; ISSN PLRAAN
• Country of Publication: United States
• Language: English

Related Subjects

66 PHYSICS
99 GENERAL AND MISCELLANEOUS
ALGORITHMS
COMPUTERS
PROGRAMMING
QUANTUM MECHANICS