On the Lower Bounds for One-Way Quantum Automata
In the paper we consider measured-once (MO-QFA) oneway quantum finite automaton. We prove that for MO-QFA Q that (1/2+ε)-accepts (ε ∈ (0,1/2)) regular language L it holds that dim(Q) = Ω (log dim (A)/log log dim (A)). In the case ε ∈ (3/8, 1/2) we have more precise lower bound dim(Q) = Ω (log dim (A)) where A is a minimal deterministic finite automaton accepting L, dim(Q), and dim(A) are complexity (number of states) of automata Q and A respectively, (1/2 - ε) is the error of Q.
The example of language presented in  show that our lower bounds are tight enough.
KeywordsTransition Function Regular Language Input Word Deterministic Finite Automaton Deterministic Automaton
Unable to display preview. Download preview PDF.
- 1.P. Alexandrov, Introduction to set theory and general topology, Moscow, Nauka, 1977 (in Russian).Google Scholar
- 2.A. Ambainis and R. Freivalds, 1-way quantum finite automata: strengths, weaknesses and generalization, In Proceeding of the 39th IEEE Conference on Foundation of Computer Science, 1998, 332–342. See also quant-ph/9802062 v3Google Scholar
- 3.A. Brodsky and N. Pippenger, Characterizations of 1-way quantum finite automata, quant-ph/9903014, 1999Google Scholar
- 5.A. Kondacs, J. Watrous, On the power of quantum finite state automata. In Proceeding of the 38th IEEE Conference on Foundation of Computer Science, 1997, 66–75.Google Scholar
- 6.C. Moore and J. Crutchfield, Quantum automata and quantum grammars, quant-ph/9707031Google Scholar
- 7.A. Nayak, Optimal lower bounds for quantum automata and random access codes, Proceeding of the 40th IEEE Conference on Foundation of Computer Science, 1999, 369–376. See also quant-ph/9904093Google Scholar