|
|||||
|
|
A note on the search for k elements via quantum walk |
|
| Authors: | Sebastian Dö rn |
| Affiliation: | a Carl Zeiss AG, 73447 Oberkochen, Germany b Fak. Elektronik und Informatik, HTW Aalen, 73430 Aalen, Germany |
| 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. |
| Keywords: | Quantum query complexity Quantum walk Randomized algorithms Analysis of algorithms Combinatorial problems |
| 本文献已被 ScienceDirect 等数据库收录！ | |