Coalgebraic walks, in quantum and turing computation

Authors:
Bart Jacobs
Affiliations:
Institute for Computing and Information Sciences, Radboud University Nijmegen, The Netherlands
Venue:
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Year:
2011

Citing 5
Cited 1

Monad transformers and modular interpreters

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Universal coalgebra: a theory of systems

Theoretical Computer Science - Modern algebra and its applications
A hierarchy of probabilistic system types

Theoretical Computer Science - Selected papers of CMCS'03
Quantum Walks for Computer Scientists

Quantum Walks for Computer Scientists
Testing semantics: connecting processes and process logics

AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology

Quantum walks: a comprehensive review

Quantum Information Processing

Quantified Score

Hi-index	0.00

Visualization

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.