@inproceedings{WolfyJune1999ALB, title={A Lower Bound for Quantum Search of an Ordered ListHarry Buhrman}, author={Ronald de WolfyJune}, year={1999} }

- Published 1999

It is known that a quantum computer can search an unordered list of N items using O(p N) look-ups, which is quadratically faster than any classical algorithm. We examine the case where the list is ordered, and show that no quantum computer can do with fewer than (p log N = log log N) look-ups.

### Presentations referencing similar topics