“…In order to describe the motive of this paper, a brief history of the series of the author's works [1,3,4,5] is given below. As a departure point of the series of the author's works, Grover's quantum search algorithm [6] is worth touched on, which is well-known to be one of the milestones on the road of quantum computation [2]: For a large number, say N = 2 n , of randomly sorted data, the complexity of Grover's algorithm is of O( √ N ), which is lower than the theoretical boundary, O(N ), of any non-quantum searches.…”