The weighted majority algorithm
Information and Computation
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
SIAM Journal on Computing
Strengths and Weaknesses of Quantum Computing
SIAM Journal on Computing
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Inductive Inference of Recursive Functions: Complexity Bounds
Baltic Computer Science, Selected Papers
Quantum Lower Bounds by Polynomials
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Quantum lower bounds by quantum arguments
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Quantum Algorithms for Intersection and Proximity Problems
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
The Quantum Computing Challenge
Informatics - 10 Years Back. 10 Years Ahead.
Introduction to Recent Quantum Algorithms
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Quantum lower bounds by quantum arguments
Journal of Computer and System Sciences - Special issue on STOC 2000
Graph entropy and quantum sorting problems
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Quantum search of partially ordered sets
Quantum Information & Computation
Reconstructing strings from substrings with quantum queries
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
| Hi-index | 0.00 |
We show that any quantum algorithm searching an ordered list of n elements needs to examine at least log n/12-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.