The Adjoint School 2019
The 2019 Adjoint School featured projects mentored by Miriam Backens, Tobias Fritz, Pieter Hofstra, Bartosz Milewski, Mehrnoosh Sadrzadeh, and David Spivak. It was organised by Daniel Cicala and Jules Hedges. The research week was held at Oxford in July 2019.
Simplifying quantum circuits using the ZX-calculus
Mentor: Miriam Backens
TA: Hector Bakewell
Students: Fatimah Ahmadi, Giovanni de Felice, Leo Lobski, John van de Wetering
The ZX-calculus is a graphical calculus based on the category-theoretical formulation of quantum mechanics. A complete set of graphical rewrite rules is known for the ZX-calculus, but not for quantum circuits over any universal gate set. In this project, we aim to develop new strategies for using the ZX-calculus to simplify quantum circuits.
- The ZX-calculus is complete for stabilizer quantum mechanics, Miriam Backens
- A Finite Presentation of CNOT-Dihedral Operators, Matthew Amy, Jianxin Chen, and Neil J. Ross
Partial evaluations, the bar construction, and second-order stochastic dominance
Mentor: Tobias Fritz
TA: Paolo Perrone
Students: Nathan Bedell, Carmen Constantin, Martin Lundfall, Brandon Shapiro
We all know that 2+2+1+1 evaluates to 6. A less familiar notion is that it can *partially evaluate* to 5+1. In this project, we aim to study the compositional structure of partial evaluation in terms of monads and the bar construction and see what this has to do with financial risk via second-order stochastic dominance.
- Monads, partial evaluations, and rewriting, Tobias Fritz, Paolo Perrone
- The monads of classical algebra are seldom weakly cartesian, Maria Manuel Clementino, Dirk Hoffman, George Janelidze
Complexity classes, computation, and Turing categories
Mentor: Pieter Hofstra
TA: Jonathan Gallagher
Students: Georgios Bakirtzis, Adam Ó Conghaile, Diego Roque, Christian Williams
Turing categories form a categorical setting for studying computability without bias towards any particular model of computation. It is not currently clear, however, that Turing categories are useful to study practical aspects of computation such as complexity. This project revolves around the systematic study of step-based computation in the form of stack-machines, the resulting Turing categories, and complexity classes. This will involve a study of the interplay between traced monoidal structure and computation. We will explore the idea of stack machines qua programming languages, investigate the expressive power, and tie this to complexity theory. We will also consider questions such as the following: can we characterize Turing categories arising from stack machines? Is there an initial such category? How does this structure relate to other categorical structures associated with computability?
- Total maps of Turing categories, J.R.B. Cockett, P.J.W. Hofstra, P. Hrubeš
- Introduction to Turing categories , J.R.B. Cockett, P.J.W. Hofstra
Traversal optics and profunctors
Mentor: Bartosz Milewski
TA: Derek Elkins
Students: Bryce Clarke, Fosco Loregian, Emily Pillmore, Mario Roman
In functional programming, optics are ways to zoom into a specific part of a given data type and mutate it. Optics come in many flavors such as lenses and prisms and there is a well-studied categorical viewpoint, known as profunctor optics. Of all the optic types, only the traversal has resisted a derivation from first principles into a profunctor description. This project aims to do just this.
- Doubles for monoidal categories, Craig Pastro, Ross Street
- Profunctor optics: The categorical View, Bartosz Milewski
Formal and experimental methods to reason about dialogue and discourse using categorical models of vector spaces
Mentor: Mehrnoosh Sadrzadeh
TA: Gijs Wijnholds
Students: Adriana Correia, Lachlan McPheat, Dan Shiebler, Alexis Toumi
Distributional semantics argues that meanings of words can be represented by the frequency of their co-occurrences in context. A model extending distributional semantics from words to sentences has a categorical interpretation via Lambek’s syntactic calculus or pregroups. In this project, we intend to further extend this model to reason about dialogue and discourse utterances where people interrupt each other, there are references that need to be resolved, disfluencies, pauses, and corrections. Additionally, we would like to design experiments and run toy models to verify predictions of the developed models.
- Grammars as Parsers: Meeting the Dialogue Challenge , Matthew Purver, Ronnie Cann, Ruth Kempson.
- A multi-modal analysis of anaphora and ellipsis, Gerhard Jager
Toward a mathematical foundation for autopoiesis
Mentor: David Spivak
TA: Brendan Fong
Students: Bruno Gavranović, Sophie Libkind, David Jaz Myers, Toby Smithe
An autopoietic organization—anything from a living animal to a political party to a football team—is a system that is responsible for adapting and changing itself, so as to persist as events unfold. We want to develop mathematical abstractions that are suitable to found a scientific study of autopoietic organizations. To do this, we’ll begin by using behavioral mereology and graphical logic to frame a discussion of autopoeisis, most of all what it is and how it can be best conceived. We do not expect to complete this ambitious objective; we hope only to make progress toward it.
- Behavioral Mereology (Proofs and Properties) , Brendan Fong, David Jaz Myers, David I. Spivak
- Graphical Regular Logic , Brendan Fong, David I Spivak