Probabilistic Reversible Automata and Quantum Automata
Computational Complexity
2011-06-14 v2 Formal Languages and Automata Theory
Quantum Physics
Abstract
To study relationship between quantum finite automata and probabilistic finite automata, we introduce a notion of probabilistic reversible automata (PRA, or doubly stochastic automata). We find that there is a strong relationship between different possible models of PRA and corresponding models of quantum finite automata. We also propose a classification of reversible finite 1-way automata.
Keywords
Cite
@article{arxiv.cs/0209018,
title = {Probabilistic Reversible Automata and Quantum Automata},
author = {Marats Golovkins and Maksim Kravtsev},
journal= {arXiv preprint arXiv:cs/0209018},
year = {2011}
}
Comments
COCOON 2002, extended version of the paper, 22 pages