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:1505.04330 · Electronic Notes in Theoretical Computer Science

Reversible Monadic Computing

Chris Heunen, Martti Karvonen

Published Dec 1, 2015• 14 citations
arXivHTMLPDF

Abstract

We extend categorical semantics of monadic programming to reversible computing, by considering monoidal closed dagger categories: the dagger gives reversibility, whereas closure gives higher-order expressivity. We demonstrate that Frobenius monads model the appropriate notion of coherence between the dagger and closure by reinforcing Cayley's theorem; by proving that effectful computations (Kleisli morphisms) are reversible precisely when the monad is Frobenius; by characterizing the largest reversible subcategory of Eilenberg–Moore algebras; and by identifying the latter algebras as measurements in our leading example of quantum computing. Strong Frobenius monads are characterized internally by Frobenius monoids.

DOI
10.1016/j.entcs.2015.12.014

Related papers

Frobenius Structures

Chris Heunen, Jamie Vicary

Abstract A Frobenius structure is a monoid together with a comonoid, which satisfies an interaction law. Frobenius structures have a powerful graphical calculus and we prove a normal form theorem that makes them easy to work with. The Frobenius law itself is justified as a coherence property between daggers and closure of a category. We prove classification theorems for dagger Frobenius structures: in Hilb in terms of operator algebras and in Rel in terms of groupoids. Of special interest is the commutative case—as for Hilbert spaces this corresponds to a choice of basis—and provides a powerful tool to model classical information. We discuss phase gates and the state transfer protocol—as well as modules for Frobenius structures—and show how we can use these to model measurement, controlled operations and quantum teleportation.

Oxford University Press eBooks•Nov 19, 2019•0 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

Effectuses from Monads

Bart Jacobs

Effectuses have recently been introduced as categorical models for quantum computation, with probabilistic and Boolean (classical) computation as special cases. These 'probabilistic' models are called commutative effectuses. All known examples of such commutative effectuses are Kleisli categories of a monad. This paper answers the open question what properties a monad should satisfy so that its Kleisli category is a (commutative) effectus. The relevant properties are: strong affineness and partial additivity, together with some non-triviality conditions.

Electronic Notes in Theoretical Computer Science•Oct 1, 2016•6 citations

The quantum instrument monad

Tobias Fritz

Monads are a ubiquitous structure in functional programming used for modelling computational effects. For example, the state monad models the effect of a computation interacting with a memory system. Here we introduce the quantum instrument monad $\mathcal{I}_\mathcal{A}$, which models the effect of a computation interacting with a quantum system with algebra of observables $\mathcal{A}$. It can be thought of as a noncommutative generalization of the state monad. We construct this quantum instrument monad in two versions: a finitary version on the category of sets and a measure-theoretic version on the category of measurable spaces (the latter under the assumption that $\mathcal{A}$ is a type I von Neumann algebra with separable predual). Both versions are strong monads. The construction of the measure-theoretic version is based on a new notion of integral of a quantum-operation-valued function against a state-valued measure.

cs.LOCross-listedarXiv:2606.27805•Jun 29, 2026•2 citations

Quantum Turing automata

Miklós Bartha

A denotational semantics of quantum Turing machines having a quantum control is defined in the dagger compact closed category of finite dimensional Hilbert spaces. Using the Moore-Penrose generalized inverse, a new additive trace is introduced on the restriction of this category to isometries, which trace is carried over to directed quantum Turing machines as monoidal automata. The Joyal-Street-Verity Int construction is then used to extend this structure to a reversible bidirectional one.

arXiv:1404.0074•Electronic Proceedings in Theoretical Computer Science•Mar 29, 2014•6 citations

H*-algebras and nonunital Frobenius algebras: first steps in infinite-dimensional categorical quantum mechanics

Samson Abramsky, Chris Heunen

A certain class of Frobenius algebras has been used to characterize orthonormal bases and observables on finite-dimensional Hilbert spaces. The presence of units in these algebras means that they can only be realized finite-dimensionally. We seek a suitable generalization, which will allow arbitrary bases and observables to be described within categorical axiomatizations of quantum mechanics. We develop a definition of H*-algebra that can be interpreted in any symmetric monoidal dagger category, reduces to the classical notion from functional analysis in the category of (possibly infinite-dimensional) Hilbert spaces, and hence provides a categorical way to speak about orthonormal bases and quantum observables in arbitrary dimension. Moreover, these algebras reduce to the usual notion of Frobenius algebra in compact categories. We then investigate the relations between nonunital Frobenius algebras and H*-algebras. We give a number of equivalent conditions to characterize when they coincide in the category of Hilbert spaces. We also show that they always coincide in categories of generalized relations and positive matrices.

arXiv:1011.6123•Nov 29, 2010•35 citations
We extend categorical semantics of monadic programming to reversible computing, by considering monoidal closed dagger categories: the dagger gives reversibility, whereas closure gives higher-order expressivity. We demonstrate that Frobenius monads model the appropriate notion of coherence between the dagger and closure by reinforcing Cayley's theorem; by proving that effectful computations (Kleisli morphisms) are reversible precisely when the monad is Frobenius; by characterizing the largest reversible subcategory of Eilenberg–Moore algebras; and by identifying the latter algebras as measurements in our leading example of quantum computing. Strong Frobenius monads are characterized internally by Frobenius monoids.
Abstract A Frobenius structure is a monoid together with a comonoid, which satisfies an interaction law. Frobenius structures have a powerful graphical calculus and we prove a normal form theorem that makes them easy to work with. The Frobenius law itself is justified as a coherence property between daggers and closure of a category. We prove classification theorems for dagger Frobenius structures: in Hilb in terms of operator algebras and in Rel in terms of groupoids. Of special interest is the commutative case—as for Hilbert spaces this corresponds to a choice of basis—and provides a powerful tool to model classical information. We discuss phase gates and the state transfer protocol—as well as modules for Frobenius structures—and show how we can use these to model measurement, controlled operations and quantum teleportation.
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.
Effectuses have recently been introduced as categorical models for quantum computation, with probabilistic and Boolean (classical) computation as special cases. These 'probabilistic' models are called commutative effectuses. All known examples of such commutative effectuses are Kleisli categories of a monad. This paper answers the open question what properties a monad should satisfy so that its Kleisli category is a (commutative) effectus. The relevant properties are: strong affineness and partial additivity, together with some non-triviality conditions.
Monads are a ubiquitous structure in functional programming used for modelling computational effects. For example, the state monad models the effect of a computation interacting with a memory system. Here we introduce the quantum instrument monad IA\mathcal{I}_\mathcal{A}IA​, which models the effect of a computation interacting with a quantum system with algebra of observables A\mathcal{A}A. It can be thought of as a noncommutative generalization of the state monad. We construct this quantum instrument monad in two versions: a finitary version on the category of sets and a measure-theoretic version on the category of measurable spaces (the latter under the assumption that A\mathcal{A}A is a type I von Neumann algebra with separable predual). Both versions are strong monads. The construction of the measure-theoretic version is based on a new notion of integral of a quantum-operation-valued function against a state-valued measure.
A certain class of Frobenius algebras has been used to characterize orthonormal bases and observables on finite-dimensional Hilbert spaces. The presence of units in these algebras means that they can only be realized finite-dimensionally. We seek a suitable generalization, which will allow arbitrary bases and observables to be described within categorical axiomatizations of quantum mechanics. We develop a definition of H*-algebra that can be interpreted in any symmetric monoidal dagger category, reduces to the classical notion from functional analysis in the category of (possibly infinite-dimensional) Hilbert spaces, and hence provides a categorical way to speak about orthonormal bases and quantum observables in arbitrary dimension. Moreover, these algebras reduce to the usual notion of Frobenius algebra in compact categories. We then investigate the relations between nonunital Frobenius algebras and H*-algebras. We give a number of equivalent conditions to characterize when they coincide in the category of Hilbert spaces. We also show that they always coincide in categories of generalized relations and positive matrices.