期刊
QUANTUM INFORMATION PROCESSING
卷 6, 期 1, 页码 1-8出版社
SPRINGER
DOI: 10.1007/s11128-006-0037-y
关键词
quantum database search; Grover's algorithm; partial search; sure success
Partial search has been proposed recently for finding the target block containing a target element with fewer queries than the full Grover search algorithm which can locate the target precisely. Since such partial searches will likely be used as subroutines for larger algorithms their success rate is important. We propose a partial search algorithm which achieves success with unit probability.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据