On Quantum Algorithm for Binary Search and Its Computational Complexity
S. Iriyama, M. Ohya, I. V. Volovich·2013-06-21·via cs.IT updates on arXiv.org
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.