A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum lower bounds by polynomials
Journal of the ACM (JACM)
Quantum Walk Algorithm for Element Distinctness
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Quantum Speed-Up of Markov Chain Based Algorithms
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Quantum algorithms for the triangle problem
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Quantum verification of matrix products
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Quantum Complexity of Testing Group Commutativity
Algorithmica
Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
The quantum query complexity of algebraic properties
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
| Hi-index | 0.89 |
In this paper we use the quantum walk search scheme by Magniez et al. (2007) [13] to find k solutions of a search problem. We show that the quantum query complexity is at most of order klogk times the number of queries to find one solution.