{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T15:06:09Z","timestamp":1764687969501,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030890506"},{"type":"electronic","value":"9783030890513"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-89051-3_8","type":"book-chapter","created":{"date-parts":[[2021,10,12]],"date-time":"2021-10-12T09:30:38Z","timestamp":1634031038000},"page":"121-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Hybrid Quantum-Classical Circuit Simplification with the ZX-Calculus"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1688-1370","authenticated-orcid":false,"given":"Agust\u00edn","family":"Borgna","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1808-2409","authenticated-orcid":false,"given":"Simon","family":"Perdrix","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1008-5605","authenticated-orcid":false,"given":"Beno\u00eet","family":"Valiron","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,12]]},"reference":[{"issue":"10","key":"8_CR1","doi-asserted-by":"publisher","first-page":"1476","DOI":"10.1109\/TCAD.2014.2341953","volume":"33","author":"M Amy","year":"2014","unstructured":"Amy, M., Maslov, D., Mosca, M.: Polynomial-time T-depth optimization of Clifford+T circuits via matroid partitioning. IEEE Trans. Comput.-Aided Des. 33(10), 1476\u20131489 (2014)","journal-title":"IEEE Trans. Comput.-Aided Des."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"218","DOI":"10.22331\/q-2020-01-09-218","volume":"4","author":"N de Beaudrap","year":"2020","unstructured":"de Beaudrap, N., Horsman, D.: The ZX calculus is a language for surface code lattice surgery. Quantum 4, 218 (2020)","journal-title":"Quantum"},{"unstructured":"Carette, T., Jeandel, E., et al.: Completeness of graphical languages for mixed states quantum mechanics. In: Proceedings of ICALP, pp. 108:1\u2013108:15 (2019)","key":"8_CR3"},{"unstructured":"Chancellor, N., Kissinger, et al.: Graphical structures for design and verification of quantum error correction (2016)","key":"8_CR4"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-540-70583-3_25","volume-title":"Automata, Languages and Programming","author":"B Coecke","year":"2008","unstructured":"Coecke, B., Duncan, R.: Interacting quantum observables. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5126, pp. 298\u2013310. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_25"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-319-91376-6_6","volume-title":"Diagrammatic Representation and Inference","author":"B Coecke","year":"2018","unstructured":"Coecke, B., Kissinger, A.: Picturing quantum processes. In: Chapman, P., Stapleton, G., Moktefi, A., Perez-Kriz, S., Bellucci, F. (eds.) Diagrams 2018. LNCS (LNAI), vol. 10871, pp. 28\u201331. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-91376-6_6"},{"unstructured":"Cross, A.W., Bishop, L.S., et al.: Open quantum assembly language (2017)","key":"8_CR7"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"279","DOI":"10.22331\/q-2020-06-04-279","volume":"4","author":"R Duncan","year":"2020","unstructured":"Duncan, R., Kissinger, A., et al.: Graph-theoretic simplification of quantum circuits with the ZX-calculus. Quantum 4, 279 (2020)","journal-title":"Quantum"},{"doi-asserted-by":"crossref","unstructured":"Duncan, R., Lucas, M.: Verifying the steane code with quantomatic. In: Proceedings of QPL, pp. 33\u201349 (2013)","key":"8_CR9","DOI":"10.4204\/EPTCS.171.4"},{"key":"8_CR10","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"},{"doi-asserted-by":"crossref","unstructured":"Green, A.S., Lumsdaine, P.L.F., et al.: Quipper: a scalable quantum programming language. In: Proceedings of PLDI, pp. 333\u2013342 (2013)","key":"8_CR11","DOI":"10.1145\/2499370.2462177"},{"doi-asserted-by":"crossref","unstructured":"Heyfron, L., Campbell, E.T.: An efficient quantum compiler that reduces T count (2018)","key":"8_CR12","DOI":"10.1088\/2058-9565\/aad604"},{"issue":"2","key":"8_CR13","first-page":"11:1","volume":"16","author":"E Jeandel","year":"2020","unstructured":"Jeandel, E., Perdrix, S., Vilmart, R.: Completeness of the ZX-calculus. LMCS 16(2), 11:1-11:72 (2020)","journal-title":"LMCS"},{"unstructured":"Jozsa, R.: An introduction to measurement based quantum computation. In: NATO Science Series, III, vol. 199, pp. 137\u2013158 (2005)","key":"8_CR14"},{"unstructured":"Khammassi, N., Guerreschi, G.G., et al.: cqasm v1.0: towards a common quantum assembly language (2018)","key":"8_CR15"},{"doi-asserted-by":"crossref","unstructured":"Kissinger, A., van de Wetering, J.: PyZX: large scale automated diagrammatic reasoning. In: ENTCS, vol. 318, pp. 229\u2013241 (2020)","key":"8_CR16","DOI":"10.4204\/EPTCS.318.14"},{"unstructured":"Kissinger, A., van de Wetering, J.: Reducing T-count with the ZX-calculus (2020)","key":"8_CR17"},{"issue":"OOPSLA","key":"8_CR18","first-page":"1","volume":"4","author":"G Li","year":"2020","unstructured":"Li, G., Zhou, L., Yu, N., et al.: Projection-based runtime assertions for testing and debugging quantum programs. PAPL 4(OOPSLA), 1\u201329 (2020)","journal-title":"PAPL"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-54429-3_12","volume-title":"Theory of Quantum Computation, Communication, and Cryptography","author":"M Mhalla","year":"2014","unstructured":"Mhalla, M., Murao, M., Perdrix, S., Someya, M., Turner, P.S.: Which graph states are useful for quantum information processing? In: Bacon, D., Martin-Delgado, M., Roetteler, M. (eds.) TQC 2011. LNCS, vol. 6745, pp. 174\u2013187. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54429-3_12"},{"doi-asserted-by":"crossref","unstructured":"Miller-Bakewell, H.: Finite verification of infinite families of diagram equations. In: Proceedings of QPL, pp. 27\u201352 (2019)","key":"8_CR20","DOI":"10.4204\/EPTCS.318.3"},{"issue":"4","key":"8_CR21","doi-asserted-by":"publisher","first-page":"042302","DOI":"10.1103\/PhysRevA.87.042302","volume":"87","author":"P Selinger","year":"2013","unstructured":"Selinger, P.: Quantum circuits of T-depth one. Phys. Rev. A 87(4), 042302 (2013)","journal-title":"Phys. Rev. A"},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"49","DOI":"10.22331\/q-2018-01-31-49","volume":"2","author":"DS Steiger","year":"2018","unstructured":"Steiger, D.S., H\u00e4ner, T., Troyer, M.: ProjectQ: an open source software framework for quantum computing. Quantum 2, 49 (2018)","journal-title":"Quantum"},{"unstructured":"van de Wetering, J.: ZX-calculus for the working quantum computer scientist (2020)","key":"8_CR23"},{"issue":"2","key":"8_CR24","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1109\/LCA.2019.2935049","volume":"18","author":"H Zhou","year":"2019","unstructured":"Zhou, H., Byrd, G.T.: Quantum circuits for dynamic runtime assertions in quantum computation. IEEE Comput. Arch. Lett. 18(2), 111\u2013114 (2019)","journal-title":"IEEE Comput. Arch. Lett."}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89051-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,12]],"date-time":"2021-10-12T09:52:37Z","timestamp":1634032357000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89051-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030890506","9783030890513"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89051-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"12 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APLAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Symposium on Programming Languages and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chicago, IL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aplas2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/aplas-2021","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCrp","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}