An Exact Quantum Search Algorithm with Arbitrary Database |
| |
Authors: | Yang Liu |
| |
Institution: | 1. School of Nuclear Science and Engineering, North China Electric Power University, Beijing, 102206, China
|
| |
Abstract: | In standard Grover’s algorithm for quantum searching, the probability of finding a marked state is not exactly 1, and some modified versions of Grover’s algorithm that search a marked state from an evenly distributed database with full successful rate have been presented. In this article, we present a generalized quantum search algorithm that searches M marked states from an arbitrary distributed N-item quantum database with a zero theoretical failure rate, where N is not necessary to be the power of 2. We analyze the general properties of our search algorithm, we find that our algorithm has periodicity with a period of 2J + 1, and it is effective with certainty for J + (2J + 1)m times of iteration, where m is an arbitrary nonnegative number. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|