Sciweavers

10 search results - page 1 / 2
» Dense quantum coding and quantum finite automata
Sort
View
JACM
2002
54views more  JACM 2002»
13 years 8 months ago
Dense quantum coding and quantum finite automata
Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umes...
FOCS
1997
IEEE
14 years 23 days 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
14 years 8 days 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
FUIN
2008
107views more  FUIN 2008»
13 years 8 months ago
Modelling and Simulation of Quantum Teleportation and Dense Coding Using Predicate/Transition-Nets
Reachability analysis is one of the most successful methods used in design and validation of protocols for classical communication, whereas the predicate/transition-net formalism i...
Kimmo Varpaaniemi, Leo Ojala
CORR
1999
Springer
66views Education» more  CORR 1999»
13 years 8 months ago
Two-way finite automata with quantum and classical states
Andris Ambainis, John Watrous