Two-way finite automata with quantum and classical states

Details Two-way finite automata with quantum and classical states Two-way finite automata with quantum and classical states

1999-11-16

arxiv.org/abs/cs/9911009v1

Computer Science

Computational Complexity

11 pages

Scientific paper

We introduce 2-way finite automata with quantum and classical states (2qcfa's). This is a variant on the 2-way quantum finite automata (2qfa) model which may be simpler to implement than unrestricted 2qfa's; the internal state of a 2qcfa may include a quantum part that may be in a (mixed) quantum state, but the tape head position is required to be classical. We show two languages for which 2qcfa's are better than classical 2-way automata. First, 2qcfa's can recognize palindromes, a language that cannot be recognized by 2-way deterministic or probabilistic finite automata. Second, in polynomial time 2qcfa's can recognize {a^n b^n | n>=0}, a language that can be recognized classically by a 2-way probabilistic automaton but only in exponential time.

Affiliated with

Also associated with

No associations

Rating

Two-way finite automata with quantum and classical states does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Two-way finite automata with quantum and classical states, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two-way finite automata with quantum and classical states will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-239023