On the space efficiency of one way quantum finite automata
Andris Ambainis, Ashwin Nayak, Umesh V. Vazirani
Abstract
We exhibit a family {L_n} of finite regular languages such that any 1-way quantum finite automaton (QFA) accepting L_n with probability 1/2 + epsilon (for any constant epsilon > 0) must have 2^{Omega(n/log n)} states. On the other hand, each language L_n can be recognized by a deterministic finite automaton (DFA) of size O(n). This is in immediate contrast to the recent result of Ambainis and Freivalds which shows that for some regular languages, 1-way QFAs can be exponentially more space-efficient as compared to DFAs.