<bibliography>
 <citation type="article" key="backensZXcalculusCompleteStabilizer2014">
  <author>Miriam <surname>Backens</surname></author>
  <year>2014</year>
  <title>The ZX-calculus Is Complete for Stabilizer Quantum Mechanics</title>
  <journal>New Journal of Physics</journal>
  <volume>16</volume>
  <number>9</number>
  <pages>093021</pages>
  <doi>10.1088/1367-2630/16/9/093021</doi>
 </citation>
 <citation type="inproceedings" key="backensMakingStabilizerZXcalculus2015">
  <author>Miriam <surname>Backens</surname></author>
  <year>2015</year>
  <title>Making the Stabilizer ZX-calculus Complete for Scalars</title>
  <editor>Chris <surname>Heunen</surname></editor>
  <editor>Peter <surname>Selinger</surname></editor>
  <editor>Jamie <surname>Vicary</surname></editor>
  <booktitle>Proceedings of the 12th International Workshop on Quantum Physics and Logic</booktitle>
  <series>Electronic Proceedings in Theoretical Computer Science</series>
  <publisher>Open Publishing Association</publisher>
  <pages>17&#8211;32</pages>
  <doi>10.4204/EPTCS.195.2</doi>
 </citation>
 <citation type="inproceedings" key="backensZHCompleteGraphical2019">
  <author>Miriam <surname>Backens</surname></author>
  <author>Aleks <surname>Kissinger</surname></author>
  <year>2019</year>
  <title>ZH: A Complete Graphical Calculus for Quantum Computations Involving Classical Non-linearity</title>
  <editor>Peter <surname>Selinger</surname></editor>
  <editor>Giulio <surname>Chiribella</surname></editor>
  <booktitle>Proceedings of the 15th International Conference on Quantum Physics and Logic</booktitle>
  <series>Electronic Proceedings in Theoretical Computer Science</series>
  <volume>287</volume>
  <publisher>Open Publishing Association</publisher>
  <address>Halifax, Canada</address>
  <pages>23&#8211;42</pages>
  <doi>10.4204/EPTCS.287.2</doi>
 </citation>
 <citation type="article" key="backensThereBackAgain2021">
  <author>Miriam <surname>Backens</surname></author>
  <author>Hector <surname>Miller-Bakewell</surname></author>
  <author>Giovanni <surname>de Felice</surname></author>
  <author>Leo <surname>Lobski</surname></author>
  <author>John <surname>van de Wetering</surname></author>
  <year>2021</year>
  <title>There and Back Again: A Circuit Extraction Tale</title>
  <journal>Quantum</journal>
  <volume>5</volume>
  <pages>421</pages>
  <doi>10.22331/q-2021-03-25-421</doi>
 </citation>
 <citation type="inproceedings" key="backensSimplifiedStabilizerZXcalculus2017">
  <author>Miriam <surname>Backens</surname></author>
  <author>Simon <surname>Perdrix</surname></author>
  <author>Quanlong <surname>Wang</surname></author>
  <year>2017</year>
  <title>A Simplified Stabilizer ZX-calculus</title>
  <editor>Ross <surname>Duncan</surname></editor>
  <editor>Chris <surname>Heunen</surname></editor>
  <booktitle>Proceedings 13th International Conference on Quantum Physics and Logic</booktitle>
  <series>Electronic Proceedings in Theoretical Computer Science</series>
  <volume>236</volume>
  <publisher>Open Publishing Association</publisher>
  <address>Glasgow, Scotland</address>
  <pages>1&#8211;20</pages>
  <doi>10.4204/EPTCS.236.1</doi>
 </citation>
 <citation type="article" key="backensMinimalStabilizerZXcalculus2020">
  <author>Miriam <surname>Backens</surname></author>
  <author>Simon <surname>Perdrix</surname></author>
  <author>Quanlong <surname>Wang</surname></author>
  <year>2020</year>
  <title>Towards a Minimal Stabilizer ZX-calculus</title>
  <journal>Logical Methods in Computer Science</journal>
  <volume>Volume 16, Issue 4</volume>
  <doi>10.23638/LMCS-16(4:19)2020</doi>
 </citation>
 <citation type="inproceedings" key="debeaudrapFastEffectiveTechniques2020">
  <author>Niel <surname>de Beaudrap</surname></author>
  <author>Xiaoning <surname>Bian</surname></author>
  <author>Quanlong <surname>Wang</surname></author>
  <year>2020</year>
  <title>Fast and Effective Techniques for T-Count Reduction via Spider Nest Identities</title>
  <editor>Steven T. <surname>Flammia</surname></editor>
  <booktitle>15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020)</booktitle>
  <series>Leibniz International Proceedings in Informatics (LIPIcs)</series>
  <volume>158</volume>
  <publisher>Schloss Dagstuhl–Leibniz-Zentrum für Informatik</publisher>
  <address>Dagstuhl, Germany</address>
  <pages>11:1–11:23</pages>
  <doi>10.4230/LIPIcs.TQC.2020.11</doi>
 </citation>
 <citation type="article" key="bennettQuantumCryptographyPublic2014">
  <author>Charles H. <surname>Bennett</surname></author>
  <author>Gilles <surname>Brassard</surname></author>
  <year>2014</year>
  <title>Quantum Cryptography: Public Key Distribution and Coin Tossing</title>
  <journal>Theoretical Computer Science</journal>
  <volume>560</volume>
  <pages>7&#8211;11</pages>
  <doi>10.1016/j.tcs.2014.05.025</doi>
 </citation>
 <citation type="article" key="bennettTeleportingUnknownQuantum1993">
  <author>Charles H. <surname>Bennett</surname></author>
  <author>Gilles <surname>Brassard</surname></author>
  <author>Claude <surname>Cr&#233;peau</surname></author>
  <author>Richard <surname>Jozsa</surname></author>
  <author>Asher <surname>Peres</surname></author>
  <author>William K. <surname>Wootters</surname></author>
  <year>1993</year>
  <title>Teleporting an Unknown Quantum State via Dual Classical and Einstein-Podolsky-Rosen Channels</title>
  <journal>Physical Review Letters</journal>
  <volume>70</volume>
  <number>13</number>
  <pages>1895&#8211;1899</pages>
  <doi>10.1103/PhysRevLett.70.1895</doi>
 </citation>
 <citation type="article" key="bennettCommunicationOneTwoparticle1992">
  <author>Charles H. <surname>Bennett</surname></author>
  <author>Stephen J. <surname>Wiesner</surname></author>
  <year>1992</year>
  <title>Communication via One- and Two-Particle Operators on Einstein-Podolsky-Rosen States</title>
  <journal>Physical Review Letters</journal>
  <volume>69</volume>
  <number>20</number>
  <pages>2881&#8211;2884</pages>
  <doi>10.1103/PhysRevLett.69.2881</doi>
  <url>https://courses.engr.illinois.edu/phys513/sp2019/reading/week9/PhysRevLett.69.2881.pdf</url>
 </citation>
 <citation type="article" key="blokQuantumInformationScrambling2021">
  <author>M. S. <surname>Blok</surname></author>
  <author>V. V. <surname>Ramasesh</surname></author>
  <author>T. <surname>Schuster</surname></author>
  <author>K. <surname>O'Brien</surname></author>
  <author>J. M. <surname>Kreikebaum</surname></author>
  <author>D. <surname>Dahlen</surname></author>
  <author>A. <surname>Morvan</surname></author>
  <author>B. <surname>Yoshida</surname></author>
  <author>N. Y. <surname>Yao</surname></author>
  <author>I. <surname>Siddiqi</surname></author>
  <year>2021</year>
  <title>Quantum Information Scrambling on a Superconducting Qutrit Processor</title>
  <journal>Physical Review X</journal>
  <volume>11</volume>
  <number>2</number>
  <pages>021010</pages>
  <doi>10.1103/PhysRevX.11.021010</doi>
 </citation>
 <citation type="article" key="bocharovFactoringQutritsShor2017">
  <author>Alex <surname>Bocharov</surname></author>
  <author>Martin <surname>Roetteler</surname></author>
  <author>Krysta M. <surname>Svore</surname></author>
  <year>2017</year>
  <title>Factoring with Qutrits: Shor's Algorithm on Ternary and Metaplectic Quantum Architectures</title>
  <journal>Physical Review A</journal>
  <volume>96</volume>
  <number>1</number>
  <pages>012306</pages>
  <doi>10.1103/PhysRevA.96.012306</doi>
  <eprint>1605.02756</eprint>
 </citation>
 <citation type="inproceedings" key="boothCompleteZXcalculiStabiliser2022">
  <author>Robert I. <surname>Booth</surname></author>
  <author>Titouan <surname>Carette</surname></author>
  <year>2022</year>
  <title>Complete ZX-Calculi for the Stabiliser Fragment in Odd Prime Dimensions</title>
  <editor>Stefan <surname>Szeider</surname></editor>
  <editor>Robert <surname>Ganian</surname></editor>
  <editor>Alexandra <surname>Silva</surname></editor>
  <booktitle>47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)</booktitle>
  <series>Leibniz International Proceedings in Informatics (LIPIcs)</series>
  <volume>241</volume>
  <publisher>Schloss Dagstuhl Leibniz-Zentrum f&#252;r Informatik</publisher>
  <address>Dagstuhl, Germany</address>
  <pages>24:1&#8211;24:15</pages>
  <doi>10.4230/LIPIcs.MFCS.2022.24</doi>
 </citation>
 <citation type="misc" key="boothCompleteZXcalculiStabiliser2022v3">
  <author>Robert I. <surname>Booth</surname></author>
  <author>Titouan <surname>Carette</surname></author>
  <year>2023</year>
  <title>Complete ZX-calculi for the Stabiliser Fragment in Odd Prime Dimensions</title>
  <eprint>2204.12531v3</eprint>
 </citation>
 <citation type="article" key="campbellEnhancedFaultTolerantQuantum2014">
  <author>Earl T. <surname>Campbell</surname></author>
  <year>2014</year>
  <title>Enhanced Fault-Tolerant Quantum Computing in d-Level Systems</title>
  <journal>Physical Review Letters</journal>
  <volume>113</volume>
  <number>23</number>
  <pages>230501</pages>
  <doi>10.1103/PhysRevLett.113.230501</doi>
  <eprint>1406.3055</eprint>
 </citation>
 <citation type="misc" key="caretteWhenOnlyTopology2021">
  <author>Titouan <surname>Carette</surname></author>
  <year>2021</year>
  <title>When Only Topology Matters</title>
  <eprint>2102.03178</eprint>
 </citation>
 <citation type="phdthesis" key="caretteWieldingZXcalculusFlexsymmetry2021">
  <author>Titouan <surname>Carette</surname></author>
  <year>2021</year>
  <title>Wielding the ZX-calculus, Flexsymmetry, Mixed States, and Scalable Notations</title>
  <school>Loria, Universit&#233; de Lorraine</school>
  <url>https://hal.archives-ouvertes.fr/tel-03468027</url>
 </citation>
 <citation type="article" key="chiProgrammableQuditbasedQuantum2022">
  <author>Yulin <surname>Chi</surname></author>
  <author>Jieshan <surname>Huang</surname></author>
  <author>Zhanchuan <surname>Zhang</surname></author>
  <author>Jun <surname>Mao</surname></author>
  <author>Zinan <surname>Zhou</surname></author>
  <author>Xiaojiong <surname>Chen</surname></author>
  <author>Chonghao <surname>Zhai</surname></author>
  <author>Jueming <surname>Bao</surname></author>
  <author>Tianxiang <surname>Dai</surname></author>
  <author>Huihong <surname>Yuan</surname></author>
  <author>Ming <surname>Zhang</surname></author>
  <author>Daoxin <surname>Dai</surname></author>
  <author>Bo <surname>Tang</surname></author>
  <author>Yan <surname>Yang</surname></author>
  <author>Zhihua <surname>Li</surname></author>
  <author>Yunhong <surname>Ding</surname></author>
  <author>Leif K. <surname>Oxenl&#248;we</surname></author>
  <author>Mark G. <surname>Thompson</surname></author>
  <author>Jeremy L. <surname>O'Brien</surname></author>
  <author>Yan <surname>Li</surname></author>
  <author>Qihuang <surname>Gong</surname></author>
  <author>Jianwei <surname>Wang</surname></author>
  <year>2022</year>
  <title>A Programmable Qudit-Based Quantum Processor</title>
  <journal>Nature Communications</journal>
  <volume>13</volume>
  <number>1</number>
  <pages>1166</pages>
  <doi>10.1038/s41467-022-28767-x</doi>
 </citation>
 <citation type="misc" key="codsiClassicallySimulatingQuantum2023">
  <author>Julien <surname>Codsi</surname></author>
  <author>John <surname>van de Wetering</surname></author>
  <year>2023</year>
  <title>Classically Simulating Quantum Supremacy IQP Circuits through a Random Graph Approach</title>
  <eprint>2212.08609</eprint>
 </citation>
 <citation type="misc" key="coeckeFoundationsNearTermQuantum2020">
  <author>Bob <surname>Coecke</surname></author>
  <author>Giovanni <surname>de Felice</surname></author>
  <author>Konstantinos <surname>Meichanetzidis</surname></author>
  <author>Alexis <surname>Toumi</surname></author>
  <year>2020</year>
  <title>Foundations for Near-Term Quantum Natural Language Processing</title>
  <eprint>2012.03755</eprint>
 </citation>
 <citation type="inproceedings" key="coeckeInteractingQuantumObservables2008">
  <author>Bob <surname>Coecke</surname></author>
  <author>Ross <surname>Duncan</surname></author>
  <year>2008</year>
  <title>Interacting Quantum Observables</title>
  <editor>Luca <surname>Aceto</surname></editor>
  <editor>Ivan <surname>Damg&#x00e5;rd</surname></editor>
  <editor>Leslie Ann <surname>Goldberg</surname></editor>
  <editor>Magn&#250;s M. <surname>Halld&#243;rsson</surname></editor>
  <editor>Anna <surname>Ing&#243;lfsd&#243;ttir</surname></editor>
  <editor>Igor <surname>Walukiewicz</surname></editor>
  <booktitle>Automata, Languages and Programming</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <publisher>Springer</publisher>
  <address>Berlin, Heidelberg</address>
  <pages>298&#8211;310</pages>
  <doi>10.1007/978-3-540-70583-3_25</doi>
  <url>http://personal.strath.ac.uk/ross.duncan/papers/iqo-icalp.pdf</url>
 </citation>
 <citation type="article" key="coeckeInteractingQuantumObservables2011">
  <author>Bob <surname>Coecke</surname></author>
  <author>Ross <surname>Duncan</surname></author>
  <year>2011</year>
  <title>Interacting Quantum Observables: Categorical Algebra and Diagrammatics</title>
  <journal>New Journal of Physics</journal>
  <volume>13</volume>
  <number>4</number>
  <pages>043016</pages>
  <doi>10.1088/1367-2630/13/4/043016</doi>
 </citation>
 <citation type="book" key="coeckePicturingQuantumProcesses2017">
  <author>Bob <surname>Coecke</surname></author>
  <author>Aleks <surname>Kissinger</surname></author>
  <year>2017</year>
  <title>Picturing Quantum Processes</title>
  <publisher>Cambridge University Press</publisher>
  <doi>10.1017/9781316219317</doi>
 </citation>
 <citation type="misc" key="comfortAlgebraStabilizerCodes2023">
  <author>Cole <surname>Comfort</surname></author>
  <year>2023</year>
  <title>The Algebra for Stabilizer Codes</title>
  <eprint>2304.10584</eprint>
 </citation>
 <citation type="article" key="cozzolinoHighDimensionalQuantumCommunication2019">
  <author>Daniele <surname>Cozzolino</surname></author>
  <author>Beatrice <surname>Da Lio</surname></author>
  <author>Davide <surname>Bacco</surname></author>
  <author>Leif Katsuo <surname>Oxenl&#248;we</surname></author>
  <year>2019</year>
  <title>High-Dimensional Quantum Communication: Benefits, Progress, and Future Challenges</title>
  <journal>Advanced Quantum Technologies</journal>
  <volume>2</volume>
  <number>12</number>
  <pages>1900038</pages>
  <doi>10.1002/qute.201900038</doi>
 </citation>
 <citation type="article" key="cuiDiagonalGatesClifford2017">
  <author>Shawn X. <surname>Cui</surname></author>
  <author>Daniel <surname>Gottesman</surname></author>
  <author>Anirudh <surname>Krishna</surname></author>
  <year>2017</year>
  <title>Diagonal Gates in the Clifford Hierarchy</title>
  <journal>Physical Review A</journal>
  <volume>95</volume>
  <number>1</number>
  <pages>012329</pages>
  <doi>10.1103/PhysRevA.95.012329</doi>
  <eprint>1608.06596</eprint>
 </citation>
 <citation type="inproceedings" key="debeaudrapWelltemperedZXZH2021">
  <author>Niel <surname>de Beaudrap</surname></author>
  <year>2021</year>
  <title>Well-Tempered ZX and ZH Calculi</title>
  <editor>Beno&#238;t <surname>Valiron</surname></editor>
  <editor>Shane <surname>Mansfield</surname></editor>
  <editor>Pablo <surname>Arrighi</surname></editor>
  <editor>Prakash <surname>Panangaden</surname></editor>
  <booktitle>Proceedings 17th International Conference on Quantum Physics and Logic</booktitle>
  <series>Electronic Proceedings in Theoretical Computer Science</series>
  <volume>340</volume>
  <publisher>Open Publishing Association</publisher>
  <address>Paris, France</address>
  <pages>13&#8211;45</pages>
  <doi>10.4204/EPTCS.340.2</doi>
 </citation>
 <citation type="misc" key="debeaudrapSimpleZXZH2023">
  <author>Niel <surname>de Beaudrap</surname></author>
  <author>Richard D. P. <surname>East</surname></author>
  <year>2023</year>
  <title>Simple ZX and ZH Calculi for Arbitrary Finite Dimensions, via Discrete Integrals</title>
  <eprint>2304.03310</eprint>
 </citation>
 <citation type="article" key="debeaudrapZXCalculusLanguage2020">
  <author>Niel <surname>de Beaudrap</surname></author>
  <author>Dominic <surname>Horsman</surname></author>
  <year>2020</year>
  <title>The ZX Calculus Is a Language for Surface Code Lattice Surgery</title>
  <journal>Quantum</journal>
  <volume>4</volume>
  <pages>218</pages>
  <doi>10.22331/q-2020-01-09-218</doi>
 </citation>
 <citation type="misc" key="defeliceLightmatterInteractionZXW2023">
  <author>Giovanni <surname>de Felice</surname></author>
  <author>Razin A. <surname>Shaikh</surname></author>
  <author>Boldizs&#225;r <surname>Po&#243;r</surname></author>
  <author>Lia <surname>Yeh</surname></author>
  <author>Quanlong <surname>Wang</surname></author>
  <author>Bob <surname>Coecke</surname></author>
  <year>2023</year>
  <title>Light-Matter Interaction in the ZXW Calculus</title>
  <eprint>2306.02114</eprint>
 </citation>
 <citation type="article" key="desilvaEfficientQuantumGate2021">
  <author>Nadish <surname>de Silva</surname></author>
  <year>2021</year>
  <title>Efficient Quantum Gate Teleportation in Higher Dimensions</title>
  <journal>Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences</journal>
  <volume>477</volume>
  <number>2251</number>
  <pages>20200865</pages>
  <doi>10.1098/rspa.2020.0865</doi>
  <eprint>2011.00127</eprint>
 </citation>
 <citation type="article" key="dehaeneCliffordGroupStabilizer2003">
  <author>Jeroen <surname>Dehaene</surname></author>
  <author>Bart <surname>De Moor</surname></author>
  <year>2003</year>
  <title>Clifford Group, Stabilizer States, and Linear and Quadratic Operations over GF(2)</title>
  <journal>Physical Review A</journal>
  <volume>68</volume>
  <number>4</number>
  <pages>042318</pages>
  <doi>10.1103/PhysRevA.68.042318</doi>
  <eprint>quant-ph/0304125</eprint>
 </citation>
 <citation type="article" key="duncanGraphtheoreticSimplificationQuantum2020">
  <author>Ross <surname>Duncan</surname></author>
  <author>Aleks <surname>Kissinger</surname></author>
  <author>Simon <surname>Perdrix</surname></author>
  <author>John <surname>van de Wetering</surname></author>
  <year>2020</year>
  <title>Graph-Theoretic Simplification of Quantum Circuits with the ZX-calculus</title>
  <journal>Quantum</journal>
  <volume>4</volume>
  <pages>279</pages>
  <doi>10.22331/q-2020-06-04-279</doi>
 </citation>
 <citation type="inproceedings" key="duncanVerifyingSteaneCode2014">
  <author>Ross <surname>Duncan</surname></author>
  <author>Maxime <surname>Lucas</surname></author>
  <year>2014</year>
  <title>Verifying the Steane Code with Quantomatic</title>
  <editor>Bob <surname>Coecke</surname></editor>
  <editor>Matty <surname>Hoban</surname></editor>
  <booktitle>Proceedings of the 10th International Workshop on Quantum Physics and Logic</booktitle>
  <series>Electronic Proceedings in Theoretical Computer Science</series>
  <volume>171</volume>
  <publisher>Open Publishing Association</publisher>
  <address>Castelldefels (Barcelona), Spain</address>
  <pages>33&#8211;49</pages>
  <doi>10.4204/EPTCS.171.4</doi>
 </citation>
 <citation type="inproceedings" key="duncanGraphStatesNecessity2009">
  <author>Ross <surname>Duncan</surname></author>
  <author>Simon <surname>Perdrix</surname></author>
  <year>2009</year>
  <title>Graph States and the Necessity of Euler Decomposition</title>
  <editor>Klaus <surname>Ambos-Spies</surname></editor>
  <editor>Benedikt <surname>L&#246;we</surname></editor>
  <editor>Wolfgang <surname>Merkle</surname></editor>
  <booktitle>Mathematical Theory and Computational Practice</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <publisher>Springer</publisher>
  <address>Berlin, Heidelberg</address>
  <pages>167&#8211;177</pages>
  <doi>10.1007/978-3-642-03073-4_18</doi>
 </citation>
 <citation type="inproceedings" key="duncanRewritingMeasurementBasedQuantum2010">
  <author>Ross <surname>Duncan</surname></author>
  <author>Simon <surname>Perdrix</surname></author>
  <year>2010</year>
  <title>Rewriting Measurement-Based Quantum Computations with Generalised Flow</title>
  <editor>Samson <surname>Abramsky</surname></editor>
  <editor>Cyril <surname>Gavoille</surname></editor>
  <editor>Claude <surname>Kirchner</surname></editor>
  <editor>Friedhelm <surname>Meyer auf der Heide</surname></editor>
  <editor>Paul G. <surname>Spirakis</surname></editor>
  <booktitle>Automata, Languages and Programming</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <publisher>Springer</publisher>
  <address>Berlin, Heidelberg</address>
  <pages>285&#8211;296</pages>
  <doi>10.1007/978-3-642-14162-1_24</doi>
 </citation>
 <citation type="inproceedings" key="garvieVerifyingSmallestInteresting2018">
  <author>Liam <surname>Garvie</surname></author>
  <author>Ross <surname>Duncan</surname></author>
  <year>2018</year>
  <title>Verifying the Smallest Interesting Colour Code with Quantomatic</title>
  <editor>Bob <surname>Coecke</surname></editor>
  <editor>Aleks <surname>Kissinger</surname></editor>
  <booktitle>Proceedings 14th International Conference on Quantum Physics and Logic</booktitle>
  <series>Electronic Proceedings in Theoretical Computer Science</series>
  <volume>266</volume>
  <publisher>Open Publishing Association</publisher>
  <address>Nijmegen, The Netherlands</address>
  <pages>147&#8211;163</pages>
  <doi>10.4204/EPTCS.266.10</doi>
 </citation>
 <citation type="inproceedings" key="gokhaleAsymptoticImprovementsQuantum2019">
  <author>Pranav <surname>Gokhale</surname></author>
  <author>Jonathan M. <surname>Baker</surname></author>
  <author>Casey <surname>Duckering</surname></author>
  <author>Natalie C. <surname>Brown</surname></author>
  <author>Kenneth R. <surname>Brown</surname></author>
  <author>Frederic T. <surname>Chong</surname></author>
  <year>2019</year>
  <title>Asymptotic Improvements to Quantum Circuits via Qutrits</title>
  <booktitle>Proceedings of the 46th International Symposium on Computer Architecture</booktitle>
  <series>ISCA '19</series>
  <publisher>Association for Computing Machinery</publisher>
  <address>New York, NY, USA</address>
  <pages>554&#8211;566</pages>
  <doi>10.1145/3307650.3322253</doi>
 </citation>
 <citation type="misc" key="gongEquivalenceLocalComplementation2017">
  <author>Xiaoyan <surname>Gong</surname></author>
  <author>Quanlong <surname>Wang</surname></author>
  <year>2017</year>
  <title>Equivalence of Local Complementation and Euler Decomposition in the Qutrit ZX-calculus</title>
  <eprint>1704.05955</eprint>
 </citation>
 <citation type="article" key="gossHighfidelityQutritEntangling2022">
  <author>Noah <surname>Goss</surname></author>
  <author>Alexis <surname>Morvan</surname></author>
  <author>Brian <surname>Marinelli</surname></author>
  <author>Bradley K. <surname>Mitchell</surname></author>
  <author>Long B. <surname>Nguyen</surname></author>
  <author>Ravi K. <surname>Naik</surname></author>
  <author>Larry <surname>Chen</surname></author>
  <author>Christian <surname>J&#252;nger</surname></author>
  <author>John Mark <surname>Kreikebaum</surname></author>
  <author>David I. <surname>Santiago</surname></author>
  <author>Joel J. <surname>Wallman</surname></author>
  <author>Irfan <surname>Siddiqi</surname></author>
  <year>2022</year>
  <title>High-Fidelity Qutrit Entangling Gates for Superconducting Circuits</title>
  <journal>Nature Communications</journal>
  <volume>13</volume>
  <number>1</number>
  <pages>7481</pages>
  <doi>10.1038/s41467-022-34851-z</doi>
 </citation>
 <citation type="misc" key="gottesmanHeisenbergRepresentationQuantum1998">
  <author>Daniel <surname>Gottesman</surname></author>
  <year>1998</year>
  <title>The Heisenberg Representation of Quantum Computers</title>
  <eprint>quant-ph/9807006</eprint>
 </citation>
 <citation type="inproceedings" key="gottesmanFaultTolerantQuantumComputation1999">
  <author>Daniel <surname>Gottesman</surname></author>
  <year>1999</year>
  <title>Fault-Tolerant Quantum Computation with Higher-Dimensional Systems</title>
  <editor>Colin P. <surname>Williams</surname></editor>
  <booktitle>Quantum Computing and Quantum Communications</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <publisher>Springer</publisher>
  <address>Berlin, Heidelberg</address>
  <pages>302&#8211;313</pages>
  <doi>10.1007/3-540-49208-9_27</doi>
  <eprint>quant-ph/9802007</eprint>
 </citation>
 <citation type="book" key="heunenCategoriesQuantumTheory2019">
  <author>Chris <surname>Heunen</surname></author>
  <author>Jamie <surname>Vicary</surname></author>
  <year>2019</year>
  <title>Categories for Quantum Theory: An Introduction</title>
  <publisher>Oxford University Press</publisher>
  <doi>10.1093/oso/9780198739623.001.0001</doi>
 </citation>
 <citation type="misc" key="hillRealizationArbitraryDoublycontrolled2021">
  <author>Alexander D. <surname>Hill</surname></author>
  <author>Mark J. <surname>Hodson</surname></author>
  <author>Nicolas <surname>Didier</surname></author>
  <author>Matthew J. <surname>Reagor</surname></author>
  <year>2021</year>
  <title>Realization of Arbitrary Doubly-Controlled Quantum Phase Gates</title>
  <eprint>2108.01652</eprint>
 </citation>
 <citation type="article" key="hrmoNativeQuditEntanglement2023">
  <author>Pavel <surname>Hrmo</surname></author>
  <author>Benjamin <surname>Wilhelm</surname></author>
  <author>Lukas <surname>Gerster</surname></author>
  <author>Martin W. <surname>van Mourik</surname></author>
  <author>Marcus <surname>Huber</surname></author>
  <author>Rainer <surname>Blatt</surname></author>
  <author>Philipp <surname>Schindler</surname></author>
  <author>Thomas <surname>Monz</surname></author>
  <author>Martin <surname>Ringbauer</surname></author>
  <year>2023</year>
  <title>Native Qudit Entanglement in a Trapped Ion Quantum Processor</title>
  <journal>Nature Communications</journal>
  <volume>14</volume>
  <number>1</number>
  <pages>2242</pages>
  <doi>10.1038/s41467-023-37375-2</doi>
 </citation>
 <citation type="inproceedings" key="jeandelZXCalculusCyclotomicSupplementarity2017">
  <author>Emmanuel <surname>Jeandel</surname></author>
  <author>Simon <surname>Perdrix</surname></author>
  <author>Renaud <surname>Vilmart</surname></author>
  <author>Quanlong <surname>Wang</surname></author>
  <year>2017</year>
  <title>ZX-Calculus: Cyclotomic Supplementarity and Incompleteness for Clifford+T Quantum Mechanics</title>
  <editor>Kim G. <surname>Larsen</surname></editor>
  <editor>Hans L. <surname>Bodlaender</surname></editor>
  <editor>Jean-Francois <surname>Raskin</surname></editor>
  <booktitle>42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)</booktitle>
  <series>Leibniz International Proceedings in Informatics (LIPIcs)</series>
  <volume>83</volume>
  <publisher>Schloss DagstuhlLeibniz-Zentrum fuer Informatik</publisher>
  <address>Dagstuhl, Germany</address>
  <pages>11:1&#8211;11:13</pages>
  <doi>10.4230/LIPIcs.MFCS.2017.11</doi>
 </citation>
 <citation type="misc" key="khesinGraphicalQuantumCliffordencoder2023">
  <author>Andrey Boris <surname>Khesin</surname></author>
  <author>Jonathan Z. <surname>Lu</surname></author>
  <author>Peter W. <surname>Shor</surname></author>
  <year>2023</year>
  <title>Graphical Quantum Clifford-encoder Compilers from the ZX Calculus</title>
  <eprint>2301.02356</eprint>
 </citation>
 <citation type="misc" key="kissingerPhasefreeZXDiagrams2022">
  <author>Aleks <surname>Kissinger</surname></author>
  <year>2022</year>
  <title>Phase-free ZX diagrams are CSS codes (...or how to graphically grok the surface code)</title>
  <eprint>2204.14038</eprint>
 </citation>
 <citation type="inproceedings" key="kissingerPyZXLargeScale2020">
  <author>Aleks <surname>Kissinger</surname></author>
  <author>John <surname>van de Wetering</surname></author>
  <year>2020</year>
  <title>PyZX: Large Scale Automated Diagrammatic Reasoning</title>
  <booktitle>Proceedings 16th International Conference on Quantum Physics and Logic</booktitle>
  <series>Electronic Proceedings in Theoretical Computer Science</series>
  <volume>318</volume>
  <publisher>Open Publishing Association</publisher>
  <address>CA, USA.</address>
  <pages>229&#8211;241</pages>
  <doi>10.4204/EPTCS.318.14</doi>
 </citation>
 <citation type="article" key="kissingerReducingNumberNonClifford2020">
  <author>Aleks <surname>Kissinger</surname></author>
  <author>John <surname>van de Wetering</surname></author>
  <year>2020</year>
  <title>Reducing the Number of Non-Clifford Gates in Quantum Circuits</title>
  <journal>Physical Review A</journal>
  <volume>102</volume>
  <number>2</number>
  <pages>022406</pages>
  <doi>10.1103/PhysRevA.102.022406</doi>
  <eprint>1903.10477</eprint>
 </citation>
 <citation type="inproceedings" key="kissingerClassicalSimulationQuantum2022">
  <author>Aleks <surname>Kissinger</surname></author>
  <author>John <surname>van de Wetering</surname></author>
  <author>Renaud <surname>Vilmart</surname></author>
  <year>2022</year>
  <title>Classical Simulation of Quantum Circuits with Partial and Graphical Stabiliser Decompositions</title>
  <editor>Fran&#x00e7;ois <surname>Le Gall</surname></editor>
  <editor>Tomoyuki <surname>Morimae</surname></editor>
  <booktitle>17th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2022)</booktitle>
  <series>Leibniz International Proceedings in Informatics (LIPIcs)</series>
  <volume>232</volume>
  <publisher>Schloss Dagstuhl Leibniz-Zentrum f&#252;r Informatik</publisher>
  <address>Dagstuhl, Germany</address>
  <pages>5:1&#8211;5:13</pages>
  <doi>10.4230/LIPIcs.TQC.2022.5</doi>
 </citation>
 <citation type="misc" key="laakkonenGraphicalSATAlgorithm2022">
  <author>Tuomas <surname>Laakkonen</surname></author>
  <author>Konstantinos <surname>Meichanetzidis</surname></author>
  <author>John <surname>van de Wetering</surname></author>
  <year>2022</year>
  <title>A Graphical &#35;SAT Algorithm for Formulae with Small Clause Density</title>
  <eprint>2212.08048</eprint>
 </citation>
 <citation type="misc" key="mcelvanneyCompleteFlowpreservingRewrite2022">
  <author>Tommy <surname>McElvanney</surname></author>
  <author>Miriam <surname>Backens</surname></author>
  <year>2022</year>
  <title>Complete Flow-Preserving Rewrite Rules for MBQC Patterns with Pauli Measurements</title>
  <eprint>2205.02009</eprint>
 </citation>
 <citation type="inproceedings" key="meichanetzidisQuantumNaturalLanguage2021">
  <author>Konstantinos <surname>Meichanetzidis</surname></author>
  <author>Stefano <surname>Gogioso</surname></author>
  <author>Giovanni <surname>de Felice</surname></author>
  <author>Nicol&#242; <surname>Chiappori</surname></author>
  <author>Alexis <surname>Toumi</surname></author>
  <author>Bob <surname>Coecke</surname></author>
  <year>2021</year>
  <title>Quantum Natural Language Processing on Near-Term Quantum Computers</title>
  <editor>Beno&#238;t <surname>Valiron</surname></editor>
  <editor>Shane <surname>Mansfield</surname></editor>
  <editor>Pablo <surname>Arrighi</surname></editor>
  <editor>Prakash <surname>Panangaden</surname></editor>
  <booktitle>Proceedings 17th International Conference on Quantum Physics and Logic</booktitle>
  <series>Electronic Proceedings in Theoretical Computer Science</series>
  <volume>340</volume>
  <publisher>Open Publishing Association</publisher>
  <address>Paris, France</address>
  <pages>213&#8211;229</pages>
  <doi>10.4204/EPTCS.340.11</doi>
 </citation>
 <citation type="article" key="nikolaevaDecomposingGeneralizedToffoli2022">
  <author>A. S. <surname>Nikolaeva</surname></author>
  <author>E. O. <surname>Kiktenko</surname></author>
  <author>A. K. <surname>Fedorov</surname></author>
  <year>2022</year>
  <title>Decomposing the Generalized Toffoli Gate with Qutrits</title>
  <journal>Physical Review A</journal>
  <volume>105</volume>
  <number>3</number>
  <pages>032621</pages>
  <doi>10.1103/PhysRevA.105.032621</doi>
  <eprint>2112.14535</eprint>
 </citation>
 <citation type="inproceedings" key="perdrixSupplementarityNecessaryQuantum2016">
  <author>Simon <surname>Perdrix</surname></author>
  <author>Quanlong <surname>Wang</surname></author>
  <year>2016</year>
  <title>Supplementarity Is Necessary for Quantum Diagram Reasoning</title>
  <editor>Piotr <surname>Faliszewski</surname></editor>
  <editor>Anca <surname>Muscholl</surname></editor>
  <editor>Rolf <surname>Niedermeier</surname></editor>
  <booktitle>41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)</booktitle>
  <series>Leibniz International Proceedings in Informatics (LIPIcs)</series>
  <volume>58</volume>
  <publisher>Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik</publisher>
  <address>Dagstuhl, Germany</address>
  <pages>76:1&#8211;76:14</pages>
  <doi>10.4230/LIPIcs.MFCS.2016.76</doi>
 </citation>
 <citation type="inproceedings" key="poorCompletenessArbitraryFinite2023">
  <author>Boldizs&#225;r <surname>Po&#243;r</surname></author>
  <author>Quanlong <surname>Wang</surname></author>
  <author>Razin A. <surname>Shaikh</surname></author>
  <author>Lia <surname>Yeh</surname></author>
  <author>Richie <surname>Yeung</surname></author>
  <author>Bob <surname>Coecke</surname></author>
  <year>2023</year>
  <title>Completeness for Arbitrary Finite Dimensions of ZXW-calculus, a Unifying Calculus</title>
  <booktitle>2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)</booktitle>
  <address>Boston, MA, USA</address>
  <pages>1&#8211;14</pages>
  <doi>10.1109/LICS56636.2023.10175672</doi>
  <eprint>2302.12135</eprint>
 </citation>
 <citation type="mastersthesis" key="poorUniqueNormalForm2022">
  <author>Boldizsár <surname>Poór</surname></author>
  <year>2022</year>
  <title>A Unique Normal Form for Prime-Dimensional Qudit Clifford ZX-calculus</title>
  <school>University of Oxford</school>
  <url>https://www.cs.ox.ac.uk/people/aleks.kissinger/theses/poor-thesis.pdf</url>
 </citation>
 <citation type="inproceedings" key="ranchinDepictingQuditQuantum2014">
  <author>Andr&#233; <surname>Ranchin</surname></author>
  <year>2014</year>
  <title>Depicting Qudit Quantum Mechanics and Mutually Unbiased Qudit Theories</title>
  <editor>Bob <surname>Coecke</surname></editor>
  <editor>Ichiro <surname>Hasuo</surname></editor>
  <editor>Prakash <surname>Panangaden</surname></editor>
  <booktitle>Proceedings of the 11th Workshop on Quantum Physics and Logic</booktitle>
  <series>Electronic Proceedings in Theoretical Computer Science</series>
  <volume>172</volume>
  <publisher>Open Publishing Association</publisher>
  <address>Kyoto, Japan</address>
  <pages>68&#8211;91</pages>
  <doi>10.4204/EPTCS.172.6</doi>
 </citation>
 <citation type="article" key="ringbauerUniversalQuditQuantum2022">
  <author>Martin <surname>Ringbauer</surname></author>
  <author>Michael <surname>Meth</surname></author>
  <author>Lukas <surname>Postler</surname></author>
  <author>Roman <surname>Stricker</surname></author>
  <author>Rainer <surname>Blatt</surname></author>
  <author>Philipp <surname>Schindler</surname></author>
  <author>Thomas <surname>Monz</surname></author>
  <year>2022</year>
  <title>A Universal Qudit Quantum Processor with Trapped Ions</title>
  <journal>Nature Physics</journal>
  <volume>18</volume>
  <number>9</number>
  <pages>1053&#8211;1057</pages>
  <doi>10.1038/s41567-022-01658-0</doi>
  <eprint>2109.06903</eprint>
 </citation>
 <citation type="misc" key="shaikhHowSumExponentiate2022">
  <author>Razin A. <surname>Shaikh</surname></author>
  <author>Quanlong <surname>Wang</surname></author>
  <author>Richie <surname>Yeung</surname></author>
  <year>2022</year>
  <title>How to Sum and Exponentiate Hamiltonians in ZXW Calculus</title>
  <eprint>2212.04462</eprint>
 </citation>
 <citation type="misc" key="townsend-teagueSimplificationStrategiesQutrit2022">
  <author>Alex <surname>Townsend-Teague</surname></author>
  <author>Konstantinos <surname>Meichanetzidis</surname></author>
  <year>2022</year>
  <title>Simplification Strategies for the Qutrit ZX-Calculus</title>
  <eprint>2103.06914</eprint>
 </citation>
 <citation type="misc" key="vandeweteringPhaseGadgetCompilation2022">
  <author>John <surname>van de Wetering</surname></author>
  <author>Lia <surname>Yeh</surname></author>
  <year>2022</year>
  <title>Phase Gadget Compilation for Diagonal Qutrit Gates</title>
  <eprint>2204.13681</eprint>
 </citation>
 <citation type="article" key="vandennestClassicalSimulationQuantum2010">
  <author>Maarten <surname>Van den Nest</surname></author>
  <year>2010</year>
  <title>Classical Simulation of Quantum Computation, the Gottesman-Knill Theorem, and Slightly Beyond</title>
  <journal>Quantum Information &#38; Computation</journal>
  <volume>10</volume>
  <number>3&#38;4</number>
  <pages>258&#8211;271</pages>
  <doi>10.26421/QIC10.3-4-6</doi>
  <eprint>0811.0898</eprint>
 </citation>
 <citation type="inproceedings" key="wangQutritZXcalculusComplete2018">
  <author>Quanlong <surname>Wang</surname></author>
  <year>2018</year>
  <title>Qutrit ZX-calculus Is Complete for Stabilizer Quantum Mechanics</title>
  <editor>Bob <surname>Coecke</surname></editor>
  <editor>Aleks <surname>Kissinger</surname></editor>
  <booktitle>Proceedings 14th International Conference on Quantum Physics and Logic</booktitle>
  <series>Electronic Proceedings in Theoretical Computer Science</series>
  <volume>266</volume>
  <publisher>Open Publishing Association</publisher>
  <address>Nijmegen, The Netherlands</address>
  <pages>58&#8211;70</pages>
  <doi>10.4204/EPTCS.266.3</doi>
 </citation>
 <citation type="misc" key="wangQufiniteZXcalculusUnified2022">
  <author>Quanlong <surname>Wang</surname></author>
  <year>2022</year>
  <title>Qufinite ZX-calculus: A Unified Framework of Qudit ZX-calculi</title>
  <eprint>2104.06429</eprint>
 </citation>
 <citation type="misc" key="wangDifferentiatingIntegratingZX2022">
  <author>Quanlong <surname>Wang</surname></author>
  <author>Richie <surname>Yeung</surname></author>
  <author>Mark <surname>Koch</surname></author>
  <year>2022</year>
  <title>Differentiating and Integrating ZX Diagrams with Applications to Quantum Machine Learning</title>
  <eprint>2201.13250</eprint>
 </citation>
 <citation type="article" key="wangQuditsHighDimensionalQuantum2020">
  <author>Yuchen <surname>Wang</surname></author>
  <author>Zixuan <surname>Hu</surname></author>
  <author>Barry C. <surname>Sanders</surname></author>
  <author>Sabre <surname>Kais</surname></author>
  <year>2020</year>
  <title>Qudits and High-Dimensional Quantum Computing</title>
  <journal>Frontiers in Physics</journal>
  <volume>8</volume>
  <doi>10.3389/fphy.2020.589504</doi>
 </citation>
 <citation type="article" key="yeCircuitQEDSinglestep2018">
  <author>Biaoliang <surname>Ye</surname></author>
  <author>Zhen-Fei <surname>Zheng</surname></author>
  <author>Yu <surname>Zhang</surname></author>
  <author>Chui-Ping <surname>Yang</surname></author>
  <year>2018</year>
  <title>Circuit QED: single-step realization of a multiqubit controlled phase gate with one microwave photonic qubit simultaneously controlling n-1 microwave photonic qubits</title>
  <journal>Optics Express</journal>
  <volume>26</volume>
  <number>23</number>
  <pages>30689&#8211;30702</pages>
  <doi>10.1364/OE.26.030689</doi>
 </citation>
 <citation type="inproceedings" key="yehConstructingAllQutrit2022">
  <author>Lia <surname>Yeh</surname></author>
  <author>John <surname>van de Wetering</surname></author>
  <year>2022</year>
  <title>Constructing All Qutrit Controlled Clifford+T Gates in Clifford+T</title>
  <editor>Claudio Antares <surname>Mezzina</surname></editor>
  <editor>Krzysztof <surname>Podlaski</surname></editor>
  <booktitle>Reversible Computation</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <publisher>Springer International Publishing</publisher>
  <address>Cham</address>
  <pages>28&#8211;50</pages>
  <doi>10.1007/978-3-031-09005-9_3</doi>
  <eprint>2204.00552</eprint>
 </citation>
 <citation type="article" key="yurtalanImplementationWalshHadamardGate2020">
  <author>M. A. <surname>Yurtalan</surname></author>
  <author>J. <surname>Shi</surname></author>
  <author>M. <surname>Kononenko</surname></author>
  <author>A. <surname>Lupascu</surname></author>
  <author>S. <surname>Ashhab</surname></author>
  <year>2020</year>
  <title>Implementation of a Walsh-Hadamard Gate in a Superconducting Qutrit</title>
  <journal>Physical Review Letters</journal>
  <volume>125</volume>
  <number>18</number>
  <pages>180504</pages>
  <doi>10.1103/PhysRevLett.125.180504</doi>
  <eprint>2003.04879</eprint>
 </citation>
 <citation type="misc" key="yutsumuraEachElementFinite2017">
  <author><surname>Yutsumura</surname></author>
  <year>2017</year>
  <title>Each Element in a Finite Field Is the Sum of Two Squares</title>
  <url>https://yutsumura.com/each-element-in-a-finite-field-is-the-sum-of-two-squares</url>
 </citation>
 <citation type="phdthesis" key="zanasiInteractingHopfAlgebras2018">
  <author>Fabio <surname>Zanasi</surname></author>
  <year>2018</year>
  <title>Interacting Hopf Algebras: The Theory of Linear Systems</title>
  <school>Ecole Normale Superieure de Lyon</school>
  <eprint>1805.03032</eprint>
 </citation>
 <citation type="article" key="zhaoAnalyzingBarrenPlateau2021">
  <author>Chen <surname>Zhao</surname></author>
  <author>Xiao-Shan <surname>Gao</surname></author>
  <year>2021</year>
  <title>Analyzing the Barren Plateau Phenomenon in Training Quantum Neural Networks with the ZX-calculus</title>
  <journal>Quantum</journal>
  <volume>5</volume>
  <pages>466</pages>
  <doi>10.22331/q-2021-06-04-466</doi>
 </citation>
</bibliography>
