Computational complexity and applications of quantum algorithm

Computational complexity and applications of quantum algorithm

0.00 Avg rating0 Votes
Article ID: iaor20123323
Volume: 218
Issue: 16
Start Page Number: 8019
End Page Number: 8028
Publication Date: Apr 2012
Journal: Applied Mathematics and Computation
Authors: ,
Keywords: computers, computers: data-structure
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.