An Algebraic Axiomatisation of ZX-calculus

Quanlong Wang

ZX-calculus is a graphical language for quantum computing which is complete in the sense that calculation in matrices can be done in a purely diagrammatic way. However, all previous universally complete axiomatisations of ZX-calculus have included at least one rule involving trigonometric functions such as sin and cos which makes it difficult for application purpose. In this paper we give an algebraic complete axiomatisation of ZX-calculus instead such that there are only ring operations involved for phases. With this algebraic axiomatisation of ZX-calculus, we are able to establish for the first time a simple translation of diagrams from another graphical language called ZH-calculus and to derive all the ZX-translated rules of ZH-calculus. As a consequence, we have a great benefit that all techniques obtained in ZH-calculus can be transplanted to ZX-calculus, which can't be obtained by just using the completeness of ZX-calculus.

In Benoît Valiron, Shane Mansfield, Pablo Arrighi and Prakash Panangaden: Proceedings 17th International Conference on Quantum Physics and Logic (QPL 2020), Paris, France, June 2 - 6, 2020, Electronic Proceedings in Theoretical Computer Science 340, pp. 303–332.
Published: 6th September 2021.

ArXived at: http://dx.doi.org/10.4204/EPTCS.340.16 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org