Probabilistic Reversible Automata and Quantum Automata
<|reference_start|>Probabilistic Reversible Automata and Quantum Automata: 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.<|reference_end|>
@article{golovkins2002probabilistic,
    title={Probabilistic Reversible Automata and Quantum Automata},
    author={Marats Golovkins and Maksim Kravtsev},
    journal={Lecture Notes in Computer Science, 2002, Vol. 2387, pp. 574-583},
    year={2002},
    archivePrefix={arXiv},
    eprint={cs/0209018},
    primaryClass={cs.CC cs.FL quant-ph}
}