Tight bounds on quantum searching

Details Tight bounds on quantum searching Tight bounds on quantum searching

1996-05-23

arxiv.org/abs/quant-ph/9605034v1

Fortsch.Phys.46:493-506,1998

Physics

Quantum Physics

8 pages, LaTeX2e, PhysComp 96 submission

Scientific paper

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 element even when the number of solutions is not known ahead of time. Using techniques from Shor's quantum factoring algorithm in addition to Grover's approach, we introduce a new technique for approximate quantum counting, which allows to estimate the number of solutions. Finally we provide a lower bound on the efficiency of any possible quantum database searching algorithm and we show that Grover's algorithm nearly comes within a factor 2 of being optimal in terms of the number of probes required in the table.

Affiliated with

Also associated with

No associations

Rating

Tight bounds on quantum searching does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Tight bounds on quantum searching, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tight bounds on quantum searching will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-463961