Quantum Probability and Infinite Dimensional Analysis
ON GENERALIZED QUANTUM TURING MACHINE AND ITS APPLICATION
Satoshi Iriyama, Masanori Ohya
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.