A better lower bound for quantum algorithms searching an ordered list

@inproceedings{Ambainis1999ABL,
  title={A better lower bound for quantum algorithms searching an ordered list},
  author={Andris Ambainis},
  booktitle={FOCS},
  year={1999}
}
We show that any quantum algorithm searching an ordered list of n elements needs to examine at least log2 n 12 − O(1) of them. Classically, log2 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 (quantph/9812057). 

From This Paper

Topics from this paper.

Citations

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

References

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

The Weighted Majority Algorithm

View 1 Excerpt
Highly Influenced

Quantum counting

G. Brassard, P. Hoyer, A. Tapp
Proceedings of ICALP’98, Lecture Notes in Computer Science, • 1998
View 1 Excerpt

Similar Papers

Loading similar papers…