کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4630701 | 1340605 | 2012 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Computational complexity and applications of quantum algorithm
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 218, Issue 16, 15 April 2012, Pages 8019–8028
Journal: Applied Mathematics and Computation - Volume 218, Issue 16, 15 April 2012, Pages 8019–8028
نویسندگان
S. Iriyama, M. Ohya,