Physics – Quantum Physics
Scientific paper
2011-12-09
Physics
Quantum Physics
Comments are welcome. The paper is for a volume of LNCS Festschifts Series devoted to birthday of Prof. Dr. Juergen Dassov
Scientific paper
In this paper, we introduce and explore a new model of {\it quantum finite automata} (QFA). Namely, {\it one-way finite automata with quantum and classical states} (1QCFA), a one way version of {\it two-way finite automata with quantum and classical states} (2QCFA) introduced by Ambainis and Watrous in 2002 \cite{AJ}. First, we prove that {\it one-way probabilistic finite automata} (1PFA) \cite{AP} and {\it one-way quantum finite automata with control language} (1QFACL) \cite{ACB} as well as several other models of QFA, can be simulated by 1QCFA. Afterwards, we explore several closure properties for the family of languages accepted by 1QCFA. Finally, the state complexity of 1QCFA is explored and the main succinctness result is derived. Namely, for any prime $m$ and any $\epsilon_1>0$, there exists a language $L_{m}$ that cannot be recognized by any {\it measure-many one-way quantum finite automata} (MM-1QFA) \cite{Kon97} with bounded error $7/9+\epsilon_1$, and any 1PFA recognizing it has at last $m$ states, but $L_{m}$ can be recognized by a 1QCFA for any error bound $\epsilon>0$ with $\bf{O}(\log{m})$ quantum states and 12 classical states.
Gruska Jozef
Li Lvzhou
Qiu Daowen
Zheng Shenggen
No associations
LandOfFree
One-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 One-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 One-way finite automata with quantum and classical states will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-43466