Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1501.01020 · Electronic Proceedings in Theoretical Computer Science

Quantum Programs as Kleisli Maps

Abraham Westerbaan

Published Jan 1, 2017• 17 citations
arXivHTMLPDF

Abstract

Furber and Jacobs have shown in their study of quantum computation that the category of commutative C*-algebras and PU-maps (positive linear maps which preserve the unit) is isomorphic to the Kleisli category of a comonad on the category of commutative C*-algebras with MIU-maps (linear maps which preserve multiplication, involution and unit). [Furber and Jacobs, 2013] In this paper, we prove a non-commutative variant of this result: the category of C*-algebras and PU-maps is isomorphic to the Kleisli category of a comonad on the subcategory of MIU-maps. A variation on this result has been used to construct a model of Selinger and Valiron's quantum lambda calculus using von Neumann algebras. [Cho and Westerbaan, 2016]

DOI
10.4204/eptcs.236.14

Related papers

Quantum Programs as Kleisli Maps

Bram Westerbaan

Abstract. In computer science the Kleisli category is often used to model computation with a twist such as nondeterminism or probabilism. Recently, Furber and Jacobs have shown in their study of quantum compu-

•Dec 19, 2014•1 citation

Quantum Coherence Spaces Revisited: A von Neumann (Co)Algebraic Approach

Thea Li, Vladimir Zamdzhiev

We describe a categorical model of MALL (Multiplicative Additive Linear Logic) inspired by the Heisenberg-Schrödinger duality of finite-dimensional quantum theory. Proofs of formulas with positive logical polarity correspond to CPTP (completely positive trace-preserving) maps in our model, i.e. the quantum operations in the Schrödinger picture, whereas proofs of formulas with negative logical polarity correspond to CPU (completely positive unital) maps, i.e. the quantum operations in the Heisenberg picture. The mathematical development is based on noncommutative geometry and finite-dimensional von Neumann (co)algebras, which can be defined as special kinds of (co)monoid objects internal to the category of finite-dimensional operator spaces.

math.CTCross-listedarXiv:2601.15832•Jan 23, 2026

Logical aspects of probability and quantum computation

Zapata Fonseca, Octavio Baltasar

Most of the work presented in this document can be read as a sequel to previous work of the author and collaborators, which has been published and appears in [DSZ16, DSZ17, ABdSZ17]. In [ABdSZ17], the mathematical description of quantum homomorphisms of graphs and more generally of relational structures, using the language of category theory is given. In particular, we introduced the concept of ‘quantum’ monad. In this thesis we show that the quantum monad fits nicely into the categorical framework of effectus theory, developed by Jacobs et al. [Jac15, CJWW15]. Effectus theory is an emergent field in categorical logic aiming to describe logic and probability, from the point of view of classical and quantum computation. The main contribution in the first part of this document prove that the Kleisli category of the quantum monad on relational structures is an effectus. The second part is rather different. There, distinct facets of the equivalence relation on graphs called cospectrality are described: algebraic, combinatorial and logical relations are presented as sufficient conditions on graphs for having the same spectrum (i.e. being ‘cospectral’). Other equivalence of graphs (called fractional isomorphism) is also related using some ‘game’ comonads from Abramsky et al. [ADW17, Sha17, AS18]. We also describe a sufficient condition for a pair of graphs to be cospectral using the quantum monad: two Kleisli morphisms (going in opposite directions) between them satisfying certain compatibility requirement.

•Jan 1, 2019•1 citation

On a Fully Abstract Model for a Quantum Linear Functional Language

Peter Selinger, Benoît Valiron

This paper studies the linear fragment of the programing language for quantum computation with classical control described in [Selinger, P. and B. Valiron, A lambda calculus for quantum computation with classical control, in: P. Urzyczyn, editor, Proceedings of the Seventh International Conference on Typed Lambda Calculi and Applications (TLCA 2005), Lecture Notes in Computer Science 3461 (2005), pp. 354–368]. We sketch the language, and discuss equivalence of terms. We also describe a fully abstract denotational semantics based on completely positive maps.

Electronic Notes in Theoretical Computer Science•Jul 1, 2008•52 citations

Composing Quantum Instruments

Robert I. Booth, Dominik Leichtle, Alex Rice +1 more

We study the composition of classically-controlled quantum instruments--the natural quantum analogue of Markov kernels. Classically, Markov kernels compose by integrating one kernel against another. Defining this composition for quantum instruments with continuous outcomes requires an integral of quantum channel-valued functions with respect to a quantum instrument. We construct this integral in the Heisenberg picture using the Okamura-Ozawa normal extension to a von Neumann tensor product. This integral recovers the expected finite formula, preserves normal complete positivity and subunitality, and provides the multiplication for a monad governing the composition of quantum instruments. As an immediate consequence, we identify the category of quantum Markov kernels as the Kleisli category of this monad.

quant-pharXiv:2606.28291•Jun 29, 2026•2 citations

Categorical models of computation: Partially traced categories and presheaf models of quantum computation

Octavio Malherbe

This dissertation has two main parts. The first part deals with questions relating to Haghverdi and Scott's notion of partially traced categories. The main result is a representation theorem for such categories: we prove that every partially traced category can be faithfully embedded in a totally traced category. Also conversely, every monoidal subcategory of a totally traced category is partially traced, so this characterizes the partially traced categories completely. The main technique we use is based on Freyd's paracategories, along with a partial version of Joyal, Street, and Verity's Int construction. Along the way, we discuss some new examples of partially traced categories, mostly arising in the context of quantum computation. The second part deals with the construction of categorical models of higher-order quantum computation. We construct a concrete semantic model of Selinger and Valiron's quantum lambda calculus, which has been an open problem until now. We do this by considering presheaf categories over appropriate base categories arising from first-order quantum computation. The main technical ingredients are Day's convolution theory and Kelly and Freyd's notion of continuity of functors. We first give an abstract description of the properties required of the base categories for the model construction to work; then exhibit a specific example of base categories satisfying these properties.

arXiv:1301.5087•Jan 1, 2010•18 citations
Furber and Jacobs have shown in their study of quantum computation that the category of commutative C*-algebras and PU-maps (positive linear maps which preserve the unit) is isomorphic to the Kleisli category of a comonad on the category of commutative C*-algebras with MIU-maps (linear maps which preserve multiplication, involution and unit). [Furber and Jacobs, 2013] In this paper, we prove a non-commutative variant of this result: the category of C*-algebras and PU-maps is isomorphic to the Kleisli category of a comonad on the subcategory of MIU-maps. A variation on this result has been used to construct a model of Selinger and Valiron's quantum lambda calculus using von Neumann algebras. [Cho and Westerbaan, 2016]
We describe a categorical model of MALL (Multiplicative Additive Linear Logic) inspired by the Heisenberg-Schrödinger duality of finite-dimensional quantum theory. Proofs of formulas with positive logical polarity correspond to CPTP (completely positive trace-preserving) maps in our model, i.e. the quantum operations in the Schrödinger picture, whereas proofs of formulas with negative logical polarity correspond to CPU (completely positive unital) maps, i.e. the quantum operations in the Heisenberg picture. The mathematical development is based on noncommutative geometry and finite-dimensional von Neumann (co)algebras, which can be defined as special kinds of (co)monoid objects internal to the category of finite-dimensional operator spaces.
Most of the work presented in this document can be read as a sequel to previous work of the author and collaborators, which has been published and appears in [DSZ16, DSZ17, ABdSZ17]. In [ABdSZ17], the mathematical description of quantum homomorphisms of graphs and more generally of relational structures, using the language of category theory is given. In particular, we introduced the concept of ‘quantum’ monad. In this thesis we show that the quantum monad fits nicely into the categorical framework of effectus theory, developed by Jacobs et al. [Jac15, CJWW15]. Effectus theory is an emergent field in categorical logic aiming to describe logic and probability, from the point of view of classical and quantum computation. The main contribution in the first part of this document prove that the Kleisli category of the quantum monad on relational structures is an effectus. The second part is rather different. There, distinct facets of the equivalence relation on graphs called cospectrality are described: algebraic, combinatorial and logical relations are presented as sufficient conditions on graphs for having the same spectrum (i.e. being ‘cospectral’). Other equivalence of graphs (called fractional isomorphism) is also related using some ‘game’ comonads from Abramsky et al. [ADW17, Sha17, AS18]. We also describe a sufficient condition for a pair of graphs to be cospectral using the quantum monad: two Kleisli morphisms (going in opposite directions) between them satisfying certain compatibility requirement.
This paper studies the linear fragment of the programing language for quantum computation with classical control described in [Selinger, P. and B. Valiron, A lambda calculus for quantum computation with classical control, in: P. Urzyczyn, editor, Proceedings of the Seventh International Conference on Typed Lambda Calculi and Applications (TLCA 2005), Lecture Notes in Computer Science 3461 (2005), pp. 354–368]. We sketch the language, and discuss equivalence of terms. We also describe a fully abstract denotational semantics based on completely positive maps.
We study the composition of classically-controlled quantum instruments--the natural quantum analogue of Markov kernels. Classically, Markov kernels compose by integrating one kernel against another. Defining this composition for quantum instruments with continuous outcomes requires an integral of quantum channel-valued functions with respect to a quantum instrument. We construct this integral in the Heisenberg picture using the Okamura-Ozawa normal extension to a von Neumann tensor product. This integral recovers the expected finite formula, preserves normal complete positivity and subunitality, and provides the multiplication for a monad governing the composition of quantum instruments. As an immediate consequence, we identify the category of quantum Markov kernels as the Kleisli category of this monad.
This dissertation has two main parts. The first part deals with questions relating to Haghverdi and Scott's notion of partially traced categories. The main result is a representation theorem for such categories: we prove that every partially traced category can be faithfully embedded in a totally traced category. Also conversely, every monoidal subcategory of a totally traced category is partially traced, so this characterizes the partially traced categories completely. The main technique we use is based on Freyd's paracategories, along with a partial version of Joyal, Street, and Verity's Int construction. Along the way, we discuss some new examples of partially traced categories, mostly arising in the context of quantum computation. The second part deals with the construction of categorical models of higher-order quantum computation. We construct a concrete semantic model of Selinger and Valiron's quantum lambda calculus, which has been an open problem until now. We do this by considering presheaf categories over appropriate base categories arising from first-order quantum computation. The main technical ingredients are Day's convolution theory and Kelly and Freyd's notion of continuity of functors. We first give an abstract description of the properties required of the base categories for the model construction to work; then exhibit a specific example of base categories satisfying these properties.