Coalgebraic Walks, in Quantum and Turing Computation

Coalgebraic Walks, in Quantum and Turing Computation (2010)

by Bart Jacobs

Datum	Value	Source
TITLE	Coalgebraic Walks, in Quantum and Turing Computation	SVM HeaderParse 0.2
AUTHOR NAME	Bart Jacobs	SVM HeaderParse 0.2
AUTHOR AFFIL	Institute for Computing and Information Sciences (iCIS),	SVM HeaderParse 0.2
AUTHOR ADDR	Radboud University Nijmegen, The Netherlands.	SVM HeaderParse 0.2
ABSTRACT	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. 1	SVM HeaderParse 0.2
YEAR	2010	SVM HeaderParse 0.2
CITATIONS	8 found	ParsCit 1.0