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

Full description

Bibliographic Details

Published in:	Applied mathematics and computation Vol. 218; no. 16; pp. 8019 - 8028
Main Authors:	Iriyama, S., Ohya, M.
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 15.04.2012
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!