Paper Info
Title
Superiority of one-way and realtime quantum machines and new directions (extended abstract)
Abstract
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 even no result on 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 many open problems and conjectures in order to investigate the power of quantumness better. We also give some new results about classical computation.
Year
Venue
Keywords
2011
Clinical Orthopaedics and Related Research
finite automata,quantum computer,finite state machine,automata theory
Field
DocType
Volume
Quantum finite automata,Quantum Turing machine,Two-way deterministic finite automaton,Automata theory,Algorithm,Quantum dot cellular automaton,Quantum algorithm,Computer engineering,Mathematics,Quantum cellular automaton,Abstract machine
Journal
abs/1102.3
Citations 
PageRank 
References 
0
0.34
0
Authors
1
Name
Order
Citations
PageRank
Abuzer Yakaryilmaz116825.31