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

Podrobná bibliografia

Vydané v:	Applied mathematics and computation Ročník 218; číslo 16; s. 8019 - 8028
Hlavní autori:	Iriyama, S., Ohya, M.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 15.04.2012
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!