{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T16:00:33Z","timestamp":1780675233727,"version":"3.54.1"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1109\/lics.2019.8785765","type":"proceedings-article","created":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T01:15:55Z","timestamp":1565054155000},"page":"1-10","source":"Crossref","is-referenced-by-count":30,"title":["A Near-Minimal Axiomatisation of ZX-Calculus for Pure Qubit Quantum Mechanics"],"prefix":"10.1109","author":[{"given":"Renaud","family":"Vilmart","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-11(2:10)2015"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.172.20"},{"key":"ref10","article-title":"The ZX-calculus is a language for surface code lattice surgery","volume":"abs 1704 8670","author":"de beaudrap","year":"2017","journal-title":"CoRR"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199646296.003.0003"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2934550"},{"key":"ref13","first-page":"147","article-title":"Verifying the smallest interesting colour code with quantomatic","volume":"266","author":"duncan","year":"2017","journal-title":"Proceedings 14th International Conference on Quantum Physics and Logic"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.171.4"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03073-4_18"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14162-1_24"},{"key":"ref17","first-page":"50","article-title":"Pivoting makes the ZX-calculus complete for real stabilizers","author":"duncan","year":"2013","journal-title":"QPL 2013 ser Electronic Proceedings in Theoretical Computer Science"},{"key":"ref18","first-page":"189","article-title":"Formulae generales pro translatione quacunque corporum rigidorum","volume":"20","author":"euler","year":"1776","journal-title":"Commentarii academiae scientarum Petropolitanae"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1145\/3209108.3209128","article-title":"Two complete axiomatisations of pure-state qubit quantum computing","author":"hadzihasanovic","year":"2018","journal-title":"Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science ser LICS '18"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21401-6_22"},{"key":"ref4","first-page":"1","article-title":"A complete graphical calculus for Spekkens' toy bit theory","author":"backens","year":"2014","journal-title":"Foundations of Physics"},{"key":"ref27","author":"kissinger","year":"2018","journal-title":"Pyzx"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.172.21"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/13\/4\/043016"},{"key":"ref29","first-page":"76:1","article-title":"Supplementarity is necessary for quantum diagram reasoning","volume":"58","author":"perdrix","year":"2016","journal-title":"41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) ser Leibniz International Proceedings in Informatics (LIPIcs)"},{"key":"ref5","author":"chancellor","year":"2016","journal-title":"Graphical structures for design and verification of quantum error correction"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129512000047"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1017\/9781316219317"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/16\/9\/093021"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99498-7_10"},{"key":"ref1","author":"backens","year":"2017","journal-title":"Towards a Minimal Stabilizer ZX-calculus"},{"key":"ref20","author":"hillebrand","year":"2011","journal-title":"Quantum Protocols Involving Multiparticle Entanglement and Their Representations in the Zx-calculus"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/13\/9\/095011"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817.009"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3209108.3209139"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1145\/3209108.3209131","article-title":"A complete axiomatisation of the ZX-calculus for Clifford+T quantum mechanics","author":"jeandel","year":"2018","journal-title":"Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science ser LICS '18"},{"key":"ref26","author":"kissinger","year":"2011","journal-title":"Quantomatic"},{"key":"ref25","first-page":"11:1","article-title":"ZX-calculus: Cyclotomic supplementarity and incompleteness for Clifford+T quantum mechanics","volume":"83","author":"jeandel","year":"2017","journal-title":"42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017) ser Leibniz International Proceedings in Informatics (LIPIcs)"}],"event":{"name":"2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","location":"Vancouver, BC, Canada","start":{"date-parts":[[2019,6,24]]},"end":{"date-parts":[[2019,6,27]]}},"container-title":["2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8765678\/8785654\/08785765.pdf?arnumber=8785765","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T20:18:53Z","timestamp":1658261933000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8785765\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/lics.2019.8785765","relation":{},"subject":[],"published":{"date-parts":[[2019,6]]}}}