Automata and Quantum Computing
Abstract
Quantum computing is a new model of computation, based on quantum physics. Quantum computers can be exponentially faster than conventional computers for problems such as factoring. Besides full-scale quantum computers, more restricted models such as quantum versions of finite automata have been studied. In this paper, we survey various models of quantum finite automata and their properties. We also provide some open questions and new directions for researchers. Keywords: quantum finite automata, probabilistic finite automata, nondeterminism, bounded error, unbounded error, state complexity, decidability and undecidability, computational complexity
Cite
@article{arxiv.1507.01988,
title = {Automata and Quantum Computing},
author = {Andris Ambainis and Abuzer Yakaryılmaz},
journal= {arXiv preprint arXiv:1507.01988},
year = {2018}
}
Comments
33 pages. A revised and updated version (June 2018). To appear in Automata: From Mathematics to Applications edited by Jean-\'Eric Pin