# Mathys RennelaLeiden University | LEI · Quantum group

Mathys Rennela

PhD

## About

16

Publications

1,039

Reads

**How we measure 'reads'**

A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more

141

Citations

Introduction

Additional affiliations

January 2018 - present

March 2013 - September 2017

## Publications

Publications (16)

Reversible computing is a computational paradigm in which computations are deterministic in both the forward and backward direction, so that programs have well-defined forward and backward semantics. We investigate the formal semantics of the reversible functional programming language Rfun. For this purpose, we introduce join inverse rig categories...

Inductive datatypes in programming languages allow users to define useful data structures such as natural numbers, lists, trees, and others. In this paper we show how inductive datatypes may be added to the quantum programming language QPL. We construct a sound categorical model for the language and by doing so we provide the first detailed semanti...

Inductive datatypes in programming languages allow users to define useful data structures such as natural numbers, lists, trees, and others. In this paper we show how inductive datatypes may be added to the quantum programming language QPL. We construct a sound categorical model for the language and by doing so we provide the first detailed semanti...

The organizing framework of this thesis is category theory, which allows for compositional thinking in terms of mathematical objects and structure-preserving arrows between them. This thesis has been organised around two themes. The first theme is the use of operator
algebras in the categorical study of quantum foundations. The second theme focuses...

We describe categorical models of a circuit-based (quantum) functional programming language. We show that enriched categories play a crucial role. Following earlier work on QWire by Paykin et al., we consider both a simple first-order linear language for circuits, and a more powerful host language, such that the circuit language is embedded inside...

We describe categorical models of a circuit-based (quantum) functional
programming language. We show that enriched categories play a crucial role.
Following earlier work on QWire by Paykin et al., we consider both a simple
first-order linear language for circuits, and a more powerful host language,
such that the circuit language is embedded inside...

In this paper, W*-algebras are presented as canonical colimits of diagrams of matrix algebras and completely positive maps. In other words, matrix algebras are dense in W*-algebras.

We describe categorical models of a circuit-based (quantum) functional programming language. We show that enriched categories play a crucial role. Following earlier work on QWire by Paykin et al., we consider both a simple first-order linear language for circuits, and a more powerful host language, such that the circuit language is embedded inside...

Kegelspitzen are mathematical structures coined by Keimel and Plotkin, in
order to encompass the structure of a convex set and the structure of a dcpo.
In this paper, we ask ourselves what are Kegelspitzen the model of. We adopt a
categorical viewpoint and show that Kegelspitzen model stochastic matrices onto
a category of domains. Consequently, Ke...

In two-party quantum communication complexity, Alice and Bob receive some classical inputs and wish to compute some function that depends on both these inputs, while minimizing the communication. This model has found numerous applications in many areas of computer science. One notion that has received a lot of attention recently is the information...

We propose a new 'quantum domain theory' in which Scott-continuous functions are replaced by Scott-continuous natural transformations.

We discuss how the theory of operator algebras, also called operator theory, can be applied in quantum computer science. From a computer scientist point of view, we explain some fundamental results of operator theory and their relevance in the context of domain theory. In particular, we consider the category W* of W*-algebras together with normal s...

In two-party quantum communication complexity, Alice and Bob receive some
classical inputs and wish to compute some function that depends on both these
inputs, while minimizing the communication. This model has found numerous
applications in many areas of computer science. One question that has received
a lot of attention recently is whether it is...

In this master thesis, I discuss how the theory of operator algebras, also
called operator theory, can be applied in quantum computer science.