Can one quantum bit separate any pair of words with zero-error?
arXiv: Formal Languages and Automata Theory, Volume abs/1602.07967, 2016.
Determining the minimum number of states required by a finite automaton to separate a given pair of different words is an important problem. In this paper, we consider this problem for quantum automata (QFAs). We show that 2-state QFAs can separate any pair of words in nondeterministic acceptance mode and conjecture that they can separate...More
PPT (Upload PPT)