Completeness for arbitrary finite dimensions of ZXW-calculus, a unifying calculus
Boldizsár Poór, Quanlong Wang, Razin A. Shaikh, Lia Yeh, Richie Yeung, Bob Coecke
Abstract
The ZX-calculus is a universal graphical language for qubit quantum computation, meaning that every linear map between qubits can be expressed in the ZX-calculus. Furthermore, it is a complete graphical rewrite system: any equation involving linear maps that is derivable in the Hilbert space formalism for quantum theory can also be derived in the calculus by rewriting. It has widespread usage within quantum industry and academia for a variety of tasks such as quantum circuit optimisation, error-correction, and education.
The ZW-calculus is an alternative universal graphical language that is also complete for qubit quantum computing. In fact, its completeness was used to prove that the ZX-calculus is universally complete. This calculus has advanced how quantum circuits are compiled into photonic hardware architectures in the industry.
Recently, by combining these two calculi, a new calculus has emerged for qubit quantum computation, the ZXW-calculus. Using this calculus, graphical-differentiation, -integration, and -exponentiation were made possible, thus enabling the development of novel techniques in the domains of quantum machine learning and quantum chemistry.
Here, we generalise the ZXW-calculus to arbitrary finite dimensions, that is, to qudits. Moreover, we prove that this graphical rewrite system is complete for any finite dimension. This is the first completeness result for any universal graphical language beyond qubits.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext cac8ac95-62ed-4f04-89bd-cfd5ef0eded7Cited by top-tier papers4
- Automating Equational Proofs in Dirac NotationYingte Xu, Gilles Barthe, Li ZhouPOPL 2025 · 5 citations
- Qudit Quantum Programming with Projective CliffordsJennifer Paykin, Sam WinnickPOPL 2026 · 1 citation
- A Complete Equational Theory for Real-Clifford+CH Quantum CircuitsAlexandre ClémentLICS 2026
- D-Hammer: Efficient Equational Reasoning for Labelled Dirac NotationYingte Xu, Li Zhou, Gilles BartheCAV 2025
Related papers
- Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite MemoryTitouan Carette, Marc de Visme, Simon PerdrixLICS 2021 · 7 citations
- Graphical Algebraic Geometry: From Ideals and Varieties to Quantum CalculiDichuan Gao, Razin A. Shaikh, Aleks KissingerLICS 2026
- Complete Graphical Language for Hermiticity-Preserving SuperoperatorsTitouan Carette, Timothée Hoffreumon, Émile Larroque, Renaud VilmartLICS 2023 · 1 citation
- EPOC: An Efficient Pulse Generation Framework with Advanced Synthesis for Quantum CircuitsJinglei Cheng, Yuchen Zhu, Yidong Zhou, Hang Ren et al.DAC 2025 · 2 citations
- Equivalence checking paradigms in quantum circuit design: a case studyTom Peham, Lukas Burgholzer, Robert WilleDAC 2022 · 16 citations
