Abstract
We obtain several lower bounds on the language recognition power of Nayak's generalized quantum finite automata (GQFA) [12]. Techniques for proving lower bounds on Kondacs and Watrous' one-way quantum finite automata (KWQFA) were introduced by Ambainis and Freivalds [2], and were expanded in a series of papers. We show that many of these techniques can be adapted to prove lower bounds for GQFAs. Our results imply that the class of languages recognized by GQFAs is not closed under union. Furthermore, we show that there are languages which can be recognized by GQFAs with probability p > 1/2, but not with p > 2/3. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Mercer, M. (2008). Lower bounds for generalized quantum finite automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5196 LNCS, pp. 373–384). https://doi.org/10.1007/978-3-540-88282-4_34
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
