2014/08/01 by Frank Roumen
Computer Science · Mathematics · #cs.LO #math.CT
paper · pdf · doi:10.4204/eptcs.158.3
published as EPTCS 158, 2014, pp. 29-38 · In Proceedings QPL 2012, arXiv:1407.8427
arxiv created 2014/08/01 · arxiv updated 2014/08/04
Coalgebras generalize various kinds of dynamical systems occuring in mathematics and computer science. Examples of systems that can be modeled as coalgebras include automata and Markov chains. We will present a coalgebraic representation of systems occuring in the field of quantum computation, using convex sets of density matrices as state spaces. This will allow us to derive a method to convert quantum mechanical systems into simpler probabilistic systems with the same probabilistic behaviour.