Hamming, Permutations and Automata

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 prove that there is an infinite sequence of distinct integers n such that there are languages L _n such that there are quantum finite automata with mixed states with 5n 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.

Unfortunately, the alphabet for these languages grows with n. In order to prove a similar result for languages in a fixed alphabet we consider a counterpart of Hamming codes for permutations of finite sets, i.e. sets of permutations such that any two distinct permutations in the set have Hamming distance at least d. The difficulty arises from the fact that in the traditional Hamming codes for binary strings positions in the string are independent while positions in a permutation are not independent. For instance, any two permutations of the same set either coinside or their Hamming distance is at least 2. The main combinatorial problem still remains open.

Research supported by Grant No.05.1528 from the Latvian Council of Science.