{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T20:09:10Z","timestamp":1768162150664,"version":"3.49.0"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032159809","type":"print"},{"value":"9783032159816","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-15981-6_4","type":"book-chapter","created":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T17:13:30Z","timestamp":1768151610000},"page":"57-76","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Graph Rewriting Language as\u00a0a\u00a0Platform for\u00a0Quantum Diagrammatic Calculi"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-1598-8538","authenticated-orcid":false,"given":"Kayo","family":"Tei","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0008-5740-3165","authenticated-orcid":false,"given":"Haruto","family":"Mishina","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1106-4491","authenticated-orcid":false,"given":"Naoki","family":"Yamamoto","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3424-1844","authenticated-orcid":false,"given":"Kazunori","family":"Ueda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,12]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Abramsky, S., Coecke, B.: Categorical quantum mechanics. In: Engesser, K., Gabbay, D.M., Lehmann, D. (eds.) Handbook of Quantum Logic and Quantum Structures, pp. 261\u2013323. Elsevier, Amsterdam (2009). https:\/\/doi.org\/10.1016\/B978-0-444-52869-8.50010-4","DOI":"10.1016\/B978-0-444-52869-8.50010-4"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Amy, M.: Towards large-scale functional verification of universal quantum circuits. In: 15th International Conference on Quantum Physics and Logic (QPL 2018). EPTCS, vol.\u00a0287, pp. 1\u201321. Open Publishing Association (2019). https:\/\/doi.org\/10.4204\/EPTCS.287.1","DOI":"10.4204\/EPTCS.287.1"},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"Ayano, T., Hori, T., Iwasawa, H., Ogawa, S., Ueda, K.: LMNtal model checking using an integrated development environment. Comput. Softw. 27(4), 4_197\u20134_214 (2010). https:\/\/doi.org\/10.11309\/jssst.27.4_197","DOI":"10.11309\/jssst.27.4_197"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Backens, M., Kissinger, A.: ZH: a complete graphical calculus for quantum computations involving classical non-linearity. In: 15th International Conference on Quantum Physics and Logic (QPL 2018). EPTCS, vol.\u00a0287, pp. 23\u201342. Open Publishing Association (2019). https:\/\/doi.org\/10.4204\/eptcs.287.2","DOI":"10.4204\/eptcs.287.2"},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Backens, M., Miller-Bakewell, H., de\u00a0Felice, G., Lobski, L., van\u00a0de Wetering, J.: There and back again: a circuit extraction tale. Quantum 5, 421 (2021). https:\/\/doi.org\/10.22331\/q-2021-03-25-421","DOI":"10.22331\/q-2021-03-25-421"},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Bennett, C.H., Brassard, G., Cr\u00e9peau, C., Jozsa, R., Peres, A., Wootters, W.K.: Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. Phys. Rev. Lett. 70, 1895\u20131899 (1993). https:\/\/doi.org\/10.1103\/PhysRevLett.70.1895","DOI":"10.1103\/PhysRevLett.70.1895"},{"key":"4_CR7","doi-asserted-by":"publisher","unstructured":"Biamonte, J., Bergholm, V.: Tensor networks in a nutshell (2017). https:\/\/doi.org\/10.48550\/arXiv.1708.00006","DOI":"10.48550\/arXiv.1708.00006"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Developers, C.: Cirq. Zenodo (2024). https:\/\/doi.org\/10.5281\/zenodo.4062499","DOI":"10.5281\/zenodo.4062499"},{"issue":"4","key":"4_CR9","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/13\/4\/043016","volume":"13","author":"B Coecke","year":"2011","unstructured":"Coecke, B., Duncan, R.: Interacting quantum observables: categorical algebra and diagrammatics. New J. Phys. 13(4), 043016 (2011). https:\/\/doi.org\/10.1088\/1367-2630\/13\/4\/043016","journal-title":"New J. Phys."},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Coecke, B., Kissinger, A.: Picturing Quantum Processes: A First Course in Quantum Theory and Diagrammatic Reasoning. Cambridge University Press (2017). https:\/\/doi.org\/10.1017\/9781316219317","DOI":"10.1017\/9781316219317"},{"key":"4_CR11","doi-asserted-by":"publisher","unstructured":"Cross, A.W., Bishop, L.S., Smolin, J.A., Gambetta, J.M.: Open quantum assembly language (2017). https:\/\/doi.org\/10.48550\/arXiv.1707.03429","DOI":"10.48550\/arXiv.1707.03429"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10472-009-9141-x","volume":"56","author":"L Dixon","year":"2009","unstructured":"Dixon, L., Duncan, R.: Graphical reasoning in compact closed categories for quantum computation. Ann. Math. Artif. Intell. 56, 23\u201342 (2009). https:\/\/doi.org\/10.1007\/s10472-009-9141-x","journal-title":"Ann. Math. Artif. Intell."},{"issue":"2","key":"4_CR13","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1006\/jcss.2001.1790","volume":"64","author":"F Drewes","year":"2002","unstructured":"Drewes, F., Hoffmann, B., Plump, D.: Hierarchical graph transformation. J. Comput. Syst. Sci. 64(2), 249\u2013283 (2002). https:\/\/doi.org\/10.1006\/jcss.2001.1790","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Duncan, R., Kissinger, A., Perdrix, S., van\u00a0de Wetering, J.: Graph-theoretic simplification of quantum circuits with the ZX-calculus. Quantum 4, 279 (2020). https:\/\/doi.org\/10.22331\/q-2020-06-04-279","DOI":"10.22331\/q-2020-06-04-279"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-642-14162-1_24","volume-title":"Automata, Languages and Programming","author":"R Duncan","year":"2010","unstructured":"Duncan, R., Perdrix, S.: Rewriting measurement-based quantum computations with generalised flow. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 285\u2013296. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14162-1_24"},{"key":"4_CR16","doi-asserted-by":"publisher","unstructured":"Ene, N.C., Fern\u00e1ndez, M., Pinaud, B.: Attributed hierarchical port graphs and applications. In: Fourth International Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE 2017). EPTCS, vol.\u00a0265, pp. 2\u201319. Open Publishing Association (2018). https:\/\/doi.org\/10.4204\/eptcs.265.2","DOI":"10.4204\/eptcs.265.2"},{"key":"4_CR17","doi-asserted-by":"publisher","unstructured":"Fr\u00fcwirth, T.: Theory and practice of Constraint Handling Rules. J. Logic Program. 37(1), 95\u2013138 (1998). https:\/\/doi.org\/10.1016\/S0743-1066(98)10005-5","DOI":"10.1016\/S0743-1066(98)10005-5"},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Gocho, M., Hori, T., Ueda, K.: Evolution of the LMNtal runtime to a parallel model checker. Comput. Softw. 28(4), 137\u2013157 (2011). https:\/\/doi.org\/10.11309\/jssst.28.4_137","DOI":"10.11309\/jssst.28.4_137"},{"key":"4_CR19","doi-asserted-by":"publisher","unstructured":"Greenberger, D.M., Horne, M.A., Zeilenger, A.: Going beyond bell\u2019s theorem. In: Kafatos, M. (ed.) Bell\u2019s Theorem, Quantum Theory and Conceptions of the Universe, pp. 69\u201372. Springer, Cham (1989). https:\/\/doi.org\/10.1007\/978-94-017-0849-4_10","DOI":"10.1007\/978-94-017-0849-4_10"},{"key":"4_CR20","doi-asserted-by":"publisher","unstructured":"Hadzihasanovic, A.: A diagrammatic axiomatisation for qubit entanglement. In: 30th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS 2015), pp. 573\u2013584. IEEE Computer Society (2015). https:\/\/doi.org\/10.1109\/LICS.2015.59","DOI":"10.1109\/LICS.2015.59"},{"key":"4_CR21","doi-asserted-by":"publisher","unstructured":"Hietala, K., Rand, R., Hung, S.H., Li, L., Hicks, M.: Proving quantum programs correct. In: 12th International Conference on Interactive Theorem Proving (ITP 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0193, pp. 21:1\u201321:19 (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ITP.2021.21","DOI":"10.4230\/LIPIcs.ITP.2021.21"},{"key":"4_CR22","doi-asserted-by":"publisher","unstructured":"Javadi-Abhari, A., et al.: Quantum computing with Qiskit (2024). https:\/\/doi.org\/10.48550\/arXiv.2405.08810","DOI":"10.48550\/arXiv.2405.08810"},{"key":"4_CR23","doi-asserted-by":"publisher","unstructured":"Kissinger, A., Quick, D.: Tensors, !-graphs, and non-commutative quantum structures. New Gener. Comput. 34, 87\u2013123 (2016). https:\/\/doi.org\/10.1007\/s00354-016-0203-4","DOI":"10.1007\/s00354-016-0203-4"},{"key":"4_CR24","doi-asserted-by":"publisher","unstructured":"Kissinger, A., Merry, A., Soloviev, M.: Pattern graph rewrite systems. In: Developments in Computational Models 2012 (DCM 2012). EPTCS, vol.\u00a0143, pp. 54\u201366. Open Publishing Association (2014). https:\/\/doi.org\/10.4204\/eptcs.143.5","DOI":"10.4204\/eptcs.143.5"},{"key":"4_CR25","doi-asserted-by":"publisher","unstructured":"Kissinger, A., van\u00a0de Wetering, J.: PyZX: large scale automated diagrammatic reasoning. In: 16th International Conference on Quantum Physics and Logic (QPL 2019). EPTCS, vol.\u00a0318, pp. 229\u2013241. Open Publishing Association (2020). https:\/\/doi.org\/10.4204\/EPTCS.318.14","DOI":"10.4204\/EPTCS.318.14"},{"key":"4_CR26","doi-asserted-by":"publisher","unstructured":"Kissinger, A., van\u00a0de Wetering, J.: Reducing the number of non-Clifford gates in quantum circuits. Phys. Rev. A 102(2) (2020). https:\/\/doi.org\/10.1103\/physreva.102.022406","DOI":"10.1103\/physreva.102.022406"},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-319-21401-6_22","volume-title":"Automated Deduction \u2013 CADE-25","author":"A Kissinger","year":"2015","unstructured":"Kissinger, A., Zamdzhiev, V.: Quantomatic: a proof assistant for diagrammatic reasoning. In: Felty, A.P., Middeldorp, A. (eds.) CADE 2015. LNCS (LNAI), vol. 9195, pp. 326\u2013336. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21401-6_22"},{"key":"4_CR28","unstructured":"LMNtal Developers: LMNtal, a unifying language and model checking tools (2024). https:\/\/github.com\/lmntal"},{"key":"4_CR29","doi-asserted-by":"publisher","unstructured":"Mishina, H., Ueda, K.: Introducing quantification into a hierarchical graph rewriting language. In: 34th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2024). LNCS, vol. 14919, pp. 220\u2013239. Springer Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-71294-4_13, extended version available at https:\/\/arxiv.org\/abs\/2411.14802","DOI":"10.1007\/978-3-031-71294-4_13"},{"key":"4_CR30","doi-asserted-by":"publisher","unstructured":"Nam, Y., Ross, N.J., Su, Y., Childs, A.M., Maslov, D.: Automated optimization of large quantum circuits with continuous parameters. NPJ Quantum Inf. 4(1), 1\u201312 (2018). https:\/\/doi.org\/10.1038\/s41534-018-0072-4","DOI":"10.1038\/s41534-018-0072-4"},{"key":"4_CR31","doi-asserted-by":"publisher","unstructured":"Takyu, K., Ueda, K.: Enhancing a hierarchical graph rewriting language based on MELL Cut Elimination. In: 27th International Symposium on Practical Aspects of Declarative Languages (PADL 2025). LNCS, vol. 15537, pp. 196\u2013214. Springer Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-84924-4_13, extended version available at https:\/\/arxiv.org\/abs\/2409.11015","DOI":"10.1007\/978-3-031-84924-4_13"},{"key":"4_CR32","unstructured":"Tei, K., Mishina, H., Yamamoto, N., Ueda, K.: Graph rewriting language as a platform for quantum diagrammatic calculi (2025). https:\/\/arxiv.org\/abs\/2511.15581"},{"key":"4_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/978-3-540-70590-1_27","volume-title":"Rewriting Techniques and Applications","author":"K Ueda","year":"2008","unstructured":"Ueda, K.: Encoding the pure lambda calculus into hierarchical graph rewriting. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol. 5117, pp. 392\u2013408. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70590-1_27"},{"issue":"46","key":"4_CR34","doi-asserted-by":"publisher","first-page":"4784","DOI":"10.1016\/j.tcs.2009.07.043","volume":"410","author":"K Ueda","year":"2009","unstructured":"Ueda, K.: LMNtal as a hierarchical logic programming language. Theoret. Comput. Sci. 410(46), 4784\u20134800 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2009.07.043","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR35","doi-asserted-by":"publisher","unstructured":"Ueda, K.: Logic\/constraint programming and concurrency: the hard-won lessons of the Fifth Generation Computer Project. Sci. Comput. Program. 164, 3\u201317 (2018). https:\/\/doi.org\/10.1016\/j.scico.2017.06.002","DOI":"10.1016\/j.scico.2017.06.002"},{"key":"4_CR36","unstructured":"Ueda, K.: Gentle introduction to LMNtal: language design and implementation. Tutorial given at the 17th International Conference on Graph Transformation (ICGT 2024) (2024). https:\/\/conf.researchr.org\/details\/icgt-2024\/icgt-2024-research-papers\/17\/Gentle-Introduction-to-LMNtal-Language-Design-and-Implementation"},{"key":"4_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-540-31837-8_6","volume-title":"Membrane Computing","author":"K Ueda","year":"2005","unstructured":"Ueda, K., Kato, N.: LMNtal: a language model with links and membranes. In: Mauri, G., P\u0103un, G., P\u00e9rez-Jim\u00e9nez, M.J., Rozenberg, G., Salomaa, A. (eds.) WMC 2004. LNCS, vol. 3365, pp. 110\u2013125. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31837-8_6"},{"key":"4_CR38","doi-asserted-by":"publisher","unstructured":"van\u00a0de Wetering, J.: ZX-calculus for the working quantum computer scientist (2020). https:\/\/doi.org\/10.48550\/arXiv.2012.13966","DOI":"10.48550\/arXiv.2012.13966"},{"key":"4_CR39","doi-asserted-by":"publisher","unstructured":"de\u00a0Witt, C.S., Zamdzhiev, V.: The ZX-calculus is incomplete for quantum mechanics. In: 11th Workshop on Quantum Physics and Logic (QPL 2014). EPTCS, vol.\u00a0172, pp. 285\u2013292. Open Publishing Association (2014). https:\/\/doi.org\/10.4204\/EPTCS.172.20","DOI":"10.4204\/EPTCS.172.20"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-15981-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T17:13:34Z","timestamp":1768151614000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-15981-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032159809","9783032159816"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-15981-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"12 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"PADL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Practical Aspects of Declarative Languages","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rennes","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 January 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 January 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"padl2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/popl26.sigplan.org\/home\/PADL-2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}