On Quantum Algorithm for Binary Search and Its Computational Complexity

A new quantum algorithm for a search problem and its computational complexity are discussed. It is shown in the search problem containing 2^n objects that our algorithm runs in polynomial time.Comment: 8 pages, no figure