Coalgebraic Quantum Computation

Frank Roumen
(Radboud University Nijmegen)

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.

In Ross Duncan and Prakash Panangaden: Proceedings 9th Workshop on Quantum Physics and Logic (QPL 2012), Brussels, Belgium, 10-12 October 2012, Electronic Proceedings in Theoretical Computer Science 158, pp. 29–38.
Published: 29th July 2014.

ArXived at: http://dx.doi.org/10.4204/EPTCS.158.3 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org