| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 427457 | Information Processing Letters | 2010 | 4 Pages |
Abstract
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 times the number of queries to find one solution.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
