Sciweavers

19 search results - page 1 / 4
» Two-way finite automata with quantum and classical states
Sort
View
CORR
2007
Springer
100views Education» more  CORR 2007»
13 years 4 months ago
Interference Automata
We propose a computing model, the Two-Way Optical Interference Automata (2OIA), that makes use of the phenomenon of optical interference. We introduce this model to investigate th...
M. V. Panduranga Rao
CORR
1999
Springer
66views Education» more  CORR 1999»
13 years 4 months ago
Two-way finite automata with quantum and classical states
Andris Ambainis, John Watrous
FOCS
1997
IEEE
13 years 9 months ago
On the Power of Quantum Finite State Automata
In this paper, we introduce 1-way and 2-way quantum nite state automata (1qfa's and 2qfa's), which are the quantum analogues of deterministic, nondeterministic and proba...
Attila Kondacs, John Watrous
COCOON
2006
Springer
13 years 8 months ago
Varieties Generated by Certain Models of Reversible Finite Automata
Reversible finite automata with halting states (RFA) were first considered by Ambainis and Freivalds to facilitate the research of KondacsWatrous quantum finite automata. In this ...
Marats Golovkins, Jean-Eric Pin
CORR
2011
Springer
193views Education» more  CORR 2011»
12 years 12 months ago
Advice Coins for Classical and Quantum Computation
We study the power of classical and quantum algorithms equipped with nonuniform advice, in the form of a coin whose bias encodes useful information. This question takes on particu...
Scott Aaronson, Andrew Drucker