Generalised compositional theories and diagrammatic reasoning

@article{Coecke2015GeneralisedCT,
  title={Generalised compositional theories and diagrammatic reasoning},
  author={Bob Coecke and Ross Duncan and Aleks Kissinger and Quanlong Wang},
  journal={arXiv: Quantum Physics},
  year={2015},
  pages={309-366}
}
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 relationship we explore in later part of this chapter. 
View PDF on arXiv
33 Citations
Highly Influential Citations
1
Background Citations
16
Methods Citations
8

33 Citations

Reasoning about conscious experience with axiomatic and graphical mathematics

Mathematical methods for resource-based type theories.

A logical framework that captures two mathematical approaches to resource theory based on monoids (algebraic) and monoidal categories (categorical) is presented, and it is proved soundness and completeness of an algebraic and categorical semantics that recover these approaches.

The Abstract Structure of Quantum Algorithms

It is shown that adopting a unified and general language for process theories advances foundations and practical applications of quantum information, and a novel model of quantum blackbox algorithms in non-deterministic classical computation is constructed.

Morphisms in categories of nonlocal games

Synchronous correlations provide a class of nonlocal games that behave like functions between finite sets. In this work we examine categories whose morphisms are games with synchronous classical,…

Categorical Quantum Mechanics II: Classical-Quantum Interaction

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,…

Completeness and the ZX-calculus

A graphical calculus similar to the ZX-calculus is developed that fully describes Spekkens' toy theory, and it is shown that it is complete, which implies that a wide range of realistic scenarios in quantum computation can be analysed graphically without loss of deductive power.

Completeness of the ZX-calculus

This thesis gives the first complete axiomatisation of the ZX-calculus for the overall pure qubit quantum mechanics, via a translation from the completeness result of another graphical language for quantum computing -- the ZW-Calculus, and proves the completions of this language for 2-qubit Clifford+T circuits by verifying the complete set of 17 circuit relations in diagrammatic rewriting.

Information-theoretic foundations of thermodynamics in general probabilistic theories

In this thesis we study the informational underpinnings of thermodynamics and statistical mechanics. To this purpose, we use an abstract framework— general probabilistic theories—, capable of…

Fourier transforms from strongly complementary observables

Ongoing work in quantum information emphasises the need for a structural understanding of quantum speedups: in this work, we focus on the quantum Fourier transform and the structures in quantum…

M ay 2 01 6 Categorical Quantum Mechanics II : Classical-Quantum Interaction

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,…

40 References

Interacting quantum observables: categorical algebra and diagrammatics

The ZX-calculus is introduced, an intuitive and universal graphical calculus for multi-qubit systems, which greatly simplifies derivations in the area of quantum computation and information and axiomatize phase shifts within this framework.

Informational derivation of quantum theory

We derive quantum theory from purely informational principles. Five elementary axioms - causality, perfect distinguishability, ideal compression, local distinguishability, and pure conditioning -…

Quantum and Classical Structures in Nondeterminstic Computation

It is shown that classical structures in the category of relations correspond to direct sums of abelian groups in the standard Hilbert space model of quantum theories.

Semantic Techniques in Quantum Computation

This book explores quantum computation from the perspective of the branch of theoretical computer science known as semantics, as an alternative to the more well-known studies of algorithmics, complexity theory, and information theory.

Spekkens's toy theory as a category of processes

We provide two mathematical descriptions of Spekkens's toy qubit theory, an inductively one in terms of a small set of generators, as well as an explicit closed form description. It is a subcategory…

Rewriting Measurement-Based Quantum Computations with Generalised Flow

This work presents a method for verifying measurement-based quantum computations, by producing a quantum circuit equivalent to a given deterministic measurement pattern via a rewriting strategy based on the generalised flow of the pattern.

Quantum Protocols involving Multiparticle Entanglement and their Representations in the zx-calculus.

For protocols involving multipartite entangled states, such as the GreenbergerHorne-Zeilinger and W -state, it will be shown that the zx-calculus provides a relatively easy and more intuitive presentation and in this representation it is easier to check that protocols are correct.

Information processing in generalized probabilistic theories

A framework in which a variety of probabilistic theories can be defined, including classical and quantum theories, and many others, is introduced, and a tensor product rule for combining separate systems can be derived.

Towards an algebraic theory of Boolean circuits

Pictures of processes : automated graph rewriting for monoidal categories and applications to quantum computing

The introduction of a discretised version of a string diagram called a string graph is introduced, and it is shown how string graphs modulo a rewrite system can be used to construct free symmetric traced and compact closed categories on a monoidal signature.