REVIEW ON QUANTUM CHAOS ALGORITHM AND GENERALIZED QUANTUM TURING MACHINE
Satoshi Iriyama, Makoto Ohya
We have studied the quantum algorithm for several years to solve NP complete problem in polynomial times. Moreover we have discussed a computational complexity of it in terms of Turing machine. In this paper, we review some of our results and explain some new Turing machine and its language classes following our recent works 1,2 .
Quantum Bio-Informatics•Mar 1, 2008•3 citations