Completeness of qufinite ZXW calculus, a graphical language for finite-dimensional quantum theory

Boldizs\'ar Po\'or; Quanlong Wang; Razin A. Shaikh

arxiv: 2309.13014 · v3 · submitted 2023-09-22 · 🪐 quant-ph

Completeness of qufinite ZXW calculus, a graphical language for finite-dimensional quantum theory

Quanlong Wang , Boldizs\'ar Po\'or , Razin A. Shaikh This is my paper

Pith reviewed 2026-05-24 06:56 UTC · model grok-4.3

classification 🪐 quant-ph

keywords qufinite ZXW calculuscompletenessgraphical languagefinite-dimensional quantum theorynormal formdiagrammatic reasoningFHilbquantum information

0 comments

The pith

The qufinite ZXW calculus is complete: every diagram rewrites to a unique normal form that represents any tensor in finite-dimensional quantum theory.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper sets out to show that a new graphical language called the qufinite ZXW calculus can express and manipulate all linear maps between finite-dimensional Hilbert spaces using only diagram rewriting. It does this by defining a unique normal form for any tensor and proving that the calculus rules are sufficient to reduce any diagram to that form. A sympathetic reader would care because this gives quantum information and computation a purely visual reasoning system whose power matches the standard mathematical category FHilb exactly. The result removes the need to translate diagrams back into equations to verify equalities. It directly supplies a diagrammatic foundation for finite-dimensional quantum theory.

Core claim

We introduce the qufinite ZXW calculus as a graphical language for finite-dimensional quantum theory. We set up a unique normal form to represent an arbitrary tensor and prove completeness by demonstrating that any qufinite ZXW diagram can be rewritten into its normal form. This result implies the equivalence of the qufinite ZXW calculus and the category FHilb, leading to a purely diagrammatic framework for finite-dimensional quantum theory with the same reasoning power.

What carries the argument

The qufinite ZXW calculus together with its rewriting rules that reduce any diagram to a unique normal form representing an arbitrary tensor.

If this is right

Any equality between tensors in finite-dimensional quantum theory can be derived by diagram rewriting alone.
The calculus supplies a complete graphical language with the same expressive and deductive power as the category FHilb.
It supports diagrammatic reasoning in domains such as spin networks, mixed-dimensional quantum systems, quantum programming, and algorithm description.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

Automated rewriting tools built on these rules could verify quantum protocols by direct diagram manipulation.
The normal-form technique might serve as a template for proving completeness of related graphical languages in other dimensions or with additional structure.

Load-bearing premise

The chosen normal form is unique for each tensor and the rewriting rules are sufficient to reach it from any diagram.

What would settle it

Exhibit two qufinite ZXW diagrams that denote the same linear map yet cannot be transformed into each other by the rules, or exhibit a diagram that cannot be reduced to the stated normal form.

read the original abstract

Finite-dimensional quantum theory serves as the theoretical foundation for quantum information and computation. Mathematically, it is formalized in the category FHilb, comprising all finite-dimensional Hilbert spaces and linear maps between them. However, there has not been a graphical language for FHilb which is both universal and complete and thus incorporates a set of rules rich enough to derive any equality of the underlying formalism solely by rewriting. In this paper, we introduce the qufinite ZXW calculus - a graphical language for reasoning about finite-dimensional quantum theory. We set up a unique normal form to represent an arbitrary tensor and prove the completeness of this calculus by demonstrating that any qufinite ZXW diagram can be rewritten into its normal form. This result implies the equivalence of the qufinite ZXW calculus and the category FHilb, leading to a purely diagrammatic framework for finite-dimensional quantum theory with the same reasoning power. In addition, we identify several domains where the application of the qufinite ZXW calculus holds promise. These domains include spin networks, interacting mixed-dimensional systems in quantum chemistry, quantum programming, high-level description of quantum algorithms, and mixed-dimensional quantum computing. Our work paves the way for a comprehensive diagrammatic description of quantum physics, opening the doors of this area to the wider public.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper claims completeness for a qufinite ZXW calculus via reduction to a unique normal form representing all of FHilb, but the actual rewriting argument for mixed dimensions is the part that needs verification.

read the letter

The main takeaway is that this work extends the ZXW calculus to wires of arbitrary finite dimensions and asserts a completeness result by showing every diagram rewrites to one normal form that stands for any tensor in FHilb. That would give a purely graphical system with the same power as the standard linear-algebra description of finite-dimensional quantum theory. The authors also flag concrete places where such a language could be used, such as mixed-dimensional systems in chemistry or spin networks. That part is straightforward and useful to note. The normal-form route is a reasonable way to prove completeness without obvious circularity, since the target representation is defined independently of the diagrams. What remains unclear is whether the given rules actually reach that normal form in every case. The abstract states the reduction works, yet supplies no detail on how the normal form is built for systems with several different dimensions on the wires or why every possible diagram terminates at a unique representative. If some mixed-dimensional diagrams are left out or if two different normal forms can denote the same map, the completeness claim does not go through. The stress-test note points to exactly this gap, and nothing in the provided abstract closes it. Readers already working inside categorical quantum mechanics will find the framework relevant and can judge the proof once the full rules and reduction steps are examined. The paper is coherent on its own terms and engages the existing ZX literature, so it is worth sending to referees who can check the technical steps rather than desk-rejecting it on the abstract alone.

Referee Report

1 major / 2 minor

Summary. The paper introduces the qufinite ZXW calculus, a graphical language for finite-dimensional quantum theory formalized in the category FHilb. It defines a unique normal form representing arbitrary tensors and proves completeness by showing that the ZXW rewriting rules allow any diagram to be reduced to this normal form, implying equivalence between the calculus and FHilb. Potential applications in spin networks, mixed-dimensional quantum systems, quantum programming, and algorithms are identified.

Significance. If the completeness proof is correct, the result supplies a universal and complete diagrammatic framework for all finite-dimensional Hilbert spaces and maps, extending qubit ZX calculi to qudits and mixed dimensions. The normal-form strategy is a standard technique in the field for establishing such equivalences and would enable purely graphical reasoning with the full power of FHilb.

major comments (1)

[normal form construction and completeness proof] The completeness claim rests entirely on the assertion that the rewriting rules suffice to reduce every diagram (including those with higher-dimensional spiders and mixed-dimensional wires) to the claimed unique normal form without gaps. The manuscript must supply an explicit argument or inductive strategy showing that the normal form spans all of FHilb and that termination and uniqueness hold in the general finite-dimensional case; the abstract's reference to the normal-form setup does not substitute for this verification.

minor comments (2)

List all rewriting rules with explicit diagrams and indicate which are new versus inherited from prior ZX or W calculi.
Clarify the precise definition of the normal form (e.g., how spider phases and wire dimensions are encoded) to allow independent checking of uniqueness.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the detailed review and for highlighting the need for greater explicitness in the completeness argument. We address the major comment below and will revise the manuscript accordingly.

read point-by-point responses

Referee: [normal form construction and completeness proof] The completeness claim rests entirely on the assertion that the rewriting rules suffice to reduce every diagram (including those with higher-dimensional spiders and mixed-dimensional wires) to the claimed unique normal form without gaps. The manuscript must supply an explicit argument or inductive strategy showing that the normal form spans all of FHilb and that termination and uniqueness hold in the general finite-dimensional case; the abstract's reference to the normal-form setup does not substitute for this verification.

Authors: We agree that an explicit inductive strategy is required to rigorously establish termination, uniqueness, and that the normal form spans all of FHilb, particularly for higher-dimensional spiders and mixed-dimensional wires. While the manuscript outlines the normal form and states that every diagram reduces to it, the inductive argument on diagram structure (by number of spiders, wire dimensions, and connectivity) is not presented with sufficient detail. In the revised version we will add a new subsection (likely in Section 4 or 5) that supplies this induction: base case for single spiders, inductive step for adding spiders or wires while preserving the normal-form invariants, and a separate argument for termination via a suitable measure (e.g., total number of non-normal-form generators). This will also confirm that every finite-dimensional tensor is represented. revision: yes

Circularity Check

0 steps flagged

No circularity; completeness via independent normal form in FHilb

full rationale

The paper sets up a unique normal form that represents an arbitrary tensor in the external category FHilb, then proves that ZXW rewriting rules reduce any diagram to this form. This chain does not reduce by construction to its own inputs, fitted parameters, or self-citation load-bearing premises; the normal form is defined from the target semantics rather than from the calculus itself. No self-definitional, fitted-prediction, or uniqueness-imported patterns appear in the abstract or claimed derivation.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The proof relies on standard axioms of category theory (monoidal categories, compact closed structure of FHilb) and linear algebra; no free parameters or invented entities are introduced in the abstract.

axioms (1)

standard math FHilb is a compact closed monoidal category with the usual tensor product and duals for finite-dimensional Hilbert spaces.
Invoked implicitly as the target semantics for the graphical language.

pith-pipeline@v0.9.0 · 5770 in / 1233 out tokens · 20784 ms · 2026-05-24T06:56:50.058446+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/RealityFromDistinction.lean reality_from_one_distinction unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

We set up a unique normal form to represent an arbitrary tensor and prove the completeness of this calculus by demonstrating that any qufinite ZXW diagram can be rewritten into its normal form.
IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

The normal form for the tensor A is given by: K1 a0 … am-1 with index decomposition k = ek,s-1 ms-2… + …

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

String Diagrams for Quantum Foundations, Computing and Natural Language Processing
quant-ph 2026-05 unverdicted novelty 6.0

String diagrams formalize constructor theory with locality-composition conflicts, enable wave-based Boolean logic design and optimization, and map Urdu text circuits equivalently to English ones up to gate translation...

Reference graph

Works this paper leans on

55 extracted references · 55 canonical work pages · cited by 1 Pith paper · 11 internal anchors

[2]

Categorical quantum mechanics

Samson Abramsky & Bob Coecke (2008): Categorical Quantum Mechanics . In: Handbook of Quantum Logic and Quantum Structures , 2, Elsevier, pp. 261–325. arXiv:0808.1023

work page internal anchor Pith review Pith/arXiv arXiv 2008
[4]

Awschalom, Lee C

David D. Awschalom, Lee C. Bassett, Andrew S. Dzurak, Evelyn L . Hu & Jason R. Petta (2013): Quantum Spintronics: Engineering and Manipulating Atom-L ike Spins in Semiconductors . Science 339(6124), pp. 1174–1179, doi:10.1126/science.1231364

work page doi:10.1126/science.1231364 2013
[5]

New Journal of Physics 16(9), p

Miriam Backens (2014): The ZX-calculus Is Complete for Stabilizer Quantum Mechani cs. New Journal of Physics 16(9), p. 093021, doi:10.1088/1367-2630/16/9/093021

work page doi:10.1088/1367-2630/16/9/093021 2014
[7]

A complete graphical calculus for Spekkens' toy bit theory

Miriam Backens & Ali Nabi Duman (2016): A Complete Graphical Calculus for Spekkens’ Toy Bit Theory . Foundations of Physics 46(1), pp. 70–103, doi:10.1007/s10701-015-9957-7 . arXiv:1411.1618

work page internal anchor Pith review Pith/arXiv arXiv doi:10.1007/s10701-015-9957-7 2016
[9]

Bækkegaard, L

T. Bækkegaard, L. B. Kristensen, N. J. S. Loft, C. K. Anderse n, D. Petrosyan & N. T. Zinner (2019): Realization of Eﬃcient Quantum Gates with a Superconductin g Qubit-Qutrit Circuit . Scientiﬁc Reports 9(1), p. 13389, doi:10.1038/s41598-019-49657-1

work page doi:10.1038/s41598-019-49657-1 2019
[10]

Mari Carmen Ba˜ nuls, Rainer Blatt, Jacopo Catani, Alessio Celi, J uan Ignacio Cirac, Marcello Dalmonte, Leonardo Fallani, Karl Jansen, Maciej Lewenstein, Simon e Montangero, Christine A. Muschik, Benni Reznik, Enrique Rico, Luca Tagliacozzo, Karel Van A coleyen, Frank Verstraete, Uwe-Jens Wiese, Matthew Wingate, Jakub Zakrzewski & Peter Zolle r (2020): S...

work page doi:10.1140/epjd/e2020-100571-8 2020
[11]

arXiv:2004.05164

Niel de Beaudrap, Xiaoning Bian & Quanlong Wang (2020): Fast and eﬀective techniques for T-count reduction via spider nest identities . arXiv:2004.05164

work page arXiv 2020
[13]

Heralded entanglement between solid-state qubits separated by 3 meters

H. Bernien, B. Hensen, W. Pfaﬀ, G. Koolstra, M. S. Blok, L. Rob ledo, T. H. Taminiau, M. Markham, D. J. Twitchen, L. Childress & R. Hanson (2013): Heralded Entanglement between Solid-State Qubits Separated by Three Metres . Nature 497(7447), pp. 86–90, doi:10.1038/nature12016. arXiv:1212.6136

work page internal anchor Pith review Pith/arXiv arXiv doi:10.1038/nature12016 2013
[14]

Interacting Hopf Algebras

Filippo Bonchi, Pawe/suppress l Soboci´ nski & Fabio Zanasi (2017):Interacting Hopf Algebras. Journal of Pure and Applied Algebra 221(1), pp. 144–184, doi:10.1016/j.jpaa.2016.06.002. arXiv:1403.7048

work page internal anchor Pith review Pith/arXiv arXiv doi:10.1016/j.jpaa.2016.06.002 2017
[15]

Booth & Titouan Carette (2022): Complete ZX-calculi for the Stabiliser Fragment in Odd Prime Dimensions

Robert I. Booth & Titouan Carette (2022): Complete ZX-calculi for the Stabiliser Fragment in Odd Prime Dimensions . arXiv:2204.12531

work page arXiv 2022
[17]

Oxford University Press, 2002.doi:10

D M Brink & G R Satchler (1994): Angular Momentum . Oxford University Press, doi:10.1093/oso/9780198517597.001.0001

work page doi:10.1093/oso/9780198517597.001.0001 1994
[18]

arXiv:2305.02669

Tristan Cam & Simon Martiel (2023): Speeding up Quantum Circuits Simulation Using ZX-Calculus . arXiv:2305.02669

work page arXiv 2023
[20]

arXiv:2007.03564

Titouan Carette & Simon Perdrix (2020): Colored Props for Large Scale Graphical Reasoning . arXiv:2007.03564

work page arXiv 2020
[21]

arXiv:2212.08609

Julien Codsi & John van de Wetering (2023): Classically Simulating Quantum Supremacy IQP Circuits through a Random Graph Approach . arXiv:2212.08609

work page arXiv 2023
[22]

Coecke & R

B. Coecke & R. Duncan (2007): Interacting Quantum Observables . Available at www.cs.ox.ac.uk/people/bob.coecke/GreenRed.pdf

work page 2007
[23]

arXiv:2012.03755

Bob Coecke, Giovanni de Felice, Konstantinos Meichanetzidis & A lexis Toumi (2020): Foundations for Near-Term Quantum Natural Language Processing . arXiv:2012.03755

work page arXiv 2020
[24]

In Luca Aceto, Ivan Damg ˚ ard, Leslie Ann Goldberg, Magn´ us M

Bob Coecke & Ross Duncan (2008): Interacting Quantum Observables . In Luca Aceto, Ivan Damg ˚ ard, Leslie Ann Goldberg, Magn´ us M. Halld´ orsson, Ann a Ing´ olfsd´ ottir & Igor Walukiewicz, editors: Automata, Languages and Programming , Lecture Notes in Computer Sci- ence, Springer, Berlin, Heidelberg, pp. 298–310, doi:10.1007/978-3-540-70583-3_25 . Avai...

work page doi:10.1007/978-3-540-70583-3_25 2008
[25]

New Journal of Physics 13(4), p

Bob Coecke & Ross Duncan (2011): Interacting Quantum Observables: Categorical Algebra and Diagrammatics. New Journal of Physics 13(4), p. 043016, doi:10.1088/1367-2630/13/4/043016

work page doi:10.1088/1367-2630/13/4/043016 2011
[27]

Spekkens (2011): Phase Groups and the Origin of Non-locality for Qubits

Bob Coecke, Bill Edwards & Robert W. Spekkens (2011): Phase Groups and the Origin of Non-locality for Qubits . Electronic Notes in Theoretical Computer Science 270(2), pp. 15–36, doi:10.1016/j.entcs.2011.01.021

work page doi:10.1016/j.entcs.2011.01.021 2011
[28]

Quantinuum

Bob Coecke & Stefano Gogioso (2022): Quantum in Pictures . Quantinuum

work page 2022
[29]

Cambridge University Press

Bob Coecke & Aleks Kissinger (2017): Picturing Quantum Processes . Cambridge University Press

work page 2017
[30]

Quantum 4, p

Niel de Beaudrap & Dominic Horsman (2020): The ZX Calculus Is a Language for Surface Code Lattice Surgery. Quantum 4, p. 218, doi:10.22331/q-2020-01-09-218

work page doi:10.22331/q-2020-01-09-218 2020
[34]

Ross Duncan & Simon Perdrix (2009): Graph States and the Necessity of Euler Decomposition . In Klaus Ambos-Spies, Benedikt L¨ owe & Wolfgang Merkle, editors: Mathematical Theory and Computational Practice , Lecture Notes in Computer Science, Springer, Berlin, Heidelberg, pp. 167– 177, doi:10.1007/978-3-642-03073-4_18 . arXiv:0902.0500

work page internal anchor Pith review Pith/arXiv arXiv doi:10.1007/978-3-642-03073-4_18 2009
[35]

P faendler, Muhammad Hamza Waseem, Thomas Cervoni, Aleks Kissinger, Stefano Gogioso & Bob Co ecke (2023): Quantum Picturalism: Learning Quantum Theory in High Schoo l

Selma D¨ undar-Coecke, Lia Yeh, Caterina Puca, Sieglinde M.-L. P faendler, Muhammad Hamza Waseem, Thomas Cervoni, Aleks Kissinger, Stefano Gogioso & Bob Co ecke (2023): Quantum Picturalism: Learning Quantum Theory in High Schoo l. In: 2023 IEEE In- ternational Conference on Quantum Computing and Engineering (Q CE), 03, pp. 21–32, doi:10.1109/QCE 57702.202...

work page doi:10.1109/qce 2023
[36]

Richard D. P. East, Pierre Martin-Dussaud & John Van de Weter ing (2022): Spin-Networks in the ZX-calculus. arXiv:2111.03114

work page arXiv 2022
[38]

On the category of props

Philip Hackney & Marcy Robertson (2015): On the Category of Props . Applied Categorical Struc- tures 23(4), pp. 543–573, doi:10.1007/s10485-014-9369-4 . arXiv:1207.2773

work page internal anchor Pith review Pith/arXiv arXiv doi:10.1007/s10485-014-9369-4 2015
[40]

In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science , LICS ’18, Association for Comput- ing Machinery, New York, NY, USA, pp

Amar Hadzihasanovic, Kang Feng Ng & Quanlong Wang (2018): Two Complete Axiomat- isations of Pure-State Qubit Quantum Computing . In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science , LICS ’18, Association for Comput- ing Machinery, New York, NY, USA, pp. 502–511, doi:10.1145/3209108.3209128. Available at https://www.cs.ox.ac...

work page doi:10.1145/3209108.3209128 2018
[41]

Oxford University Press, 2002.doi:10

Chris Heunen & Jamie Vicary (2019): Categories for Quantum Theory: An Introduction . Oxford University Press, doi:10.1093/oso/9780198739623.001.0001

work page doi:10.1093/oso/9780198739623.001.0001 2019
[42]

In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science , LICS ’18, Association for Computing Machinery, New York, NY, USA, pp

Emmanuel Jeandel, Simon Perdrix & Renaud Vilmart (2018): A Complete Axiomatisation of the ZX-Calculus for Cliﬀord+T Quantum Mechanics . In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science , LICS ’18, Association for Computing Machinery, New York, NY, USA, pp. 559–568, doi:10.1145/3209108.3209131. arXiv:1705.11151

work page doi:10.1145/3209108.3209131 2018
[43]

In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science , LICS ’18, Association for Computing Machinery, New York, NY, USA, pp

Emmanuel Jeandel, Simon Perdrix & Renaud Vilmart (2018): Diagrammatic Reasoning beyond Cliﬀord+T Quantum Mechanics . In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science , LICS ’18, Association for Computing Machinery, New York, NY, USA , pp. 569–578, doi:10.1145/3209108.3209139. arXiv:1801.10142

work page doi:10.1145/3209108.3209139 2018
[44]

Theoretical Computer Science 367(3), pp

Faisal Shah Khan & Marek Perkowski (2006): Synthesis of Multi-Qudit Hybrid and d-Valued Quantum Logic Circuits by Decomposition . Theoretical Computer Science 367(3), pp. 336–346, doi:10.1016/j.tcs.2006.09.006

work page doi:10.1016/j.tcs.2006.09.006 2006
[45]

Lu & Peter W

Andrey Boris Khesin, Jonathan Z. Lu & Peter W. Shor (2023): Graphical Quantum Cliﬀord-encoder Compilers from the ZX Calculus . arXiv:2301.02356

work page arXiv 2023
[46]

arXiv:2204.14038

Aleks Kissinger (2022): Phase-free ZX diagrams are CSS codes (...or how to graphical ly grok the surface code). arXiv:2204.14038

work page arXiv 2022
[48]

Aleks Kissinger, John van de Wetering & Renaud Vilmart (2022): Classical Simulation of Quantum Circuits with Partial and Graphical Stabiliser Decomposit ions, doi:10.4230/LIP Ics .T QC.2022.5

work page doi:10.4230/lip 2022
[49]

Quantum 3, p

Aleks Kissinger & John van de Wetering (2019): Universal MBQC with Generalised Parity-Phase Interactions and Pauli Measurements . Quantum 3, p. 134, doi:10.22331/q-2019-04-26-134 . Q. Wang, B. Po´ or and R. Shaikh 23

work page doi:10.22331/q-2019-04-26-134 2019
[50]

arXiv:2307.01803

Mark Koch, Richie Yeung & Quanlong Wang (2023): Speedy Contraction of ZX Diagrams with Triangles via Stabiliser Decompositions . arXiv:2307.01803

work page arXiv 2023
[51]

arXiv:2212.08048

Tuomas Laakkonen, Konstantinos Meichanetzidis & John van de Wetering (2022): A Graphical #SAT Algorithm for Formulae with Small Clause Density . arXiv:2212.08048

work page arXiv 2022
[53]

Quantum computing using shortcuts through higher dimensions

Benjamin P. Lanyon, Marco Barbieri, Marcelo P. Almeida, Thomas Jennewein, Timothy C. Ralph, Kevin J. Resch, Geoﬀ J. Pryde, Jeremy L. O’Brien, Alexei Gilchrist & A ndrew G. White (2009): Simplifying Quantum Logic Using Higher-Dimensional Hilbe rt Spaces . Nature Physics 5(2), pp. 134–140, doi:10.1038/nphys1150. arXiv:0804.0272

work page internal anchor Pith review Pith/arXiv arXiv doi:10.1038/nphys1150 2009
[54]

General Relativity and Gravitation 51(9), p

Pierre Martin-Dussaud (2019): A Primer of Group Theory for Loop Quantum Gravity and Spin- Foams. General Relativity and Gravitation 51(9), p. 110, doi:10.1007/s10714-019-2583-5 . arXiv:1902.08439

work page doi:10.1007/s10714-019-2583-5 2019
[55]

In: IEEE Interna- tional Conference on Quantum Software (QSW 2023) , IEEE Computer Society, Chicago, IL, USA, pp

Kevin Mato, Stefan Hillmich & Robert Wille (2023): Compression of Qubit Cir- cuits: Mapping to Mixed-Dimensional Quantum Systems . In: IEEE Interna- tional Conference on Quantum Software (QSW 2023) , IEEE Computer Society, Chicago, IL, USA, pp. 155–161, doi:10.1109/QSW 59989.2023.00027. Available at https://www.cda.cit.tum.de/files/eda/2023_qsw_compressio...

work page doi:10.1109/qsw 2023
[57]

A universal completion of the ZX-calculus

Kang Feng Ng & Quanlong Wang (2017): A Universal Completion of the ZX-calculus . arXiv:1706.09877

work page internal anchor Pith review Pith/arXiv arXiv 2017
[58]

Nielsen & Isaac L

Michael A. Nielsen & Isaac L. Chuang (2010): Quantum Computation and Quantum Information . Cambridge University Press, Cambridge, doi:10.1017/CBO 9780511976667

work page doi:10.1017/cbo 2010
[59]

In Ted Bastin, editor: Quantum Theory and Bey- ond, Cambridge University Press, Cambridge, pp

Roger Penrose (1971): Angular Momentum: An Approach to Combinat- orial Space-Time . In Ted Bastin, editor: Quantum Theory and Bey- ond, Cambridge University Press, Cambridge, pp. 151–180. Available at https://www.gravityalchemist.com/wp-content/uploads /2022/03/Penrose-AngularMomentum.pdf

work page 1971
[63]

Spin Networks and Quantum Gravity

Carlo Rovelli & Lee Smolin (1995): Spin Networks and Quantum Gravity . Physical Review D 52(10), pp. 5743–5759, doi:10.1103/P hysRevD.52.5743. arXiv:gr-qc/9505006

work page internal anchor Pith review Pith/arXiv arXiv doi:10.1103/p 1995
[65]

A survey of graphical languages for monoidal categories

P. Selinger (2011): A Survey of Graphical Languages for Monoidal Categories . In Bob Coecke, editor: New Structures for Physics , Lecture Notes in Physics, Springer, Berlin, Heidelberg, pp. 289–355, doi:10.1007/978-3-642-12821-9_4 . arXiv:0908.3347

work page internal anchor Pith review Pith/arXiv arXiv doi:10.1007/978-3-642-12821-9_4 2011
[66]

Logical Methods in Computer Science Volume 8, Issue 3, doi:10.2168/LM CS-8(3:6)2012

Peter Selinger (2012): Finite Dimensional Hilbert Spaces Are Complete for Dagger C om- pact Closed Categories . Logical Methods in Computer Science Volume 8, Issue 3, doi:10.2168/LM CS-8(3:6)2012

work page doi:10.2168/lm 2012
[67]

Shaikh, Quanlong Wang & Richie Yeung (2022): How to Sum and Exponentiate Hamilto- nians in ZXW Calculus

Razin A. Shaikh, Quanlong Wang & Richie Yeung (2022): How to Sum and Exponentiate Hamilto- nians in ZXW Calculus . arXiv:2212.04462

work page arXiv 2022
[68]

Entropy 23(3), p

Camilo Miguel Signorelli, Quanlong Wang & Ilyas Khan (2021): A Compositional Model of Con- sciousness Based on Consciousness-Only . Entropy 23(3), p. 308, doi:10.3390/e23030308

work page doi:10.3390/e23030308 2021
[69]

In: 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pp

Renaud Vilmart (2019): A Near-Minimal Axiomatisation of ZX-Calculus for Pure Qubi t Quantum Mechanics. In: 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pp. 1–10, doi:10.1109/LICS .2019.8785765. arXiv:1812.09114

work page doi:10.1109/lics 2019
[70]

Elec- tronic Proceedings in Theoretical Computer Science 266, pp

Quanlong Wang (2018): Qutrit ZX-calculus Is Complete for Stabilizer Quantum Mech anics. Elec- tronic Proceedings in Theoretical Computer Science 266, pp. 58–70, doi:10.4204/EP T CS.266.3

work page doi:10.4204/ep 2018
[71]

arXiv:2104.06429

Quanlong Wang (2022): Quﬁnite ZX-calculus: A Uniﬁed Framework of Qudit ZX-calcul i. arXiv:2104.06429

work page arXiv 2022
[72]

arXiv:2201.13250

Quanlong Wang, Richie Yeung & Mark Koch (2022): Diﬀerentiating and Integrating ZX Diagrams with Applications to Quantum Machine Learning . arXiv:2201.13250

work page arXiv 2022
[73]

Higher dimensional algebras via colored PROPs

Donald Yau (2008): Higher Dimensional Algebras via Colored PROPs . arXiv:0809.2161. Q. Wang, B. Po´ or and R. Shaikh 25 A Lemmas A.1 Lemmas for the qudit setting Lemma 8. [71] Kj − →a = (0,···, a d-j-1,···, 0) 1 d-j d -1 where− →a = (a1,···, a d− 1), j∈{ 1,···, d− 1}. Proof. Same as [61, Lemma 7]. Lemma 9. [71] · · ·· · · 0 ··· · · ·= · ··· Proof. Same as...

work page internal anchor Pith review Pith/arXiv arXiv 2008
[74]

Indices that have no connection to the mi∧ mj X-spider, that is, ek,j = ek,i

work page
[75]

We ﬁrst show how elements of Group 1 are combined

Indices that had some non-zero connection to the mi∧ mj X-spider that is, ek,j ̸= ek,i . We ﬁrst show how elements of Group 1 are combined. We consider a set of Group 1 indices k0,···, k mi-1 such that their connection to each X-spider equals. That is, for all 0≤ j≤ s− 1, the number of connection to the j-th X-spider equal from all Z-boxes with index kℓ f...

work page

[1] [2]

Categorical quantum mechanics

Samson Abramsky & Bob Coecke (2008): Categorical Quantum Mechanics . In: Handbook of Quantum Logic and Quantum Structures , 2, Elsevier, pp. 261–325. arXiv:0808.1023

work page internal anchor Pith review Pith/arXiv arXiv 2008

[2] [4]

Awschalom, Lee C

David D. Awschalom, Lee C. Bassett, Andrew S. Dzurak, Evelyn L . Hu & Jason R. Petta (2013): Quantum Spintronics: Engineering and Manipulating Atom-L ike Spins in Semiconductors . Science 339(6124), pp. 1174–1179, doi:10.1126/science.1231364

work page doi:10.1126/science.1231364 2013

[3] [5]

New Journal of Physics 16(9), p

Miriam Backens (2014): The ZX-calculus Is Complete for Stabilizer Quantum Mechani cs. New Journal of Physics 16(9), p. 093021, doi:10.1088/1367-2630/16/9/093021

work page doi:10.1088/1367-2630/16/9/093021 2014

[4] [7]

A complete graphical calculus for Spekkens' toy bit theory

Miriam Backens & Ali Nabi Duman (2016): A Complete Graphical Calculus for Spekkens’ Toy Bit Theory . Foundations of Physics 46(1), pp. 70–103, doi:10.1007/s10701-015-9957-7 . arXiv:1411.1618

work page internal anchor Pith review Pith/arXiv arXiv doi:10.1007/s10701-015-9957-7 2016

[5] [9]

Bækkegaard, L

T. Bækkegaard, L. B. Kristensen, N. J. S. Loft, C. K. Anderse n, D. Petrosyan & N. T. Zinner (2019): Realization of Eﬃcient Quantum Gates with a Superconductin g Qubit-Qutrit Circuit . Scientiﬁc Reports 9(1), p. 13389, doi:10.1038/s41598-019-49657-1

work page doi:10.1038/s41598-019-49657-1 2019

[6] [10]

Mari Carmen Ba˜ nuls, Rainer Blatt, Jacopo Catani, Alessio Celi, J uan Ignacio Cirac, Marcello Dalmonte, Leonardo Fallani, Karl Jansen, Maciej Lewenstein, Simon e Montangero, Christine A. Muschik, Benni Reznik, Enrique Rico, Luca Tagliacozzo, Karel Van A coleyen, Frank Verstraete, Uwe-Jens Wiese, Matthew Wingate, Jakub Zakrzewski & Peter Zolle r (2020): S...

work page doi:10.1140/epjd/e2020-100571-8 2020

[7] [11]

arXiv:2004.05164

Niel de Beaudrap, Xiaoning Bian & Quanlong Wang (2020): Fast and eﬀective techniques for T-count reduction via spider nest identities . arXiv:2004.05164

work page arXiv 2020

[8] [13]

Heralded entanglement between solid-state qubits separated by 3 meters

H. Bernien, B. Hensen, W. Pfaﬀ, G. Koolstra, M. S. Blok, L. Rob ledo, T. H. Taminiau, M. Markham, D. J. Twitchen, L. Childress & R. Hanson (2013): Heralded Entanglement between Solid-State Qubits Separated by Three Metres . Nature 497(7447), pp. 86–90, doi:10.1038/nature12016. arXiv:1212.6136

work page internal anchor Pith review Pith/arXiv arXiv doi:10.1038/nature12016 2013

[9] [14]

Interacting Hopf Algebras

Filippo Bonchi, Pawe/suppress l Soboci´ nski & Fabio Zanasi (2017):Interacting Hopf Algebras. Journal of Pure and Applied Algebra 221(1), pp. 144–184, doi:10.1016/j.jpaa.2016.06.002. arXiv:1403.7048

work page internal anchor Pith review Pith/arXiv arXiv doi:10.1016/j.jpaa.2016.06.002 2017

[10] [15]

Booth & Titouan Carette (2022): Complete ZX-calculi for the Stabiliser Fragment in Odd Prime Dimensions

Robert I. Booth & Titouan Carette (2022): Complete ZX-calculi for the Stabiliser Fragment in Odd Prime Dimensions . arXiv:2204.12531

work page arXiv 2022

[11] [17]

Oxford University Press, 2002.doi:10

D M Brink & G R Satchler (1994): Angular Momentum . Oxford University Press, doi:10.1093/oso/9780198517597.001.0001

work page doi:10.1093/oso/9780198517597.001.0001 1994

[12] [18]

arXiv:2305.02669

Tristan Cam & Simon Martiel (2023): Speeding up Quantum Circuits Simulation Using ZX-Calculus . arXiv:2305.02669

work page arXiv 2023

[13] [20]

arXiv:2007.03564

Titouan Carette & Simon Perdrix (2020): Colored Props for Large Scale Graphical Reasoning . arXiv:2007.03564

work page arXiv 2020

[14] [21]

arXiv:2212.08609

Julien Codsi & John van de Wetering (2023): Classically Simulating Quantum Supremacy IQP Circuits through a Random Graph Approach . arXiv:2212.08609

work page arXiv 2023

[15] [22]

Coecke & R

B. Coecke & R. Duncan (2007): Interacting Quantum Observables . Available at www.cs.ox.ac.uk/people/bob.coecke/GreenRed.pdf

work page 2007

[16] [23]

arXiv:2012.03755

Bob Coecke, Giovanni de Felice, Konstantinos Meichanetzidis & A lexis Toumi (2020): Foundations for Near-Term Quantum Natural Language Processing . arXiv:2012.03755

work page arXiv 2020

[17] [24]

In Luca Aceto, Ivan Damg ˚ ard, Leslie Ann Goldberg, Magn´ us M

Bob Coecke & Ross Duncan (2008): Interacting Quantum Observables . In Luca Aceto, Ivan Damg ˚ ard, Leslie Ann Goldberg, Magn´ us M. Halld´ orsson, Ann a Ing´ olfsd´ ottir & Igor Walukiewicz, editors: Automata, Languages and Programming , Lecture Notes in Computer Sci- ence, Springer, Berlin, Heidelberg, pp. 298–310, doi:10.1007/978-3-540-70583-3_25 . Avai...

work page doi:10.1007/978-3-540-70583-3_25 2008

[18] [25]

New Journal of Physics 13(4), p

Bob Coecke & Ross Duncan (2011): Interacting Quantum Observables: Categorical Algebra and Diagrammatics. New Journal of Physics 13(4), p. 043016, doi:10.1088/1367-2630/13/4/043016

work page doi:10.1088/1367-2630/13/4/043016 2011

[19] [27]

Spekkens (2011): Phase Groups and the Origin of Non-locality for Qubits

Bob Coecke, Bill Edwards & Robert W. Spekkens (2011): Phase Groups and the Origin of Non-locality for Qubits . Electronic Notes in Theoretical Computer Science 270(2), pp. 15–36, doi:10.1016/j.entcs.2011.01.021

work page doi:10.1016/j.entcs.2011.01.021 2011

[20] [28]

Quantinuum

Bob Coecke & Stefano Gogioso (2022): Quantum in Pictures . Quantinuum

work page 2022

[21] [29]

Cambridge University Press

Bob Coecke & Aleks Kissinger (2017): Picturing Quantum Processes . Cambridge University Press

work page 2017

[22] [30]

Quantum 4, p

Niel de Beaudrap & Dominic Horsman (2020): The ZX Calculus Is a Language for Surface Code Lattice Surgery. Quantum 4, p. 218, doi:10.22331/q-2020-01-09-218

work page doi:10.22331/q-2020-01-09-218 2020

[23] [34]

Ross Duncan & Simon Perdrix (2009): Graph States and the Necessity of Euler Decomposition . In Klaus Ambos-Spies, Benedikt L¨ owe & Wolfgang Merkle, editors: Mathematical Theory and Computational Practice , Lecture Notes in Computer Science, Springer, Berlin, Heidelberg, pp. 167– 177, doi:10.1007/978-3-642-03073-4_18 . arXiv:0902.0500

work page internal anchor Pith review Pith/arXiv arXiv doi:10.1007/978-3-642-03073-4_18 2009

[24] [35]

P faendler, Muhammad Hamza Waseem, Thomas Cervoni, Aleks Kissinger, Stefano Gogioso & Bob Co ecke (2023): Quantum Picturalism: Learning Quantum Theory in High Schoo l

Selma D¨ undar-Coecke, Lia Yeh, Caterina Puca, Sieglinde M.-L. P faendler, Muhammad Hamza Waseem, Thomas Cervoni, Aleks Kissinger, Stefano Gogioso & Bob Co ecke (2023): Quantum Picturalism: Learning Quantum Theory in High Schoo l. In: 2023 IEEE In- ternational Conference on Quantum Computing and Engineering (Q CE), 03, pp. 21–32, doi:10.1109/QCE 57702.202...

work page doi:10.1109/qce 2023

[25] [36]

Richard D. P. East, Pierre Martin-Dussaud & John Van de Weter ing (2022): Spin-Networks in the ZX-calculus. arXiv:2111.03114

work page arXiv 2022

[26] [38]

On the category of props

Philip Hackney & Marcy Robertson (2015): On the Category of Props . Applied Categorical Struc- tures 23(4), pp. 543–573, doi:10.1007/s10485-014-9369-4 . arXiv:1207.2773

work page internal anchor Pith review Pith/arXiv arXiv doi:10.1007/s10485-014-9369-4 2015

[27] [40]

In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science , LICS ’18, Association for Comput- ing Machinery, New York, NY, USA, pp

Amar Hadzihasanovic, Kang Feng Ng & Quanlong Wang (2018): Two Complete Axiomat- isations of Pure-State Qubit Quantum Computing . In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science , LICS ’18, Association for Comput- ing Machinery, New York, NY, USA, pp. 502–511, doi:10.1145/3209108.3209128. Available at https://www.cs.ox.ac...

work page doi:10.1145/3209108.3209128 2018

[28] [41]

Oxford University Press, 2002.doi:10

Chris Heunen & Jamie Vicary (2019): Categories for Quantum Theory: An Introduction . Oxford University Press, doi:10.1093/oso/9780198739623.001.0001

work page doi:10.1093/oso/9780198739623.001.0001 2019

[29] [42]

In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science , LICS ’18, Association for Computing Machinery, New York, NY, USA, pp

Emmanuel Jeandel, Simon Perdrix & Renaud Vilmart (2018): A Complete Axiomatisation of the ZX-Calculus for Cliﬀord+T Quantum Mechanics . In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science , LICS ’18, Association for Computing Machinery, New York, NY, USA, pp. 559–568, doi:10.1145/3209108.3209131. arXiv:1705.11151

work page doi:10.1145/3209108.3209131 2018

[30] [43]

In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science , LICS ’18, Association for Computing Machinery, New York, NY, USA, pp

Emmanuel Jeandel, Simon Perdrix & Renaud Vilmart (2018): Diagrammatic Reasoning beyond Cliﬀord+T Quantum Mechanics . In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science , LICS ’18, Association for Computing Machinery, New York, NY, USA , pp. 569–578, doi:10.1145/3209108.3209139. arXiv:1801.10142

work page doi:10.1145/3209108.3209139 2018

[31] [44]

Theoretical Computer Science 367(3), pp

Faisal Shah Khan & Marek Perkowski (2006): Synthesis of Multi-Qudit Hybrid and d-Valued Quantum Logic Circuits by Decomposition . Theoretical Computer Science 367(3), pp. 336–346, doi:10.1016/j.tcs.2006.09.006

work page doi:10.1016/j.tcs.2006.09.006 2006

[32] [45]

Lu & Peter W

Andrey Boris Khesin, Jonathan Z. Lu & Peter W. Shor (2023): Graphical Quantum Cliﬀord-encoder Compilers from the ZX Calculus . arXiv:2301.02356

work page arXiv 2023

[33] [46]

arXiv:2204.14038

Aleks Kissinger (2022): Phase-free ZX diagrams are CSS codes (...or how to graphical ly grok the surface code). arXiv:2204.14038

work page arXiv 2022

[34] [48]

Aleks Kissinger, John van de Wetering & Renaud Vilmart (2022): Classical Simulation of Quantum Circuits with Partial and Graphical Stabiliser Decomposit ions, doi:10.4230/LIP Ics .T QC.2022.5

work page doi:10.4230/lip 2022

[35] [49]

Quantum 3, p

Aleks Kissinger & John van de Wetering (2019): Universal MBQC with Generalised Parity-Phase Interactions and Pauli Measurements . Quantum 3, p. 134, doi:10.22331/q-2019-04-26-134 . Q. Wang, B. Po´ or and R. Shaikh 23

work page doi:10.22331/q-2019-04-26-134 2019

[36] [50]

arXiv:2307.01803

Mark Koch, Richie Yeung & Quanlong Wang (2023): Speedy Contraction of ZX Diagrams with Triangles via Stabiliser Decompositions . arXiv:2307.01803

work page arXiv 2023

[37] [51]

arXiv:2212.08048

Tuomas Laakkonen, Konstantinos Meichanetzidis & John van de Wetering (2022): A Graphical #SAT Algorithm for Formulae with Small Clause Density . arXiv:2212.08048

work page arXiv 2022

[38] [53]

Quantum computing using shortcuts through higher dimensions

Benjamin P. Lanyon, Marco Barbieri, Marcelo P. Almeida, Thomas Jennewein, Timothy C. Ralph, Kevin J. Resch, Geoﬀ J. Pryde, Jeremy L. O’Brien, Alexei Gilchrist & A ndrew G. White (2009): Simplifying Quantum Logic Using Higher-Dimensional Hilbe rt Spaces . Nature Physics 5(2), pp. 134–140, doi:10.1038/nphys1150. arXiv:0804.0272

work page internal anchor Pith review Pith/arXiv arXiv doi:10.1038/nphys1150 2009

[39] [54]

General Relativity and Gravitation 51(9), p

Pierre Martin-Dussaud (2019): A Primer of Group Theory for Loop Quantum Gravity and Spin- Foams. General Relativity and Gravitation 51(9), p. 110, doi:10.1007/s10714-019-2583-5 . arXiv:1902.08439

work page doi:10.1007/s10714-019-2583-5 2019

[40] [55]

In: IEEE Interna- tional Conference on Quantum Software (QSW 2023) , IEEE Computer Society, Chicago, IL, USA, pp

Kevin Mato, Stefan Hillmich & Robert Wille (2023): Compression of Qubit Cir- cuits: Mapping to Mixed-Dimensional Quantum Systems . In: IEEE Interna- tional Conference on Quantum Software (QSW 2023) , IEEE Computer Society, Chicago, IL, USA, pp. 155–161, doi:10.1109/QSW 59989.2023.00027. Available at https://www.cda.cit.tum.de/files/eda/2023_qsw_compressio...

work page doi:10.1109/qsw 2023

[41] [57]

A universal completion of the ZX-calculus

Kang Feng Ng & Quanlong Wang (2017): A Universal Completion of the ZX-calculus . arXiv:1706.09877

work page internal anchor Pith review Pith/arXiv arXiv 2017

[42] [58]

Nielsen & Isaac L

Michael A. Nielsen & Isaac L. Chuang (2010): Quantum Computation and Quantum Information . Cambridge University Press, Cambridge, doi:10.1017/CBO 9780511976667

work page doi:10.1017/cbo 2010

[43] [59]

In Ted Bastin, editor: Quantum Theory and Bey- ond, Cambridge University Press, Cambridge, pp

Roger Penrose (1971): Angular Momentum: An Approach to Combinat- orial Space-Time . In Ted Bastin, editor: Quantum Theory and Bey- ond, Cambridge University Press, Cambridge, pp. 151–180. Available at https://www.gravityalchemist.com/wp-content/uploads /2022/03/Penrose-AngularMomentum.pdf

work page 1971

[44] [63]

Spin Networks and Quantum Gravity

Carlo Rovelli & Lee Smolin (1995): Spin Networks and Quantum Gravity . Physical Review D 52(10), pp. 5743–5759, doi:10.1103/P hysRevD.52.5743. arXiv:gr-qc/9505006

work page internal anchor Pith review Pith/arXiv arXiv doi:10.1103/p 1995

[45] [65]

A survey of graphical languages for monoidal categories

P. Selinger (2011): A Survey of Graphical Languages for Monoidal Categories . In Bob Coecke, editor: New Structures for Physics , Lecture Notes in Physics, Springer, Berlin, Heidelberg, pp. 289–355, doi:10.1007/978-3-642-12821-9_4 . arXiv:0908.3347

work page internal anchor Pith review Pith/arXiv arXiv doi:10.1007/978-3-642-12821-9_4 2011

[46] [66]

Logical Methods in Computer Science Volume 8, Issue 3, doi:10.2168/LM CS-8(3:6)2012

Peter Selinger (2012): Finite Dimensional Hilbert Spaces Are Complete for Dagger C om- pact Closed Categories . Logical Methods in Computer Science Volume 8, Issue 3, doi:10.2168/LM CS-8(3:6)2012

work page doi:10.2168/lm 2012

[47] [67]

Shaikh, Quanlong Wang & Richie Yeung (2022): How to Sum and Exponentiate Hamilto- nians in ZXW Calculus

Razin A. Shaikh, Quanlong Wang & Richie Yeung (2022): How to Sum and Exponentiate Hamilto- nians in ZXW Calculus . arXiv:2212.04462

work page arXiv 2022

[48] [68]

Entropy 23(3), p

Camilo Miguel Signorelli, Quanlong Wang & Ilyas Khan (2021): A Compositional Model of Con- sciousness Based on Consciousness-Only . Entropy 23(3), p. 308, doi:10.3390/e23030308

work page doi:10.3390/e23030308 2021

[49] [69]

In: 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pp

Renaud Vilmart (2019): A Near-Minimal Axiomatisation of ZX-Calculus for Pure Qubi t Quantum Mechanics. In: 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pp. 1–10, doi:10.1109/LICS .2019.8785765. arXiv:1812.09114

work page doi:10.1109/lics 2019

[50] [70]

Elec- tronic Proceedings in Theoretical Computer Science 266, pp

Quanlong Wang (2018): Qutrit ZX-calculus Is Complete for Stabilizer Quantum Mech anics. Elec- tronic Proceedings in Theoretical Computer Science 266, pp. 58–70, doi:10.4204/EP T CS.266.3

work page doi:10.4204/ep 2018

[51] [71]

arXiv:2104.06429

Quanlong Wang (2022): Quﬁnite ZX-calculus: A Uniﬁed Framework of Qudit ZX-calcul i. arXiv:2104.06429

work page arXiv 2022

[52] [72]

arXiv:2201.13250

Quanlong Wang, Richie Yeung & Mark Koch (2022): Diﬀerentiating and Integrating ZX Diagrams with Applications to Quantum Machine Learning . arXiv:2201.13250

work page arXiv 2022

[53] [73]

Higher dimensional algebras via colored PROPs

Donald Yau (2008): Higher Dimensional Algebras via Colored PROPs . arXiv:0809.2161. Q. Wang, B. Po´ or and R. Shaikh 25 A Lemmas A.1 Lemmas for the qudit setting Lemma 8. [71] Kj − →a = (0,···, a d-j-1,···, 0) 1 d-j d -1 where− →a = (a1,···, a d− 1), j∈{ 1,···, d− 1}. Proof. Same as [61, Lemma 7]. Lemma 9. [71] · · ·· · · 0 ··· · · ·= · ··· Proof. Same as...

work page internal anchor Pith review Pith/arXiv arXiv 2008

[54] [74]

Indices that have no connection to the mi∧ mj X-spider, that is, ek,j = ek,i

work page

[55] [75]

We ﬁrst show how elements of Group 1 are combined

Indices that had some non-zero connection to the mi∧ mj X-spider that is, ek,j ̸= ek,i . We ﬁrst show how elements of Group 1 are combined. We consider a set of Group 1 indices k0,···, k mi-1 such that their connection to each X-spider equals. That is, for all 0≤ j≤ s− 1, the number of connection to the j-th X-spider equal from all Z-boxes with index kℓ f...

work page