Some quantum search algorithms for arbitrary initial amplitude distribution

For searching any item in an unsorted database with N items, Grover´s quantum searching algorithm takes only O(√N) steps, which is much faster than O(N) steps required for a classical computer. However, it is known that Grover´s algorithm is effective only in the case where the initial amplitude distribution of dataset is uniform. On the other hand, Ventura has also proposed a quantum searching algorithm. The algorithm is effective only in the special case for the initial amplitude distribution. Therefore, we have proposed an effective quantum searching algorithm in another case in the previous paper. In this paper, we generalize the previous algorithm and propose several effective algorithms in several cases where initial amplitude distributions of dataset are non-uniform. Further, in order to show the effectiveness of the algorithms, we analyze their dynamics.