On the Power of Quantum Finite State Automata

In this paper, we introduce 1-way and 2-way quantum nite state automata (1qfa's and 2qfa's), which are the quantum analogues of deterministic, nondeterministic and probabilistic 1-way and 2-way nite state automata. We prove the following facts regarding 2qfa's.

• Type: Conference
• Year: 1997
• Where: FOCS
• Authors: Attila Kondacs, John Watrous
• Keywords: 2-way Nite State, FOCS 1997, Nite State Automata, Quantum Nite State, Theoretical Computer Science