An Algebraic Axiomatisation of ZX-calculus
arXiv:1911.06752 · doi:10.4204/EPTCS.340.16
Abstract
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.
arXiv commentIn Proceedings QPL 2020, arXiv:2109.01534
References in corpus (6)
- Improved Simulation of Stabilizer Circuits
- Interacting Quantum Observables: Categorical Algebra and Diagrammatics
- Strong Complementarity and Non-locality in Categorical Quantum Mechanics
- Techniques to Reduce -Parity-Phase Circuits, Motivated by the ZX Calculus
- A Simplified Stabilizer ZX-calculus
- Tensor Network Rewriting Strategies for Satisfiability and Counting