Generalized Quantum Turing Machine and its Application to the SAT Chaos   Algorithm
  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, and we show in this general quantum Turing machine (GQTM) that we can treat the Ohya-Volovich (OV) SAT algorithm. 
Satoshi Iriyama, Masanori Ohya and Igor Volovich