Quantum finite multitape automata
<|reference_start|>Quantum finite multitape automata: Quantum finite automata were introduced by C.Moore, J.P. Crutchfield, and by A.Kondacs and J.Watrous. This notion is not a generalization of the deterministic finite automata. Moreover, it was proved that not all regular languages can be recognized by quantum finite automata. A.Ambainis and R.Freivalds proved that for some languages quantum finite automata may be exponentially more concise rather than both deterministic and probabilistic finite automata. In this paper we introduce the notion of quantum finite multitape automata and prove that there is a language recognized by a quantum finite automaton but not by a deterministic or probabilistic finite automata. This is the first result on a problem which can be solved by a quantum computer but not by a deterministic or probabilistic computer. Additionally we discover unexpected probabilistic automata recognizing complicated languages.<|reference_end|>
@article{ambainis1999quantum,
    title={Quantum finite multitape automata},
    author={Andris Ambainis, Richard Bonner, Rusins Freivalds, Marats Golovkins,
  Marek Karpinski},
    journal={arXiv preprint arXiv:quant-ph/9905026},
    year={1999},
    archivePrefix={arXiv},
    eprint={quant-ph/9905026},
    primaryClass={quant-ph cs.CC cs.FL}
}