An N/4 fixed-point duality quantum search algorithm
An N/4 fixed-point duality quantum search algorithm
复制标题
一种N/4定点对偶量子搜索算法
DOI：
10.1007/s11433-010-4079-x
复制
发表时间：
2010-09-01
影响因子：
6.4
通讯作者：
Long GuiLu
中科院分区：
文献类型：
--
作者：
Hao Liang;Liu Dan;Long GuiLu
本文提出了一种不动点对偶量子搜索算法。该算法使用迭代的非酉操作和测量来搜索未排序的数据库。一旦找到标记的项目，算法自动停止。该算法使用一个常数非酉算子，平均需要N/4步（N是来自数据库的数据数量）来定位标记状态。最后给出了该算法在普通量子计算机上的实现。
Here a fixed-point duality quantum search algorithm is proposed. This algorithm uses iteratively non-unitary operations and measurements to search an unsorted database. Once the marked item is found, the algorithm stops automatically. This algorithm uses a constant non-unitary operator, and requires N/4 steps on average (N is the number of data from the database) to locate the marked state. The implementation of this algorithm in a usual quantum computer is also demonstrated.