2012年4月
Computational complexity and applications of quantum algorithm
APPLIED MATHEMATICS AND COMPUTATION
- ,
- 巻
- 218
- 号
- 16
- 開始ページ
- 8019
- 終了ページ
- 8028
- 記述言語
- 英語
- 掲載種別
- 研究論文(学術雑誌)
- DOI
- 10.1016/j.amc.2011.05.024
- 出版者・発行元
- ELSEVIER SCIENCE INC
We have studied on quantum algorithm several years, and introduced a mathematical model of it in order to discuss the computational complexity. Our model of quantum algorithm, called a generalized quantum Turing machine (GQTM) contains not only unitary computation process but also quantum measurement and dissipative process. Moreover, we discovered that a chaos dynamics has very important role in quantum algorithm, that is useful to solve NP complete problem in polynomial time. In this paper, we introduce the GQTM and some applications. (C) 2011 Elsevier Inc. All rights reserved.
- リンク情報
- ID情報
-
- DOI : 10.1016/j.amc.2011.05.024
- ISSN : 0096-3003
- eISSN : 1873-5649
- Web of Science ID : WOS:000302267700005