Computational complexity and applications of quantum algorithm

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 measuremen...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Applied mathematics and computation Ročník 218; číslo 16; s. 8019 - 8028
Hlavní autoři: Iriyama, S., Ohya, M.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 15.04.2012
Témata:
Algorithms
Chaos theory
Complexity
Computation
Computational complexity
Dissipation
Dynamics
Mathematical models
Quantum algorithm
Quantum Turing machine
Turing machines
Quantum Turing machine
Computational complexity
Quantum algorithm
ISSN:0096-3003, 1873-5649
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2011.05.024