論文

査読有り
2015年9月

On Quantum Algorithm for Binary Search and Its Computational Complexity

OPEN SYSTEMS & INFORMATION DYNAMICS
  • S. Iriyama
  • ,
  • M. Ohya
  • ,
  • I. V. Volovich

22
3
記述言語
英語
掲載種別
研究論文(学術雑誌)
DOI
10.1142/S1230161215500195
出版者・発行元
WORLD SCIENTIFIC PUBL CO PTE LTD

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 2(n) objects time complexity of the method is polynomial in n.

Web of Science ® 被引用回数 : 5

リンク情報
DOI
https://doi.org/10.1142/S1230161215500195
Web of Science
https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=JSTA_CEL&SrcApp=J_Gate_JST&DestLinkType=FullRecord&KeyUT=WOS:000362980000006&DestApp=WOS_CPL

エクスポート
BibTeX RIS