Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States

Abstract

Quantum finite automata with mixed states are proved to be super-exponentially more concise rather than quantum finite automata with pure states. It was proved earlier by A.Ambainis and R.Freivalds that quantum finite automata with pure states can have exponentially smaller number of states than deterministic finite automata recognizing the same language. There was a never published ”folk theorem” proving that quantum finite automata with mixed states are no more than super-exponentially more concise than deterministic finite automata. It was not known whether the super-exponential advantage of quantum automata is really achievable.We use a novel proof technique based on Kolmogorov complexity to prove that there is an infinite sequence of distinct integers n such that there are languages L n in a 4-letter alphabet such that there are quantum finite automata with mixed states with 2n + 1 states recognizing the language L n with probability \(\frac{3}{4} \) while any deterministic finite automaton recognizing L n needs to have at least e O(nlnn) states.KeywordsFinite AutomatonKolmogorov ComplexityInput WordComputable NumberingIdentity PermutationThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.