Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

FOCS
1997
IEEE

favoriteEmaildiscussreport

83views Theoretical Computer Science» more FOCS 1997»

On the Power of Quantum Finite State Automata

13 years 8 months ago

On the Power of Quantum Finite State Automata

Download www.cs.uwaterloo.ca

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.

Attila Kondacs, John Watrous

Real-time Traffic

2-way Nite State | FOCS 1997 | Nite State Automata | Quantum Nite State | Theoretical Computer Science |

claim paper

Related Content

» Varieties Generated by Certain Models of Reversible Finite Automata

» Interference Automata

» Twoway finite automata with quantum and classical states

» Power of Cooperation and Multihead Finite Systems

» Evolutionary State Assignment for Synchronous Finite State Machines

» On the Power of Finite Automata with Both Nondeterministic and Probabilistic States

» FiniteState Controllers Based on Mealy Machines for Centralized and Decentralized POMDPs

» On Stateless Multihead Finite Automata and Multihead Pushdown Automata

» Advice Coins for Classical and Quantum Computation

Post Info
More Details (n/a)

Added	06 Aug 2010
Updated	06 Aug 2010
Type	Conference
Year	1997
Where	FOCS
Authors	Attila Kondacs, John Watrous

Comments (0)