DeepAI
Log In Sign Up

Completeness of the ZX-Calculus

03/13/2019
by   Emmanuel Jeandel, et al.
0

The ZX-Calculus is a graphical language for diagrammatic reasoning in quantum mechanics and quantum information theory. It comes equipped with an equational presentation. We focus here on a very important property of the language: completeness, which roughly ensures the equational theory captures all of quantum mechanics. We first improve on the known-to-be-complete presentation or the so-called Clifford fragment of the language - a restriction that is not universal - by adding some axioms. Thanks to a system of back-and-forth translation between the ZX-Calculus and a third-party complete graphical language, we prove that the provided axiomatisation is complete for the first approximately universal fragment of the language, namely Clifford+T. We then prove that the expressive power of this presentation, though aimed at achieving completeness for the aforementioned restriction, extends beyond Clifford+T, to a class of diagrams that we call linear with Clifford+T constants. We use another version of the third-party language - and an adapted system of back-and-forth translation - to complete the language for the ZX-Calculus as a whole, that is, with no restriction. We briefly discuss the added axioms, and finally, we provide a complete axiomatisation for an altered version of the language which involves an additional generator, making the presentation simpler.

READ FULL TEXT
06/21/2022

The Many-Worlds Calculus

We propose a new typed graphical language for quantum computation, based...
05/05/2022

Completeness of Sum-Over-Paths for Toffoli-Hadamard and the Clifford Hierarchy

The "Sum-Over-Paths" formalism is a way to symbolically manipulate linea...
07/07/2020

The Vectorial Lambda Calculus Revisited

We revisit the Vectorial Lambda Calculus, a typed version of Lineal. Vec...
08/10/2020

On a recipe for quantum graphical languages

Different graphical calculi have been proposed to represent quantum comp...
09/26/2017

Towards a Minimal Stabilizer ZX-calculus

The stabilizer ZX-calculus is a rigorous graphical language for reasonin...
04/08/2019

A HoTT Quantum Equational Theory (Extended Version)

This paper presents an equational theory for the QRAM model of quantum c...
03/22/2022

Comparing the expressiveness of the π-calculus and CCS

This paper shows that the π-calculus with implicit matching is no more e...