{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T16:24:04Z","timestamp":1768926244972,"version":"3.49.0"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"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":[[2021,6,29]]},"DOI":"10.1109\/lics52264.2021.9470553","type":"proceedings-article","created":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T20:14:07Z","timestamp":1625688847000},"page":"1-13","source":"Crossref","is-referenced-by-count":4,"title":["Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory"],"prefix":"10.1109","author":[{"given":"Titouan","family":"Carette","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"de Visme","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Perdrix","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Comb diagrams for discrete-time feedback","author":"rom\u00e1n","year":"2020"},{"key":"ref11","first-page":"171","article-title":"A First-order Logic for String Diagrams","volume":"35","author":"kissinger","year":"0"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1090\/psapm\/071\/599"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2016.02.007"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.236.4"},{"key":"ref15","article-title":"Reversible quantum cellular automata","author":"schumacher","year":"2004"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2010.05.004"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44584-6_30"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1119\/1.1463744"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.2307\/2032342"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.102.022406"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.22331\/q-2020-06-04-279"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"218","DOI":"10.22331\/q-2020-01-09-218","article-title":"The ZX calculus is a language for surface code lattice surgery","volume":"4","author":"de beaudrap","year":"2020","journal-title":"Quantum"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.10.041030"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.72.062323"},{"key":"ref7","first-page":"55","article-title":"SZX-calculus: Scalable graphical quantum reasoning","volume":"138","author":"carette","year":"2019","journal-title":"MFCS 2019-44th International Symposium on Mathematical Foundations of Computer Science"},{"key":"ref2","article-title":"Completeness of graphical languages for mixed states quantum mechanics","author":"carette","year":"2019","journal-title":"International Colloquium on Automata Languages and Programming (ICALP’19)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2019.8785670"},{"key":"ref1","article-title":"A near-optimal axiomatisation of ZX-calculus for pure qubit quantum mechanics","author":"vilmart","year":"0","journal-title":"Proceedings of the 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2017.8005095"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/16\/9\/093021"},{"key":"ref21","article-title":"Range categories i: General theory","volume":"26","author":"cockett","year":"2012","journal-title":"Theory and Applications of Categories [electronic only]"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3209108.3209128"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3209108.3209131"},{"key":"ref26","article-title":"Interacting hopf algebras: the theory of linear systems","author":"zanasi","year":"2018"},{"key":"ref25","article-title":"Diagrammatic semantics for digital circuits","author":"ghica","year":"0"}],"event":{"name":"2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","location":"Rome, Italy","start":{"date-parts":[[2021,6,29]]},"end":{"date-parts":[[2021,7,2]]}},"container-title":["2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9470497\/9470501\/09470553.pdf?arnumber=9470553","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:46:20Z","timestamp":1652197580000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9470553\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,29]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/lics52264.2021.9470553","relation":{},"subject":[],"published":{"date-parts":[[2021,6,29]]}}}