Permutation Groups and the Strength of Quantum Finite Automata with Mixed States ⋆

@inproceedings{Freivalds2007PermutationGA,
  title={Permutation Groups and the Strength of Quantum Finite Automata with Mixed States ⋆},
  author={Rusins Freivalds and Maris Ozols and Laura Mancinska},
  year={2007}
}
It was proved earlier by A. Ambainis and R. Freivalds that the quantum finite automata with pure states can have exponentially smaller number of states than the deterministic finite automata recognizing the same language. There is a never published “folk theorem” claiming that the quantum finite automata with mixed states are no more than super… CONTINUE READING