Abstract
The paper investigates non-deterministic, probabilistic and quantum walks, from the perspective of coalgebras and monads. Non-deterministic 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. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Jacobs, B. (2011). Coalgebraic walks, in quantum and turing computation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6604 LNCS, pp. 12–26). https://doi.org/10.1007/978-3-642-19805-2_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
