Iriyama, S.; Ohya, M.; Volovich, I. V. On quantum algorithm for binary search and its computational complexity. (English) Zbl 1328.81080 Open Syst. Inf. Dyn. 22, No. 3, Article ID 1550019, 9 p. (2015). Summary: 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. It is shown that for the search problem containing \(2^n\) objects time complexity of the method is polynomial in \(n\). Cited in 1 Document MSC: 81P68 Quantum computation 68P10 Searching and sorting × Cite Format Result Cite Review PDF Full Text: DOI arXiv References: [2] doi:10.1016/S0019-9958(84)80060-1 · Zbl 0592.03035 · doi:10.1016/S0019-9958(84)80060-1 [3] doi:10.1016/S0034-4877(03)90002-4 · Zbl 1053.81014 · doi:10.1016/S0034-4877(03)90002-4 [4] doi:10.1088/1464-4266/5/6/015 · doi:10.1088/1464-4266/5/6/015 [5] doi:10.1023/B:OPSY.0000047567.88377.74 · Zbl 1108.81006 · doi:10.1023/B:OPSY.0000047567.88377.74 [6] doi:10.1137/S0097539704445226 · Zbl 1102.81032 · doi:10.1137/S0097539704445226 [7] doi:10.1142/S1230161208000262 · Zbl 1188.81046 · doi:10.1142/S1230161208000262 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.