摘要

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.