{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T08:52:19Z","timestamp":1768985539921,"version":"3.49.0"},"reference-count":27,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.394.3","type":"journal-article","created":{"date-parts":[[2023,11,14]],"date-time":"2023-11-14T18:41:16Z","timestamp":1699987276000},"page":"29-45","source":"Crossref","is-referenced-by-count":15,"title":["Reducing 2-QuBit Gate Count for ZX-Calculus based Quantum Circuit Optimization"],"prefix":"10.4204","volume":"394","author":[{"given":"Korbinian","family":"Staudacher","sequence":"first","affiliation":[{"name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen"}]},{"given":"Tobias","family":"Guggemos","sequence":"additional","affiliation":[{"name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen"}]},{"given":"Sophia","family":"Grundner-Culemann","sequence":"additional","affiliation":[{"name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen"}]},{"given":"Wolfgang","family":"Gehrke","sequence":"additional","affiliation":[{"name":"Universit\u00e4t der Bundeswehr M\u00fcnchen"}]}],"member":"2720","published-online":{"date-parts":[[2023,11,16]]},"reference":[{"issue":"10","key":"amy2014polynomial","doi-asserted-by":"publisher","first-page":"1476","DOI":"10.1109\/TCAD.2014.2341953","article-title":"Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning","volume":"33","author":"Amy","year":"2014","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"backens2021there","doi-asserted-by":"publisher","DOI":"10.22331\/q-2021-03-25-421","article-title":"There and back again: A circuit extraction tale","volume":"5","author":"Backens","year":"2021","journal-title":"Quantum"},{"issue":"8","key":"Barz.2015","doi-asserted-by":"publisher","DOI":"10.1088\/0953-4075\/48\/8\/083001","article-title":"Quantum computing with photons: introduction to the circuit model, the one-way quantum computer, and the fundamental principles of photonic experiments","volume":"48","author":"Barz","year":"2015","journal-title":"Journal of Physics B: Atomic, Molecular and Optical Physics"},{"key":"de2022circuit","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ICALP.2022.119","article-title":"Circuit Extraction for ZX-Diagrams Can Be #P-Hard","author":"de Beaudrap","year":"2022"},{"issue":"2","key":"Bouchet.1988","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/jgt.3190120210","article-title":"Transforming trees by successive local complementations","volume":"12","author":"Bouchet","year":"1988","journal-title":"Journal of Graph Theory"},{"issue":"4","key":"Coecke.2011","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/13\/4\/043016","article-title":"Interacting quantum observables: categorical algebra and diagrammatics","volume":"13","author":"Coecke","year":"2011","journal-title":"New Journal of Physics"},{"key":"coecke2021kindergarden","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2021.07.024","article-title":"Kindergarden quantum mechanics graduates ...or how I learned to stop gluing LEGO together and love the ZX-calculus","volume":"897","author":"Coecke","year":"2022","journal-title":"Theoretical Computer Science"},{"key":"coecke2018picturing","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-319-91376-6_6","article-title":"Picturing quantum processes","volume-title":"International Conference on Theory and Application of Diagrams","author":"Coecke","year":"2018"},{"key":"duncan2020graph","doi-asserted-by":"publisher","DOI":"10.22331\/q-2020-06-04-279","article-title":"Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus","volume":"4","author":"Duncan","year":"2020","journal-title":"Quantum"},{"issue":"1","key":"Geelen.2009","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/jgt.20363","article-title":"Circle graph obstructions under pivoting","volume":"61","author":"Geelen","year":"2009","journal-title":"Journal of Graph Theory"},{"key":"Grover.1996","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1145\/237814.237866","article-title":"A fast quantum mechanical algorithm for database search","volume-title":"Proceedings of the twenty-eighth annual ACM symposium on Theory of computing","author":"Grover","year":"1996"},{"issue":"15","key":"Harrow.2009","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.103.150502","article-title":"Quantum algorithm for solving linear systems of equations","volume":"103","author":"Harrow","year":"2009","journal-title":"Physical Review Letters"},{"issue":"1","key":"heyfron2018efficient","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/aad604","article-title":"An efficient quantum compiler that reduces T count","volume":"4","author":"Heyfron","year":"2018","journal-title":"Quantum Science and Technology"},{"key":"hietala2021verified","doi-asserted-by":"publisher","DOI":"10.1145\/3434318","article-title":"A Verified Optimizer for Quantum Circuits","volume":"5","author":"Hietala","year":"2021","journal-title":"Proc. ACM Program. Lang."},{"issue":"03","key":"Janzing.2003","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1142\/S0219749905001067","article-title":"\"Non-Identity-Check\" is QMA-complete","volume":"03","author":"Janzing","year":"2005","journal-title":"International Journal of Quantum Information"},{"key":"jeandel2018complete","series-title":"LICS '18","doi-asserted-by":"publisher","DOI":"10.1145\/3209108.3209131","article-title":"A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics","volume-title":"Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science","author":"Jeandel","year":"2018"},{"key":"Khaneja.2001","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/S0301-0104(01)00318-4","article-title":"Cartan decomposition of SU(2n) and control of spin systems","volume":"267","author":"Khaneja","year":"2001","journal-title":"Chemical Physics"},{"key":"kissinger2020Pyzx","series-title":"Electronic Proceedings in Theoretical Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.4204\/EPTCS.318.14","article-title":"PyZX: Large Scale Automated Diagrammatic Reasoning","volume-title":"Proceedings 16th International Conference on Quantum Physics and Logic, Chapman University, Orange, CA, USA., 10-14 June 2019","volume":"318","author":"Kissinger","year":"2020"},{"key":"kissinger2020reducing","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.102.022406","article-title":"Reducing the number of non-Clifford gates in quantum circuits","volume":"102","author":"Kissinger","year":"2020","journal-title":"Phys. Rev. A"},{"key":"Litinski.2019","doi-asserted-by":"publisher","DOI":"10.22331\/q-2019-12-02-205","article-title":"Magic State Distillation: Not as Costly as You Think","volume":"3","author":"Litinski","year":"2019","journal-title":"Quantum"},{"issue":"1","key":"nam2018automated","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41534-018-0072-4","article-title":"Automated optimization of large quantum circuits with continuous parameters","volume":"4","author":"Nam","year":"2018","journal-title":"npj Quantum Information"},{"key":"Nielsen.2013","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511976667","volume-title":"Quantum computation and quantum information","author":"Nielsen","year":"2013"},{"issue":"3","key":"OGorman.2017","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.95.032338","article-title":"Quantum computation with realistic magic-state factories","volume":"95","author":"O'Gorman","year":"2017","journal-title":"Physical Review A"},{"issue":"1","key":"Peruzzo.2014","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms5213","article-title":"A variational eigenvalue solver on a photonic quantum processor","volume":"5","author":"Peruzzo","year":"2014","journal-title":"Nature Communications"},{"key":"Shor.1994","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/SFCS.1994.365700","article-title":"Algorithms for quantum computation: Discrete logarithms and factoring","volume-title":"Foundations of Computer Science, 35th Symposium on (FOCS '94","author":"Shor","year":"1994"},{"issue":"1","key":"sivarajah2020t","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ab8e92","article-title":"t|ket: a retargetable compiler for NISQ devices","volume":"6","author":"Sivarajah","year":"2020","journal-title":"Quantum Science and Technology"},{"key":"vilmart2019near","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/LICS.2019.8785765","article-title":"A Near-Minimal Axiomatisation of ZX-Calculus for Pure Qubit Quantum Mechanics","volume-title":"2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","author":"Vilmart","year":"2019"}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2023,11,17]],"date-time":"2023-11-17T15:22:28Z","timestamp":1700234548000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/2311.08881v1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,16]]},"references-count":27,"URL":"https:\/\/doi.org\/10.4204\/eptcs.394.3","relation":{},"ISSN":["2075-2180"],"issn-type":[{"value":"2075-2180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,16]]}}}