Tight Bounds on Quantum Searching ?

  title={Tight Bounds on Quantum Searching ?},
  author={Michel Boyer and Gilles Brassard and Alain Tapp},
We provide a tight analysis of Grover’s recent algorithm for quantum database searching. We give a simple closed-form formula for the probability of success after any given number of iterations of the algorithm. This allows us to determine the number of iterations necessary to achieve almost certainty of finding the answer. Furthermore, we analyse the behaviour of the algorithm when the element to be found appears more than once in the table and we provide a new algorithm to find such an… CONTINUE READING
Highly Influential
This paper has highly influenced 77 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.


Publications citing this paper.
Showing 1-10 of 407 extracted citations

Fixed-Complexity Quantum-Assisted Multi-User Detection for CDMA and SDMA

IEEE Transactions on Communications • 2014
View 18 Excerpts
Highly Influenced

A Quantum Algorithm for Software Engineering Search

2009 IEEE/ACM International Conference on Automated Software Engineering • 2009
View 11 Excerpts
Highly Influenced

Quantum Genetic Optimization

IEEE Transactions on Evolutionary Computation • 2008
View 11 Excerpts
Highly Influenced

Quantum Rough Counting and Its Application to Grover's Search Algorithm

2018 3rd International Conference on Computer and Communication Systems (ICCCS) • 2018
View 8 Excerpts
Highly Influenced


Publications referenced by this paper.
Showing 1-10 of 10 references

Quantum measurements and the Abelian Stabilizer Problem

Electronic Colloquium on Computational Complexity • 1996
View 3 Excerpts
Highly Influenced

Quantum crypt- analysis of hash and claw-free functions

Brassard, Gilles, Peter H yer, Alain Tapp
ACM Sigact News, • 1997

Searching a quantum phone book

Brassard, Gilles
Science, Vol. 275, • 1997
View 1 Excerpt

Computers and Intractabil- ity: A Guide to the Theory of NP{completeness

Garey, R Michael, David S. Johnson
View 1 Excerpt

Johnson , Computers and Intractability : A Guide to the Theory of NP – completeness

R. Michael, S. David

Smolin and Harald Weinfurter , “ Elementary gates for quantum computation ”

Charles H. Bennett, Richard Cleve, +4 authors A. John
Physical Review A

Similar Papers

Loading similar papers…