A better lower bound for quantum algorithms searching an ordered list
Quantum Physics
2007-05-23 v1 Computational Complexity
Data Structures and Algorithms
Abstract
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).
Cite
@article{arxiv.quant-ph/9902053,
title = {A better lower bound for quantum algorithms searching an ordered list},
author = {Andris Ambainis},
journal= {arXiv preprint arXiv:quant-ph/9902053},
year = {2007}
}
Comments
10 pages, LaTeX