Turing machines based on unsharp quantum logic

In this paper, we consider Turing machines based on unsharp quantum logic. For a lattice-ordered quantum multiple-valued (MV) algebra E, we introduce E-valued non-deterministic Turing machines (ENTMs) and E-valued deterministic Turing machines (EDTMs). We discuss different E-valued recursively enumerable languages from width-first and depth-first recognition. We find that width-first recognition is equal to or less than depth-first recognition in general. The equivalence requires an underlying E value lattice to degenerate into an MV algebra. We also study variants of ENTMs. ENTMs with a classical initial state and ENTMs with a classical final state have the same power as ENTMs with quantum initial and final states. In particular, the latter can be simulated by ENTMs with classical transitions under a certain condition. Using these findings, we prove that ENTMs are not equivalent to EDTMs and that ENTMs are more powerful than EDTMs. This is a notable difference from the classical Turing machines.

[1]  Jirí Wiedermann,et al.  Fuzzy Turing Machines Revised , 2002, Comput. Artif. Intell..

[2]  Umesh V. Vazirani,et al.  Quantum Complexity Theory , 1997, SIAM J. Comput..

[3]  Roberto Giuntini.  Quantum MV algebras , 1996, Stud Logica.

[4]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[5]  Yongming Li,et al.  Finite automata based on quantum logic and monadic second-order quantum logic , 2010, Science in China Series F: Information Sciences.

[6]  D. Foulis,et al.  Effect algebras and unsharp quantum logics , 1994 .

[7]  Yongming Li,et al.  Fuzzy Turing Machines: Variants and Universality , 2008, IEEE Transactions on Fuzzy Systems.

[8]  Yun Shang,et al.  Automata theory based on unsharp quantum logic , 2009, Math. Struct. Comput. Sci..

[9]  Yun Shang,et al.  A theory of computation based on unsharp quantum logic: Finite state automata and pushdown automata , 2012, Theor. Comput. Sci..

[10]  Simon Perdrix.  Partial Observation of Quantum Turing Machines and a Weaker Well-Formedness Condition , 2011, Electron. Notes Theor. Comput. Sci..

[11]  Sylvia Pulmannová,et al.  New trends in quantum structures , 2000 .

[12]  Mingsheng Ying,et al.  Quantum logic and automata theory , 2007 .

[13]  Simon Perdrix,et al.  Classically controlled quantum computation , 2004, Mathematical Structures in Computer Science.

[14]  Stanley Gudder.  Total extensions of effect algebras , 1995 .

[15]  Daowen Qiu,et al.  Automata theory based on quantum logic: some characterizations , 2004, Inf. Comput..