
Aleks KissingerUniversity of Oxford | OX · Department of Computer Science
Aleks Kissinger
About
84
Publications
6,560
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
1,816
Citations
Publications
Publications (84)
The ZX calculus is a graphical language for representing and rewriting quantum circuits. While its graphical rewrite rules preserve semantics, they may not preserve other features. For example, applying rewrites to a circuit that implements an error-correcting code can change its distance. Here, we define the notion of distance-preserving rewrites...
Central to near-term quantum machine learning is the use of hybrid quantum-classical algorithms. This paper develops a formal framework for describing these algorithms in terms of string diagrams: a key step towards integrating these hybrid algorithms into existing work using string diagrams for machine learning and differentiable programming. A no...
Recent years have seen great interest in extending causal inference concepts developed in the context of classical statistical models to quantum theory. So far, this program has only barely addressed causal identification, a type of causal inference problem concerned with recovering from observational data and qualitative assumptions the causal rel...
This document serves as a comprehensive overview of discussions held during the Causal Cognition in Humans and Machines conference, in Oxford, 2024, focusing on the critical importance of understanding causality in various contexts, both artificial and real-world. It explores the applications of causal reasoning, which extend from enhancing reasoni...
Unitary fusion categories formalise the algebraic theory of topological quantum computation. These categories come naturally enriched in a subcategory of the category of Hilbert spaces, and by looking at this subcategory, one can identify a collection of generators for implementing quantum computation. We represent such generators for the Fibonacci...
Quantum theory is often regarded as challenging to learn and teach, with advanced mathematical prerequisites ranging from complex numbers and probability theory to matrix multiplication, vector space algebra and symbolic manipulation within the Hilbert space formalism. It is traditionally considered an advanced undergraduate or graduate-level subje...
In this work, we present a generic approach to transform CSS codes by building upon their equivalence to phase-free ZX diagrams. Using the ZX calculus, we demonstrate diagrammatic transformations between encoding maps associated with different codes. As a motivating example, we give explicit transformations between the Steane code and the quantum R...
In measurement-based quantum computing (MBQC), computation is carried out by a sequence of measurements and corrections on an entangled state. Flow, and related concepts, are powerful techniques for characterising the dependence of the corrections on previous measurement outcomes. We introduce flow-based methods for MBQC with qudit graph states, wh...
Unitary fusion categories formalise the algebraic theory of topological quantum computation. We rectify confusion around a category describing an anyonic theory and a category describing topological quantum computation. We show that the latter is a subcategory of \hilb. We represent elements of the Fibonacci and Ising models, namely the encoding of...
Symmetric monoidal theories (SMTs) generalise algebraic theories in a way that make them suitable to express resource-sensitive systems, in which variables cannot be copied or discarded at will. In SMTs, traditional tree-like terms are replaced by string diagrams , topological entities that can be intuitively thought of as diagrams of wires and box...
We introduce an enhanced technique for strong classical simulation of quantum circuits which combines the `sum-of-stabilisers' method with an automated simplification strategy based on the ZX-calculus. Recently it was shown that quantum circuits can be classically simulated by expressing the non-stabiliser gates in a circuit as magic state injectio...
In this paper, we address the problem of proving confluence for string diagram rewriting, which was previously shown to be characterised combinatorially as double-pushout rewriting with interfaces (DPOI) on (labelled) hypergraphs. For standard DPO rewriting without interfaces, confluence for terminating rewriting systems is, in general, undecidable...
String diagrams are a powerful and intuitive graphical syntax, originating in theoretical physics and later formalised in the context of symmetric monoidal categories. In recent years, they have found application in the modelling of various computational structures, in fields as diverse as Computer Science, Physics, Control Theory, Linguistics, and...
In this paper, we demonstrate a direct correspondence between phase-free ZX diagrams, a graphical notation for representing and manipulating a certain class of linear maps on qubits, and Calderbank-Shor-Steane (CSS) codes, a large family of quantum error correcting codes constructed from classical codes, including for example the Steane code, surfa...
The ZX-calculus is a graphical language for reasoning about quantum computation using ZX-diagrams, a certain flexible generalisation of quantum circuits that can be used to represent linear maps from $m$ to $n$ qubits for any $m,n \geq 0$. Some applications for the ZX-calculus, such as quantum circuit optimisation and synthesis, rely on being able...
Recent developments in classical simulation of quantum circuits make use of clever decompositions of chunks of magic states into sums of efficiently simulable stabiliser states. We show here how, by considering certain non-stabiliser entangled states which have more favourable decompositions, we can speed up these simulations. This is made possible...
Extracting causal relationships from observed correlations is a growing area in probabilistic reasoning, originating with the seminal work of Pearl and others from the early 1990s. This paper develops a new, categorically oriented view based on a clear distinction between syntax (string diagrams) and semantics (stochastic matrices), connected via i...
In measurement-based quantum computing (MBQC), computation is carried out by a sequence of measurements and corrections on an entangled state. Flow, and related concepts, are powerful techniques for characterising the dependence of the corrections on previous measurement outcomes. We introduce flow-based methods for MBQC with qudit graph states, wh...
In this paper we address the problem of proving confluence for string diagram rewriting, which was previously shown to be characterised combinatorically as double-pushout rewriting with interfaces (DPOI) on (labelled) hypergraphs. For standard DPO rewriting without interfaces, confluence for terminating rewrite systems is, in general, undecidable....
We introduce an enhanced technique for strong classical simulation of quantum circuits which combines the `sum-of-stabilisers' method with an automated simplification strategy based on the ZX-calculus. Recently it was shown that quantum circuits can be classically simulated by expressing the non-stabiliser gates in a circuit as magic state injectio...
This paper is a ‘spiritual child’ of the 2005 lecture notes Kindergarten Quantum Mechanics [24], which showed how a simple, pictorial extension of Dirac notation allowed several quantum features to be easily expressed and derived, using language even a kindergartner can understand. Central to that approach was the use of pictures and pictorial tran...
Symplectic vector spaces are the phase space of linear mechanical systems. The symplectic form describes, for example, the relation between position and momentum as well as current and voltage. The category of linear Lagrangian relations between symplectic vector spaces is a symmetric monoidal subcategory of relations which gives a semantics for th...
Symmetric monoidal theories (SMTs) generalise algebraic theories in a way that make them suitable to express resource-sensitive systems, in which variables cannot be copied or discarded at will. In SMTs, traditional tree-like terms are replaced by string diagrams, topological entities that can be intuitively thoughts as diagrams of wires and boxes....
There are various gate sets used for describing quantum computation. A particularly popular one consists of Clifford gates and arbitrary single-qubit phase gates. Computations in this gate set can be elegantly described by the ZX-calculus, a graphical language for a class of string diagrams describing linear maps between qubits. The ZX-calculus has...
This paper is a `spiritual child' of the 2005 lecture notes Kindergarten Quantum Mechanics, which showed how a simple, pictorial extension of Dirac notation allowed several quantum features to be easily expressed and derived, using language even a kindergartner can understand. Central to that approach was the use of pictures and pictorial transform...
String diagrams are a powerful and intuitive graphical syntax, originated in the study of symmetric monoidal categories. In the last few years, they have found application in the modelling of various computational structures, in fields as diverse as Computer Science, Physics, Control Theory, Linguistics, and Biology. In many such proposals, the tra...
We present a method for reducing the number of non-Clifford quantum gates, in particularly T-gates, in a circuit, an important task for efficiently implementing fault-tolerant quantum computations. This method matches or beats previous approaches to ancillae-free T-count reduction on the majority of our benchmark circuits, in some cases yielding up...
We present a completely new approach to quantum circuit optimisation, based on the ZX-calculus. We first interpret quantum circuits as ZX-diagrams, which provide a flexible, lower-level language for describing quantum computations graphically. Then, using the rules of the ZX-calculus, we give a simplification strategy for ZX-diagrams based on the t...
The ZH-calculus is a complete graphical calculus for linear maps between qubits that admits, for example, a straightforward encoding of hypergraph states and circuits arising from the Toffoli+Hadamard gate set. In this paper, we establish a correspondence between the ZH-calculus and the path-sum formalism, a technique recently introduced by Amy to...
We introduce a new family of models for measurement-based quantum computation which are deterministic and approximately universal. The resource states which play the role of graph states are prepared via 2-qubit gates of the form exp(−iπ2nZ⊗Z) . When n=2 , these are equivalent, up to local Clifford unitaries, to graph states. However, when n>2 , t...
The ZX-calculus is a convenient formalism for expressing and reasoning about quantum circuits at a low level, whereas the recently-proposed ZH-calculus yields convenient expressions of mid-level quantum gates such as Toffoli and CCZ. In this paper, we will show that the two calculi are linked by Fourier transform. In particular, we will derive new...
The ZX-calculus is a graphical language for reasoning about ZX-diagrams, a tensor network-like language that can represent arbitrary linear maps between qubits. Using the ZX-calculus, we can intuitively reason about quantum mechanics, and optimise and validate quantum circuits. In this paper we introduce PyZX, an open source library for automated r...
Extracting causal relationships from observed correlations is a growing area in probabilistic reasoning, originating with the seminal work of Pearl and others from the early 1990s. This paper develops a new, categorically oriented view based on a clear distinction between syntax (string diagrams) and semantics (stochastic matrices), connected via i...
Extracting causal relationships from observed correlations is a growing area in probabilistic reasoning, originating with the seminal work of Pearl and others from the early 1990s. This paper develops a new, categorically oriented view based on a clear distinction between syntax (string diagrams) and semantics (stochastic matrices), connected via i...
Reducing the number of non-Clifford quantum gates present in a circuit is an important task for efficiently implementing quantum computations, especially in the fault-tolerant regime. We present a new method for reducing the number of T-gates in a quantum circuit based on the ZX-calculus, which matches or beats previous approaches on many benchmark...
We present a new circuit-to-circuit optimisation routine based on an equational theory called the ZX-calculus. We first interpret quantum circuits as ZX-diagrams, a flexible, lower-level language for describing quantum computations graphically. Then, using the rules of the ZX-calculus, we derive a terminating simplification procedure for ZX-diagram...
We present a new graphical calculus that is sound and complete for a universal family of quantum circuits, which can be seen as the natural string-diagrammatic extension of the approximately (real-valued) universal family of Hadamard+CCZ circuits. The diagrammatic language is generated by two kinds of nodes: the so-called 'spider' associated with t...
Extracting causal relationships from observed correlations is a growing area in probabilistic reasoning, originating with the seminal work of Pearl and others from the early 1990s. This paper develops a new, categorically oriented view based on a clear distinction between syntax (string diagrams) and semantics (stochastic matrices), connected via i...
Symmetric monoidal categories have become ubiquitous as a formal environment for the analysis of compound systems in a compositional, resource-sensitive manner using the graphical syntax of string diagrams. Recently, reasoning with string diagrams has been implemented concretely via double-pushout (DPO) hypergraph rewriting. The hypergraph represen...
We present a new graphical calculus that is sound and complete for a universal family of quantum circuits, which can be seen as the natural string-diagrammatic extension of the approximately (real-valued) universal family of Hadamard+CCZ circuits. The diagrammatic language is generated by two kinds of nodes: the so-called `spider' associated with t...
This volume contains the proceedings of the 14th International Conference on Quantum Physics and Logic (QPL 2017), which was held July 3-7, 2017 at the LUX Cinema Nijmegen, the Netherlands, and was hosted by Radboud University. QPL is a conference that brings together researchers working on mathematical foundations of quantum physics, quantum compu...
In general relativity, `causal structure' refers to the partial order on space-time points (or regions) that encodes time-like relationships. Recently, quantum information and quantum foundations saw the emergence of a `causality principle'. In the form used in this paper, which we call `process terminality', it states that when the output of a pro...
We introduce a new universal, measurement-based model of quantum computation, which is potentially attractive for implementation on ion trap and superconducting qubit devices. It differs from the traditional one-way model in two ways: (1) the resource states which play the role of graph states are prepared via 2-qubit M{\o}lmer-S{\o}rensen interact...
The abelian Hidden Subgroup Problem (HSP) is extremely general, and many problems with known quantum exponential speed-up (such as integers factorisation, the discrete logarithm and Simon's problem) can be seen as specific instances of it. The traditional presentation of the quantum protocol for the abelian HSP is low-level, and relies heavily on t...
We present a categorical construction for modelling both definite and indefinite causal structures within a general class of process theories that include classical probability theory and quantum theory. Unlike prior constructions within categorical quantum mechanics, the objects of this theory encode finegrained causal relationships between subsys...
Following on from the notion of (first-order) causality, which generalises the notion of being tracepreserving from CP-maps to abstract processes, we give a characterization for the most general kind of map which sends causal processes to causal processes. These new, second-order causal processes enable us to treat the input processes as 'local lab...
This article introduces Globular, an online proof assistant for the
formalization and verification of proofs in higher-dimensional category theory.
The tool produces graphical visualizations of higher-dimensional proofs,
assists in their construction with a point-and- click interface, and performs
type checking to prevent incorrect rewrites. Hosted...
This article introduces Globular, an online proof assistant for the formalization and verification of proofs in higher-dimensional category theory. The tool produces graphical visualizations of higher-dimensional proofs, assists in their construction with a point-and- click interface, and performs type checking to prevent incorrect rewrites. Hosted...
This is the second part of a three-part overview, in which we derive the category-theoretic backbone of quantum theory from a process ontology, treating quantum theory as a theory of systems, processes and their interactions. In this part we focus on classical-quantum interaction. Classical and quantum systems are treated as distinct types, of whic...
This is the second part of a three-part overview, in which we derive the category-theoretic backbone of quantum theory from a process ontology, treating quantum theory as a theory of systems, processes and their interactions. In this part we focus on classical-quantum interaction. Classical and quantum systems are treated as distinct types, of whic...
Does information play a significant role in the foundations of physics? We investigate whether information-theoretic constraints characterize quantum theory. In a C*-algebraic framework, this is known to hold via three equivalences: no broadcasting and noncommutativity; no bit commitment and nonlocality; no signalling and kinematic independence. Bu...
We derive the category-theoretic backbone of quantum theory from a process
ontology. More specifically, we treat quantum theory as a theory of systems,
processes and their interactions. Classical and quantum systems are treated as
distinct types, of which the respective behavioural properties are also
specified in terms of processes and their compo...
This chapter provides an introduction to the use of diagrammatic language, or perhaps more accurately, diagrammatic calculus, in quantum information and quantum foundations. We illustrate the use of diagrammatic calculus in one particular case, namely the study of complementarity and non-locality, two fundamental concepts of quantum theory whose re...
We introduce Tinker, a tool for designing and evaluating proof strategies
based on proof-strategy graphs, a formalism previously introduced by the
authors. We represent proof strategies as open-graphs, which are directed
graphs with additional input/output edges. Tactics appear as nodes in a graph,
and can be `piped' together by adding edges betwee...
We introduce the CP*–construction on a dagger compact closed category as a generalisation of Selinger's CPM-construction. While the latter takes a dagger compact closed category and forms its category of "abstract matrix algebras" and completely positive maps, the CP*-construction forms its category of "abstract C*-algebras" and completely positive...
Graphs provide a natural mechanism for visualising many algebraic systems. They are particularly useful for describing algebras in a monoidal category, such as frobenius algebras and bialgebras, which play a vital role in quantum computation. In this context, terms in the algebra are represented as graphs, and algebraic identities as graph rewrite...
The recently introduced CP*-construction unites quantum channels and
classical systems, subsuming the earlier CPM-construction in categorical
quantum mechanics. We compare this construction to two earlier attempts at
solving this problem: freely adding biproducts to CPM, and freely splitting
idempotents in CPM. The CP*-construction embeds the forme...
The primary contribution of this paper is to give a formal, categorical treatment to Penrose's abstract tensor notation, in the context of traced symmetric monoidal categories. To do so, we introduce a typed, sum-free version of an abstract tensor system and demonstrate the construction of its associated category. We then show that the associated c...
We introduce a construction that turns a category of pure state spaces and
operators into a category of observable algebras and superoperators. For
example, it turns the category of finite-dimensional Hilbert spaces into the
category of finite-dimensional C*-algebras and completely positive maps. In
particular, the new category contains both quantu...
Complex automated proof strategies are often difficult to extract, visualise,
modify, and debug. Traditional tactic languages, often based on stack-based
goal propagation, make it easy to write proofs that obscure the flow of goals
between tactics and are fragile to minor changes in input, proof structure or
changes to tactics themselves. Here, we...
Quantum logic aims to capture essential quantum mechanical structure in order-theoretic terms. The Achilles' heel of quantum logic is the absence of a canonical description of composite systems, given descriptions of their components. We introduce a framework in which order-theoretic structure comes with a primitive composition operation. The order...
String diagrams are a powerful tool for reasoning about physical processes,
logic circuits, tensor networks, and many other compositional structures.
Dixon, Duncan and Kissinger introduced string graphs, which are a combinatoric
representations of string diagrams, amenable to automated reasoning about
diagrammatic theories via graph rewrite systems...
Categorical quantum mechanics studies quantum theory in the framework of
dagger-compact closed categories.
Using this framework, we establish a tight relationship between two key
quantum theoretical notions: non-locality and complementarity. In particular,
we establish a direct connection between Mermin-type non-locality scenarios,
which we general...
This work is about diagrammatic languages, how they can be represented, and
what they in turn can be used to represent. More specifically, it focuses on
representations and applications of string diagrams. String diagrams are used
to represent a collection of processes, depicted as "boxes" with multiple
(typed) inputs and outputs, depicted as "wire...
In recent years, diagrammatic languages have been shown to be a powerful and
expressive tool for reasoning about physical, logical, and semantic processes
represented as morphisms in a monoidal category. In particular, categorical
quantum mechanics, or "Quantum Picturalism", aims to turn concrete features of
quantum theory into abstract structural...
Graphical calculi for representing interacting quantum systems serve a number
of purposes: compositionally, intuitive graphical reasoning, and a logical
underpinning for automation. The power of these calculi stems from the fact
that they embody generalized symmetries of the structure of quantum operations,
which, for example, stretch well beyond t...
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of these diagrams is that edges need not be connected to vertices at both ends, and these unconnected ends can be interpreted as the inputs and outputs of a diagram. In this...
We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of half-edges (edges which are drawn with an unconnected end) and enjoy rich compositional principles by connecting grap...
Multipartite quantum states constitute a (if not the) key resource for quantum computations and protocols. However obtaining a generic, structural understanding of entanglement in N-qubit systems is a long-standing open problem in quantum computer science. Here we show that multipartite quantum entanglement admits a compositional structure, and hen...
Graphical languages provide a powerful tool for describing the behaviour of quantum systems. While the use of graphs vastly re- duces the complexity of many calculations (4,10), manual graphical ma- nipulation quickly becomes untenable for large graphs or large numbers of graphs. To combat this issue, we are developing a tool called Quan- tomatic,...
Abstract This paper introduces several related graph rewrite systems derived from known identities on classical structures within a y-symmetric monoidal category. First, we develop a rewrite system based on a single classical structure, and use it to develop a proof of the so-called \spider-theorem," where a connected graph containing a single clas...
Abstract Providing a generic description of entanglement in n-qubit systems is a long- standing open problem in quantum,information science. A structural scheme for representing arbitrary multipartite entangled states will yield a deeper understanding of how they behave and interact within more general computational models and protocols. Here we pr...