Quantum Search with Variable Times |
| |
| Authors: | Andris Ambainis |
| |
| Affiliation: | 1. Faculty of Computing, University of Latvia, Raina bulv. 19, Riga, 1586, Latvia
|
| |
| Abstract: | Since Grover’s seminal work, quantum search has been studied in great detail. In the usual search problem, we have a collection
of n items x
1,…,x
n
and we would like to find i:x
i
=1. We consider a new variant of this problem in which evaluating x
i
for different i may take a different number of time steps. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
