On generalized quantum turing machine and its language classes

Authors:
Satoshi Iriyama;Masanori Ohya
Affiliations:
Tokyo University of Science, Department of Information Sciences, Noda City, Chiba, Japan;Tokyo University of Science, Department of Information Sciences, Noda City, Chiba, Japan
Venue:
MATH'07 Proceedings of the 11th WSEAS International Conference on Applied Mathematics
Year:
2007

Citing 3
Cited 0

Computational complexity of uniform quantum circuit families and quantum Turing machines

Theoretical Computer Science
NP Problem in Quantum Algorithm

Open Systems & Information Dynamics
A Stochastic Limit Approach to the SAT Problem

Open Systems & Information Dynamics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ohya and Volovich have proposed a new quantum computation model with chaotic amplification to solve the SAT problem, which went beyond usual quantum algorithm. In this paper, we generalize quantum Turing machine by rewriting usual quantum Turing machine in terms of channel transformation. Moreover, we define some computational classes of generalized quantum Turing machine and show that we can treat the Ohya-Volovich (OV) SAT algorithm.