Quantum finite automata: A modern introduction
Formal Languages and Automata Theory
2014-06-17 v1 Computational Complexity
Quantum Physics
Abstract
We present five examples where quantum finite automata (QFAs) outperform their classical counterparts. This may be useful as a relatively simple technique to introduce quantum computation concepts to computer scientists. We also describe a modern QFA model involving superoperators that is able to simulate all known QFA and classical finite automaton variants.
Keywords
Cite
@article{arxiv.1406.4048,
title = {Quantum finite automata: A modern introduction},
author = {A. C. Cem Say and Abuzer Yakaryilmaz},
journal= {arXiv preprint arXiv:1406.4048},
year = {2014}
}
Comments
15 pages