The Qupit Stabiliser ZX-travaganza: Simplified Axioms, Normal Forms and Graph-Theoretic Simplification
From MaRDI portal
Publication:6200535
arXiv2306.05204MaRDI QIDQ6200535FDOQ6200535
Authors: Robert I. Booth, Titouan Carette, John van de Wetering, Lia Yeh
Publication date: 22 March 2024
Abstract: We present a smorgasbord of results on the stabiliser ZX-calculus for odd prime-dimensional qudits (i.e. qupits). We derive a simplified rule set that closely resembles the original rules of qubit ZX-calculus. Using these rules, we demonstrate analogues of the spider-removing local complementation and pivoting rules. This allows for efficient reduction of diagrams to the affine with phases normal form. We also demonstrate a reduction to a unique form, providing an alternative and simpler proof of completeness. Furthermore, we introduce a different reduction to the graph state with local Cliffords normal form, which leads to a novel layered decomposition for qupit Clifford unitaries. Additionally, we propose a new approach to handle scalars formally, closely reflecting their practical usage. Finally, we have implemented many of these findings in DiZX, a new open-source Python library for qudit ZX-diagrammatic reasoning.
Full work available at URL: https://arxiv.org/abs/2306.05204
Has companion code repository: https://github.com/jvdwetering/dizx
Cites Work
- Quantum cryptography: public key distribution and coin tossing
- The ZX-calculus is complete for stabilizer quantum mechanics
- Interacting Quantum Observables
- Graph states and the necessity of Euler decomposition
- Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- Title not available (Why is that?)
- Interacting quantum observables: categorical algebra and diagrammatics
- Fault-tolerant quantum computation with higher-dimensional systems
- Rewriting measurement-based quantum computations with generalised flow
- Classical simulation of quantum computation, the Gottesman-Knill theorem and slightly beyond
- Categories for Quantum Theory
- Quantum computing and quantum communications. 1st NASA international conference, QCQC `98, Palm Springs, CA, USA, February 17--20, 1998. Proceedings
- Picturing Quantum Processes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Constructing all qutrit controlled Clifford+\(T\) gates in Clifford+\(T\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: The Qupit Stabiliser ZX-travaganza: Simplified Axioms, Normal Forms and Graph-Theoretic Simplification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6200535)