On Quantum Algorithm for Binary Search and Its Computational Complexity
Satoshi Iriyama, Makoto Ohya, Igor Vasil'evich Volovich · Open Systems & Information Dynamics · 2015
A new quantum algorithm for the search problem and its computational complexity are discussed. Its essential part is the use of the so-called chaos amplifier, [8, 9, 10, 13]. It is shown that for the search problem containing [Formula: see text] objects time complexity of the method is polynomial in [Formula: see text].