Quantum computers promise dramatic advantages in processing speed over currently
available computer systems. Quantum computing offers great promise in a wide variety of …

Selinger gave a superoperator model of a first-order quantum programming language and
proved that it is fully definable and hence fully abstract. This paper proposes an extension of …

We construct a computationally universal quantum programming language Quantum Π from
two copies of Π, the internal language of rig groupoids. The first step constructs a pure …

This paper introduces a novel abstraction for programming quantum operations, specifically
projective Cliffords, as functions over the qudit Pauli group. We define a categorical …

In this paper, we study quantitative properties of quantum programs. Properties of interest
include (positive) almost-sure termination, expected runtime or expected cost, that is, for …

Free categorical constructions characterise quantum computing as the combination of two
copies of a reversible classical model, glued by the complementarity equations of classical …

This thesis revolves around an area of computer science called" semantics". We work with
operational semantics, equational theories, and denotational semantics. The first …

Guarded recursion is a framework allowing for a formalisation of streams in classical
programming languages. The latter take their semantics in cartesian closed categories …

Monads prove to be useful mathematical tools in theoretical computer science, notably in
denoting different effects of programming languages. In this paper, we investigate a type of …

This paper unites two research lines. The first involves finding categorical models of
quantum programming languages and their type systems. The second line concerns the …