Computer Science – Computational Complexity
Scientific paper
2011-02-15
Computer Science
Computational Complexity
A revised edition with some corrections
Scientific paper
In automata theory, the quantum computation has been widely examined for finite state machines, known as quantum finite automata (QFAs), and less attention has been given to the QFAs augmented with counters or stacks. Moreover, to our knowledge, there is no result related to QFAs having more than one input head. In this paper, we focus on such generalizations of QFAs whose input head(s) operate(s) in one-way or realtime mode and present many superiority of them to their classical counterparts. Furthermore, we propose some open problems and conjectures in order to investigate the power of quantumness better. We also give some new results on classical computation.
No associations
LandOfFree
Superiority of one-way and realtime quantum machines and new directions 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 Superiority of one-way and realtime quantum machines and new directions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Superiority of one-way and realtime quantum machines and new directions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-378570