The algebra of entanglement and the geometry of composition

09/23/2017
by   Amar Hadzihasanovic, et al.
0

String diagrams turn algebraic equations into topological moves that have recurring shapes, involving the sliding of one diagram past another. We individuate, at the root of this fact, the dual nature of polygraphs as presentations of higher algebraic theories, and as combinatorial descriptions of "directed spaces". Operations of polygraphs modelled on operations of topological spaces are used as the foundation of a compositional universal algebra, where sliding moves arise from tensor products of polygraphs. We reconstruct several higher algebraic theories in this framework. In this regard, the standard formalism of polygraphs has some technical problems. We propose a notion of regular polygraph, barring cell boundaries that are not homeomorphic to a disk of the appropriate dimension. We define a category of non-degenerate shapes, and show how to calculate their tensor products. Then, we introduce a notion of weak unit to recover weakly degenerate boundaries in low dimensions, and prove that the existence of weak units is equivalent to a representability property. We then turn to applications of diagrammatic algebra to quantum theory. We re-evaluate the category of Hilbert spaces from the perspective of categorical universal algebra, which leads to a bicategorical refinement. Then, we focus on the axiomatics of fragments of quantum theory, and present the ZW calculus, the first complete diagrammatic axiomatisation of the theory of qubits. The ZW calculus has several advantages over ZX calculi, including a computationally meaningful normal form, and a fragment whose diagrams can be read as setups of fermionic oscillators. Moreover, its generators reflect an operational classification of entangled states of 3 qubits. We conclude with generalisations of the ZW calculus to higher-dimensional systems, including the definition of a universal set of generators in each dimension.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/20/2022

Data structures for topologically sound higher-dimensional diagram rewriting

We present a computational implementation of diagrammatic sets, a model ...
research
04/29/2021

String Diagram Rewrite Theory II: Rewriting with Symmetric Monoidal Structure

Symmetric monoidal theories (SMTs) generalise algebraic theories in a wa...
research
01/04/2018

A diagrammatic axiomatisation of fermionic quantum circuits

We introduce the fermionic ZW calculus, a string-diagrammatic language f...
research
04/23/2021

Algebraic combinatory models

We introduce an equationally definable counterpart of the notion of comb...
research
10/13/2021

Representing Matrices Using Algebraic ZX-calculus

Elementary matrices play an important role in linear algebra application...
research
06/07/2022

Compositional Exploration of Combinatorial Scientific Models

We implement a novel representation of model search spaces as diagrams o...
research
01/27/2023

The Produoidal Algebra of Process Decomposition

We introduce the normal produoidal category of monoidal contexts over an...

Please sign up or login with your details

Forgot password? Click here to reset