Probabilistic Reversible Automata and Quantum Automata
Marats Golovkins, Maksim Kravtsev
TL;DR
This paper explores the relationship between probabilistic reversible automata and quantum automata, introducing PRA models and classifying reversible finite automata to understand their connections.
Contribution
It introduces probabilistic reversible automata models and establishes their strong relationship with quantum finite automata, along with a classification of reversible automata.
Findings
Strong relationship between PRA and quantum automata models
Introduction of probabilistic reversible automata (PRA) models
Classification scheme for reversible finite automata
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Machine Learning and Algorithms · semigroups and automata theory