Tight Bounds on Quantum Searching ?

@inproceedings{Boyer1996TightBO,
  title={Tight Bounds on Quantum Searching ?},
  author={Michel Boyer and Gilles Brassard and Alain Tapp},
  year={1996}
}
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 74 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.
393 Citations
10 References
Similar Papers

Citations

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

References

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

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
1 Excerpt

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

  • R. Michael, S. David
  • 1979

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…