Simple algorithm for partial quantum search

被引：40

作者：

Korepin, Vladimir E. ^{[1
]}

Grover, Lov K.

机构：

[1] SUNY Stony Brook, CN Yang Inst Theoret Phys, Stony Brook, NY 11794 USA

[2] Bell Labs, Lucent Technol, Murray Hill, NJ 07974 USA

来源：

QUANTUM INFORMATION PROCESSING | 2006年 / 5卷 / 01期

关键词：

quantum computation; quantum algorithms; search algorithms;

D O I：

10.1007/s11128-005-0004-z

中图分类号：

O4 [物理学];

学科分类号：

0702 ;

摘要：

Quite often in database search, we only, need to extract portion of the information about the satisfying item. We consider this problem in the following form the database of N items is separated into K blocks of size b = N/K elements each and an algorithm has just to find the block containing the item (of interest. The queries are exactly the same as in the standard database search problem. We present a quantum algorithm for this problem of partial search that takes about 0.34 root b fewer iterations than the quantum search algorithm.

引用

页码：5 / 10

页数：6