Exact quantum lower bound for Grover's problem

Details Exact quantum lower bound for Grover's problem Exact quantum lower bound for Grover's problem

2008-10-20

arxiv.org/abs/0810.3647v1

Physics

Quantum Physics

7 pages, no figures

Scientific paper

One of the most important quantum algorithms ever discovered is Grover's algorithm for searching an unordered set. We give a new lower bound in the query model which proves that Grover's algorithm is exactly optimal. Similar to existing methods for proving lower bounds, we bound the amount of information we can gain from a single oracle query, but we bound this information in terms of angles. This allows our proof to be simple, self-contained, based on only elementary mathematics, capturing our intuition, while obtaining at the same an exact bound.

Affiliated with

Also associated with

No associations

Rating

Exact quantum lower bound for Grover's problem 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 Exact quantum lower bound for Grover's problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exact quantum lower bound for Grover's problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-571878