A better lower bound for quantum algorithms searching an ordered list

Details A better lower bound for quantum algorithms searching an ordered list A better lower bound for quantum algorithms searching an ordered list

1999-02-14

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

Physics

Quantum Physics

10 pages, LaTeX

Scientific paper

We show that any quantum algorithm searching an ordered list of n elements needs to examine at least 1/12 log n-O(1) of them. Classically, log n queries are both necessary and sufficient. This shows that quantum algorithms can achieve only a constant speedup for this problem. Our result improves lower bounds of Buhrman and de Wolf(quant-ph/9811046) and Farhi, Goldstone, Gutmann and Sipser (quant-ph/9812057).

Affiliated with

Also associated with

No associations

Rating

A better lower bound for quantum algorithms searching an ordered list 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 A better lower bound for quantum algorithms searching an ordered list, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A better lower bound for quantum algorithms searching an ordered list will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-625115