Probabilistic Reversible Automata and Quantum Automata

Computer Science – Computational Complexity

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

COCOON 2002, extended version of the paper, 22 pages

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Probabilistic Reversible Automata and Quantum Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Probabilistic Reversible Automata and Quantum Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Probabilistic Reversible Automata and Quantum Automata will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-291735

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.