Paper Info
Title
Coalgebraic walks, in quantum and turing computation
Abstract
The paper investigates non-deterministic, probabilistic and quantum walks, from the perspective of coalgebras and monads. Nondeterministic and probabilistic walks are coalgebras of a monad (powerset and distribution), in an obvious manner. It is shown that also quantum walks are coalgebras of a new monad, involving additional control structure. This new monad is also used to describe Turing machines coalgebraically, namely as controlled 'walks' on a tape.
Year
DOI
Venue
2011
10.1007/978-3-642-19805-2_2
FoSSaCS
Keywords
Field
DocType
obvious manner,quantum walk,turing machines coalgebraically,probabilistic walk,new monad,additional control structure,turing computation,turing machine,control structure
Discrete mathematics,Quantum Turing machine,Probabilistic Turing machine,Nondeterministic algorithm,Algebra,Computer science,Algorithm,Quantum walk,Turing machine,Turing,Probabilistic logic,Monad (functional programming)
Conference
Volume
ISSN
Citations 
6604
0302-9743
4
PageRank 
References 
Authors
0.60
6
1
Name
Order
Citations
PageRank
B. Jacobs11046100.09