Monday, June 24, 2013

1306.5039 (S. Iriyama et al.)

On Quantum Algorithm for Binary Search and Its Computational Complexity    [PDF]

S. Iriyama, M. Ohya, I. V. Volovich
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.
View original:

No comments:

Post a Comment