@Article{Mahfoud2020,
  author       = {Mahfoud, Houari},
  journal      = {Cluster Computing},
  title        = {Graph pattern matching with counting quantifiers and label-repetition constraints},
  year         = {2020},
  issn         = {1573-7543},
  number       = {3},
  pages        = {1529--1553},
  volume       = {23},
  abstract     = {In recent years, we have witnessed an increasing use of graph pattern matching in a wide variety of applications such as social networks analysis, knowledge discovery, software plagiarism detection and many more. It is typically defined in terms of subgraph isomorphism, an NP-Complete problem. To overcome this cost, many extensions of graph simulation have been proposed that allow graph pattern matching to be conducted in cubic-time. However, in emerging applications, more expressive patterns are needed, notably ones with counting quantifiers (CQs) which are not considered by simulation-based approaches. In this article, we propose a simulation-based graph pattern matching approach that supports CQs on edges of graph patterns. We first consider CQs that express numeric aggregates only. We show that our approach is in ptime as earlier extensions of graph simulation by providing a cubic-time quantified matching algorithm, i.e., an algorithm for matching graph patterns that contain CQs. In the second part, we discuss the problem of Label-Repetition Constraints (LRCs). We define a necessary and sufficient condition for the satisfaction of LRCs. Based on this condition, we give an extension of our quantified matching algorithm to deal with LRCs in ptime, together with an optimization technique. Finally, we show that our quantified graph pattern matching approach retains the same complexity bounds when dealing with ratio aggregates. To our knowledge, this is the first effort to deal with numeric aggregates, ratio aggregates, and LRCs on graph patterns in ptime.},
  comment-luca = {a nice-ish paper for general graph pattern matching with quantifiers on how many edges need to map},
  doi          = {10.1007/s10586-019-02977-3},
  refid        = {Mahfoud2020},
  url          = {https://doi.org/10.1007/s10586-019-02977-3},
}

@InProceedings{Bunke1990,
  author       = {Horst Bunke and Thomas Glauser and T.{-}H. Tran},
  booktitle    = {Graph-Grammars and Their Application to Computer Science, 4th International Workshop, Bremen, Germany, March 5-9, 1990, Proceedings},
  title        = {An Efficient Implementation of Graph Grammars Based on the {RETE} Matching Algorithm},
  year         = {1990},
  editor       = {Hartmut Ehrig and Hans{-}J{\"{o}}rg Kreowski and Grzegorz Rozenberg},
  pages        = {174--189},
  publisher    = {Springer},
  series       = {Lecture Notes in Computer Science},
  volume       = {532},
  bibsource    = {dblp computer science bibliography, https://dblp.org},
  biburl       = {https://dblp.org/rec/conf/gg/BunkeGT90.bib},
  comment-luca = {Basically portmatching!!!},
  doi          = {10.1007/BFB0017389},
}

@Article{10.1145/321921.321925,
  author     = {Ullmann, J. R.},
  journal    = {J. ACM},
  title      = {An Algorithm for Subgraph Isomorphism},
  year       = {1976},
  issn       = {0004-5411},
  month      = {jan},
  number     = {1},
  pages      = {31–42},
  volume     = {23},
  abstract   = {Subgraph isomorphism can be determined by means of a brute-force tree-search enumeration procedure. In this paper a new algorithm is introduced that attains efficiency by inferentially eliminating successor nodes in the tree search. To assess the time actually taken by the new algorithm, subgraph isomorphism, clique detection, graph isomorphism, and directed graph isomorphism experiments have been carried out with random and with various nonrandom graphs.A parallel asynchronous logic-in-memory implementation of a vital part of the algorithm is also described, although this hardware has not actually been built. The hardware implementation would allow very rapid determination of isomorphism.},
  address    = {New York, NY, USA},
  doi        = {10.1145/321921.321925},
  issue_date = {Jan. 1976},
  numpages   = {12},
  publisher  = {Association for Computing Machinery},
  url        = {https://doi.org/10.1145/321921.321925},
}

@InProceedings{Albert1989,
  author    = {Luc Albert},
  booktitle = {Foundations of Software Technology and Theoretical Computer Science, Ninth Conference, Bangalore, India, December 19-21, 1989, Proceedings},
  title     = {Average Case Complexity Analysis of {RETE} Pattern-Match Algorithm and Average Size of Join in Database},
  year      = {1989},
  editor    = {C. E. Veni Madhavan},
  pages     = {223--241},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {405},
  bibsource = {dblp computer science bibliography, https://dblp.org},
  biburl    = {https://dblp.org/rec/conf/fsttcs/Albert89.bib},
  doi       = {10.1007/3-540-52048-1\_{4}{6}},
  url       = {https://doi.org/10.1007/3-540-52048-1_46},
}

@InProceedings{Zervakis2019,
  author       = {Lefteris Zervakis and Vinay Setty and Christos Tryfonopoulos and K. Hose},
  booktitle    = {Proceedings of the 23rd International Conference on Extending Database Technology (EDBT)},
  title        = {Efficient Continuous Multi-Query Processing over Graph Streams},
  year         = {2019},
  abstract     = {Graphs are ubiquitous and ever-present data structures that have a wide range of applications involving social networks, knowledge bases and biological interactions. The evolution of a graph in such scenarios can yield important insights about the nature and activities of the underlying network, which can then be utilized for applications such as news dissemination, network monitoring, and content curation. Capturing the continuous evolution of a graph can be achieved by long-standing sub-graph queries. Although, for many applications this can only be achieved by a set of queries, state-of-the-art approaches focus on a single query scenario. In this paper, we therefore introduce the notion of continuous multi-query processing over graph streams and discuss its application to a number of use cases. To this end, we designed and developed a novel algorithmic solution for efficient multi-query evaluation against a stream of graph updates and experimentally demonstrated its applicability. Our results against two baseline approaches using real-world, as well as synthetic datasets, confirm a two orders of magnitude improvement of the proposed solution.},
  comment-luca = {A bit hard to read, but good literature review!},
  doi          = {10.5441/002/edbt.2020.03},
  eprint       = {1902.05134},
  url          = {https://www.semanticscholar.org/paper/ed298d4f10cb8791698ec48649204f6e2a63c54f},
  venue        = {International Conference on Extending Database Technology},
}

@InProceedings{JochymOConnor2012,
  author   = {Tomas Jochym-O'Connor},
  title    = {A study of the robustness of magic state distillation against Clifford gate faults},
  year     = {2012},
  abstract = {Physics (Quantum Information)},
  comment  = {The paper that pennylane/catalyst bases their tutorial on:

https://docs.pennylane.ai/projects/catalyst/en/latest/demos/magic_distillation_demo.html},
  file     = {:papers/Jochym-O'Connor_thesis_Final.pdf:PDF},
  keywords = {magicstate},
}

@Misc{Brown2310,
  author    = {Brown, Natalie C. and Campora, John Peter and Granade, Cassandra and Heim, Bettina and Wernli, Stefan and Ryan-Anderson, Ciaran and Lucchetti, Dominic and Paetznick, Adam and Roetteler, Martin and Svore, Krysta and Chernoguzov, Alex},
  title     = {Advances in compilation for quantum hardware -- A demonstration of magic state distillation and repeat-until-success protocols},
  year      = {2023},
  copyright = {arXiv.org perpetual, non-exclusive license},
  doi       = {10.48550/ARXIV.2310.12106},
  eprint    = {2310.12106},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/2310.12106v1.pdf:PDF},
  keywords  = {Quantum Physics (quant-ph),FOS: Physical sciences,magicstate},
  publisher = {arXiv},
}

@Article{Mantri2017,
  author    = {Mantri, Atul and Demarie, Tommaso F. and Fitzsimons, Joseph F.},
  journal   = {Scientific Reports},
  title     = {Universality of quantum computation with cluster states and (X, Y)-plane measurements},
  year      = {2017},
  issn      = {2045-2322},
  month     = feb,
  number    = {1},
  volume    = {7},
  abstract  = {srep ,  (2017). doi:10.1038/srep42861},
  doi       = {10.1038/srep42861},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/srep42861.pdf:PDF},
  keywords  = {mbqc},
  publisher = {Springer Science and Business Media LLC},
  rights    = {Â© 2017 Nature Publishing Group},
}

@Article{Raussendorf_2001,
  author    = {Raussendorf, Robert and Briegel, Hans J.},
  journal   = {Physical Review Letters},
  title     = {A One-Way Quantum Computer},
  year      = {2001},
  issn      = {1079-7114},
  month     = may,
  number    = {22},
  pages     = {5188--5191},
  volume    = {86},
  doi       = {10.1103/PhysRevLett.86.5188},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/PhysRevLett.86.5188.pdf:PDF},
  keywords  = {mbqc},
  publisher = {American Physical Society (APS)},
}

@InProceedings{UnionFind2022,
  author    = {Delfosse, Nicolas and Londe, Vivien and Beverland, Michael E.},
  title     = {Toward a Union-Find Decoder for Quantum LDPC Codes},
  year      = {2022},
  month     = may,
  number    = {5},
  pages     = {3187--3199},
  publisher = {Institute of Electrical and Electronics Engineers (IEEE)},
  volume    = {68},
  abstract  = {IEEE Transactions on Information Theory;2022;68;5;10.1109/TIT.2022.3143452},
  doi       = {10.1109/TIT.2022.3143452},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/Toward_a_Union-Find_Decoder_for_Quantum_LDPC_Codes.pdf:PDF},
  issn      = {1557-9654},
  journal   = {IEEE Transactions on Information Theory},
  keywords  = {qec},
}

@Article{Wootton_2017,
  author    = {Wootton, James R. and Peter, Andreas and Winkler, János R. and Loss, Daniel},
  journal   = {Physical Review A},
  title     = {Proposal for a minimal surface code experiment},
  year      = {2017},
  issn      = {2469-9934},
  month     = sep,
  number    = {3},
  pages     = {032338},
  volume    = {96},
  doi       = {10.1103/PhysRevA.96.032338},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/PhysRevA.96.032338.pdf:PDF},
  keywords  = {qec,q9surface},
  publisher = {American Physical Society (APS)},
}

@Article{Bausch2024,
  author    = {Bausch, Johannes and Senior, Andrew W. and Heras, Francisco J. H. and Edlich, Thomas and Davies, Alex and Newman, Michael and Jones, Cody and Satzinger, Kevin and Niu, Murphy Yuezhen and Blackwell, Sam and Holland, George and Kafri, Dvir and Atalaya, Juan and Gidney, Craig and Hassabis, Demis and Boixo, Sergio and Neven, Hartmut and Kohli, Pushmeet},
  journal   = {Nature},
  title     = {Learning high-accuracy error decoding for quantum processors},
  year      = {2024},
  issn      = {1476-4687},
  month     = nov,
  number    = {8040},
  pages     = {834--840},
  volume    = {635},
  abstract  = {Nature, doi:10.1038/s41586-024-08148-8},
  doi       = {10.1038/s41586-024-08148-8},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/s41586-024-08148-8 (1).pdf:PDF},
  keywords  = {qec,transformer,google},
  publisher = {Springer Science and Business Media LLC},
}

@Article{Acharya2023,
  author    = {Acharya, Rajeev and Aleiner, Igor and Allen, Richard and Andersen, Trond I. and Ansmann, Markus and Arute, Frank and Arya, Kunal and Asfaw, Abraham and Atalaya, Juan and Babbush, Ryan and Bacon, Dave and Bardin, Joseph C. and Basso, Joao and Bengtsson, Andreas and Boixo, Sergio and Bortoli, Gina and Bourassa, Alexandre and Bovaird, Jenna and Brill, Leon and Broughton, Michael and Buckley, Bob B. and Buell, David A. and Burger, Tim and Burkett, Brian and Bushnell, Nicholas and Chen, Yu and Chen, Zijun and et al},
  journal   = {Nature},
  title     = {Suppressing quantum errors by scaling a surface code logical qubit},
  year      = {2023},
  issn      = {1476-4687},
  month     = feb,
  number    = {7949},
  pages     = {676--681},
  volume    = {614},
  abstract  = {Nature, doi:10.1038/s41586-022-05434-1},
  comment   = {Reference used in another Google paper (bausch2024) for the 1us throughput required for QEC on superconducting qubits},
  doi       = {10.1038/s41586-022-05434-1},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/s41586-022-05434-1.pdf:PDF},
  keywords  = {qec,google},
  publisher = {Springer Science and Business Media LLC},
}

@Article{RyanAnderson2021,
  author    = {Ryan-Anderson, C. and Bohnet, J. G. and Lee, K. and Gresh, D. and Hankin, A. and Gaebler, J. P. and Francois, D. and Chernoguzov, A. and Lucchetti, D. and Brown, N. C. and Gatterman, T. M. and Halit, S. K. and Gilmore, K. and Gerber, J. A. and Neyenhuis, B. and Hayes, D. and Stutz, R. P.},
  journal   = {Physical Review X},
  title     = {Realization of Real-Time Fault-Tolerant Quantum Error Correction},
  year      = {2021},
  issn      = {2160-3308},
  month     = dec,
  number    = {4},
  pages     = {041058},
  volume    = {11},
  abstract  = {Phys. Rev. X 11, 041058 (2022). doi:10.1103/PhysRevX.11.041058},
  comment   = {Claim: 1ms throughput for QEC},
  doi       = {10.1103/physrevx.11.041058},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/PhysRevX.11.041058.pdf:PDF},
  keywords  = {qec,iontrap,quantinuum},
  publisher = {American Physical Society (APS)},
}

@Article{Vazquez2024,
  author    = {Carrera Vazquez, Almudena and Tornow, Caroline and Ristè, Diego and Woerner, Stefan and Takita, Maika and Egger, Daniel J.},
  journal   = {Nature},
  title     = {Combining quantum processors with real-time classical communication},
  year      = {2024},
  issn      = {1476-4687},
  month     = nov,
  number    = {8041},
  pages     = {75--79},
  volume    = {636},
  abstract  = {Nature, doi:10.1038/s41586-024-08178-2},
  comment   = {hybrid programs across two QPUs (here called "dynamic programs")},
  doi       = {10.1038/s41586-024-08178-2},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/s41586-024-08178-2.pdf:PDF},
  publisher = {Springer Science and Business Media LLC},
}

@InProceedings{Click_1995,
  author     = {Click, Cliff and Paleczny, Michael},
  booktitle  = {Proceedings {ACM} {SIGPLAN} Workshop on Intermediate Representations (IR'95), San Francisco, CA, USA, January 22, 1995},
  title      = {A Simple Graph-Based Intermediate Representation},
  year       = {1995},
  editor     = {Michael D. Ernst},
  month      = mar,
  pages      = {35--49},
  publisher  = {{ACM}},
  series     = {POPL95},
  bibsource  = {dblp computer science bibliography, https://dblp.org},
  biburl     = {https://dblp.org/rec/conf/irep/ClickP95.bib},
  collection = {POPL95},
  doi        = {10.1145/202529.202534},
  file       = {:Click_1995 - A Simple Graph Based Intermediate Representation.pdf:PDF},
  keywords   = {IR},
  timestamp  = {Thu, 08 Jul 2021 16:04:01 +0200},
  url        = {https://doi.org/10.1145/202529.202534},
}

@InProceedings{Ford2021,
  author    = {Ford, Blake W. and Qasem, Apan and Tesic, Jelena and Zong, Ziliang},
  booktitle = {2021 IEEE International Conference on Networking, Architecture and Storage (NAS)},
  title     = {Migrating Software from x86 to ARM Architecture: An Instruction Prediction Approach},
  year      = {2021},
  month     = oct,
  pages     = {1--6},
  publisher = {IEEE},
  doi       = {10.1109/NAS51552.2021.9605443},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/Migrating_Software_from_x86_to_ARM_Architecture_An_Instruction_Prediction_Approach.pdf:PDF},
}

@Article{Kielpinski_2002,
  author    = {Kielpinski, D. and Monroe, C. and Wineland, D. J.},
  journal   = {Nature},
  title     = {Architecture for a large-scale ion-trap quantum computer},
  year      = {2002},
  issn      = {1476-4687},
  month     = jun,
  number    = {6890},
  pages     = {709--711},
  volume    = {417},
  doi       = {10.1038/nature00784},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/nature00784.pdf:PDF},
  publisher = {Springer Science and Business Media LLC},
}

@Article{Jaksch_2000,
  author    = {Jaksch, D. and Cirac, J. I. and Zoller, P. and Rolston, S. L. and Côté, R. and Lukin, M. D.},
  journal   = {Physical Review Letters},
  title     = {Fast Quantum Gates for Neutral Atoms},
  year      = {2000},
  issn      = {1079-7114},
  month     = sep,
  number    = {10},
  pages     = {2208--2211},
  volume    = {85},
  doi       = {10.1103/physrevlett.85.2208},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/PhysRevLett.85.2208.pdf:PDF},
  publisher = {American Physical Society (APS)},
}

@Article{Deutsch_2000,
  author    = {Deutsch, Ivan H. and Brennen, Gavin K. and Jessen, Poul S.},
  journal   = {Fortschritte der Physik},
  title     = {Quantum Computing with Neutral Atoms in an Optical Lattice},
  year      = {2000},
  issn      = {1521-3978},
  month     = sep,
  number    = {9–11},
  pages     = {925--943},
  volume    = {48},
  abstract  = {Fortschritte der Physik 2000.48:925-943},
  doi       = {10.1002/1521-3978(200009)48:9/11<925::aid-prop925>3.0.co;2-a},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/Fortschritte der Physik - 2000 - Deutsch - Quantum Computing with Neutral Atoms in an Optical Lattice.pdf:PDF},
  publisher = {Wiley},
}

@Article{Pellizzari_1995,
  author    = {T. Pellizzari, S. A. Gardiner, J. I. Cirac, and P. Zoller},
  journal   = {Physical Review Letters},
  title     = {Decoherence, Continuous Observation, and Quantum Computing: A Cavity QED Model},
  year      = {1995},
  issn      = {1079-7114},
  month     = nov,
  number    = {21},
  pages     = {3788--3791},
  volume    = {75},
  doi       = {10.1103/PhysRevLett.75.3788},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/PhysRevLett.75.3788.pdf:PDF},
  publisher = {American Physical Society (APS)},
}

@Article{Knill_2001,
  author    = {Knill, E. and Laflamme, R. and Milburn, G. J.},
  journal   = {Nature},
  title     = {A scheme for efficient quantum computation with linear optics},
  year      = {2001},
  issn      = {1476-4687},
  month     = jan,
  number    = {6816},
  pages     = {46--52},
  volume    = {409},
  doi       = {10.1038/35051009},
  file      = {:papers/klm.pdf:PDF},
  publisher = {Springer Science and Business Media LLC},
}

@Article{Blais_2007,
  author    = {Blais, Alexandre and Gambetta, Jay and Wallraff, A. and Schuster, D. I. and Girvin, S. M. and Devoret, M. H. and Schoelkopf, R. J.},
  journal   = {Physical Review A},
  title     = {Quantum-information processing with circuit quantum electrodynamics},
  year      = {2007},
  issn      = {1094-1622},
  month     = mar,
  number    = {3},
  pages     = {032329},
  volume    = {75},
  doi       = {10.1103/physreva.75.032329},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/transmon.pdf:PDF},
  publisher = {American Physical Society (APS)},
}

@Article{Sau_2010,
  author    = {Sau, Jay D. and Lutchyn, Roman M. and Tewari, Sumanta and Das Sarma, S.},
  journal   = {Physical Review Letters},
  title     = {Generic New Platform for Topological Quantum Computation Using Semiconductor Heterostructures},
  year      = {2010},
  issn      = {1079-7114},
  month     = jan,
  number    = {4},
  pages     = {040502},
  volume    = {104},
  doi       = {10.1103/physrevlett.104.040502},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/majorana.pdf:PDF},
  publisher = {American Physical Society (APS)},
}

@Misc{Rattacaso2408,
  author        = {Rattacaso, Davide and Jaschke, Daniel and Ballarin, Marco and Siloi, Ilaria and Montangero, Simone},
  title         = {Quantum circuit compilation with quantum computers},
  year          = {2024},
  archiveprefix = {arXiv},
  copyright     = {arXiv.org perpetual, non-exclusive license},
  doi           = {10.48550/arXiv.2408.00077},
  eprint        = {2408.00077},
  file          = {:/Users/luca/Documents/research/bibtexs/papers/compilation-on-qc.pdf:PDF},
  keywords      = {Quantum Physics (quant-ph), FOS: Physical sciences, FOS: Physical sciences},
  primaryclass  = {quant-ph},
  publisher     = {arXiv},
}

@Misc{Dongarra2024,
  author       = {Dongarra, J., Strohmaier, E., Simon, H., Meuer, H.},
  howpublished = {on 30/12/2024},
  month        = nov,
  title        = {TOP500 List},
  year         = {2024},
  url          = {https://top500.org/lists/top500/list/2024/11/},
  volume       = {64th Edition},
}

@Misc{Quantinuum2024,
  author       = {Quantinuum},
  howpublished = {on 30/12/2024},
  title        = {Quantinuum Unveils Accelerated Roadmap to Achieve Universal, Fully Fault-Tolerant Quantum Computing by 2030},
  year         = {2024},
  url          = {https://www.quantinuum.com/press-releases/quantinuum-unveils-accelerated-roadmap-to-achieve-universal-fault-tolerant-quantum-computing-by-2030},
}

@Misc{IBM2024,
  author       = {IBM},
  howpublished = {on 30/12/2024},
  title        = {Expanding the IBM Quantum roadmap to anticipate the future of quantum-centric supercomputing},
  year         = {2024},
  url          = {https://www.ibm.com/quantum/blog/ibm-quantum-roadmap-2025},
}

@Book{Nielsen2016,
  author    = {Michael A. Nielsen and Isaac L. Chuang},
  publisher = {Cambridge University Press},
  title     = {Quantum Computation and Quantum Information (10th Anniversary edition)},
  year      = {2016},
  isbn      = {978-1-10-700217-3},
  bibsource = {dblp computer science bibliography, https://dblp.org},
  biburl    = {https://dblp.org/rec/books/daglib/0046438.bib},
  timestamp = {Thu, 19 Sep 2019 11:29:54 +0200},
  url       = {https://www.cambridge.org/de/academic/subjects/physics/quantum-physics-quantum-information-and-quantum-computation/quantum-computation-and-quantum-information-10th-anniversary-edition?format=HB},
}

@Book{Coecke2017,
  author    = {Bob Coecke and Aleks Kissinger},
  publisher = {Cambridge University Press},
  title     = {Picturing Quantum Processes: {A} First Course in Quantum Theory and Diagrammatic Reasoning},
  year      = {2017},
  isbn      = {9781316219317},
  bibsource = {dblp computer science bibliography, https://dblp.org},
  biburl    = {https://dblp.org/rec/books/cu/CK2017.bib},
  doi       = {10.1017/9781316219317},
  timestamp = {Sat, 19 Oct 2019 19:02:41 +0200},
  url       = {https://doi.org/10.1017/9781316219317},
}

@Misc{Scheideler2018,
  author       = {Christian Scheideler},
  howpublished = {lecture notes, online, visited 30/12/2024},
  title        = {Probability amplification},
  year         = {2018},
  url          = {https://cs.uni-paderborn.de/fileadmin-eim/informatik/fg/ti/Lehre/SS_2018/AA/lecture_5.pdf},
}

@Article{Evered2023,
  author    = {Evered, Simon J. and Bluvstein, Dolev and Kalinowski, Marcin and Ebadi, Sepehr and Manovitz, Tom and Zhou, Hengyun and Li, Sophie H. and Geim, Alexandra A. and Wang, Tout T. and Maskara, Nishad and Levine, Harry and Semeghini, Giulia and Greiner, Markus and Vuletić, Vladan and Lukin, Mikhail D.},
  journal   = {Nature},
  title     = {High-fidelity parallel entangling gates on a neutral-atom quantum computer},
  year      = {2023},
  issn      = {1476-4687},
  month     = oct,
  number    = {7982},
  pages     = {268--272},
  volume    = {622},
  abstract  = {Nature, doi:10.1038/s41586-023-06481-y},
  doi       = {10.1038/s41586-023-06481-y},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/s41586-023-06481-y.pdf:PDF},
  keywords  = {quera,neutral atoms},
  publisher = {Springer Science and Business Media LLC},
}

@Book{Kitaev2002,
  author    = {Alexei Y. Kitaev and A. H. Shen and Mikhail N. Vyalyi},
  publisher = {American Mathematical Society},
  title     = {Classical and Quantum Computation},
  year      = {2002},
  isbn      = {978-0-8218-3229-5},
  series    = {Graduate studies in mathematics},
  volume    = {47},
  bibsource = {dblp computer science bibliography, https://dblp.org},
  biburl    = {https://dblp.org/rec/books/daglib/0046442.bib},
  timestamp = {Thu, 19 Sep 2019 11:29:54 +0200},
  url       = {https://bookstore.ams.org/gsm-47/},
}

@Article{Dawson_2006,
  author    = {Christopher M. Dawson and Michael A. Nielsen},
  journal   = {Quantum Information and Computation},
  title     = {The Solovay-Kitaev algorithm},
  year      = {2006},
  issn      = {1533-7146},
  month     = jan,
  number    = {1},
  pages     = {81--95},
  volume    = {6},
  bibsource = {dblp computer science bibliography, https://dblp.org},
  biburl    = {https://dblp.org/rec/journals/qic/DawsonN06.bib},
  doi       = {10.26421/QIC6.1-6},
  publisher = {Rinton Press},
  timestamp = {Fri, 30 Apr 2021 10:56:19 +0200},
  url       = {https://doi.org/10.26421/QIC6.1-6},
}

@Article{Sivarajah2020,
  author    = {Sivarajah, Seyon and Dilkes, Silas and Cowtan, Alexander and Simmons, Will and Edgington, Alec and Duncan, Ross},
  journal   = {Quantum Science and Technology},
  title     = {t|ket⟩: a retargetable compiler for NISQ devices},
  year      = {2020},
  issn      = {2058-9565},
  month     = nov,
  number    = {1},
  pages     = {014003},
  volume    = {6},
  doi       = {10.1088/2058-9565/ab8e92},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/tket.pdf:PDF},
  publisher = {IOP Publishing},
}

@Article{Allahverdyan2004,
  author    = {Allahverdyan, A. E. and Balian, R. and Nieuwenhuizen, Th. M.},
  journal   = {Physical Review Letters},
  title     = {Determining a Quantum State by Means of a Single Apparatus},
  year      = {2004},
  issn      = {1079-7114},
  month     = mar,
  number    = {12},
  pages     = {120402},
  volume    = {92},
  doi       = {10.1103/PhysRevLett.92.120402},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/qst.pdf:PDF},
  keywords  = {qst},
  publisher = {American Physical Society (APS)},
}

@Misc{rfc9293,
  author       = {Wesley Eddy},
  howpublished = {as RFC 9293},
  month        = aug,
  title        = {{Transmission Control Protocol (TCP)}},
  year         = {2022},
  abstract     = {This document specifies the Transmission Control Protocol (TCP). TCP is an important transport-layer protocol in the Internet protocol stack, and it has continuously evolved over decades of use and growth of the Internet. Over this time, a number of changes have been made to TCP as it was specified in RFC 793, though these have only been documented in a piecemeal fashion. This document collects and brings those changes together with the protocol specification from RFC 793. This document obsoletes RFC 793, as well as RFCs 879, 2873, 6093, 6429, 6528, and 6691 that updated parts of RFC 793. It updates RFCs 1011 and 1122, and it should be considered as a replacement for the portions of those documents dealing with TCP requirements. It also updates RFC 5961 by adding a small clarification in reset handling while in the SYN-RECEIVED state. The TCP header control bits from RFC 793 have also been updated based on RFC 3168.},
  doi          = {10.17487/RFC9293},
  number       = {9293},
  pagetotal    = {98},
  publisher    = {RFC Editor},
  series       = {Request for Comments},
  url          = {https://www.rfc-editor.org/info/rfc9293},
}

@Article{Haaf2024,
  author    = {ten Haaf, Sebastiaan L. D. and Wang, Qingzhen and Bozkurt, A. Mert and Liu, Chun-Xiao and Kulesh, Ivan and Kim, Philip and Xiao, Di and Thomas, Candice and Manfra, Michael J. and Dvir, Tom and Wimmer, Michael and Goswami, Srijit},
  journal   = {Nature},
  title     = {A two-site Kitaev chain in a two-dimensional electron gas},
  year      = {2024},
  issn      = {1476-4687},
  month     = jun,
  number    = {8016},
  pages     = {329--334},
  volume    = {630},
  doi       = {10.1038/s41586-024-07434-9},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/s41586-024-07434-9.pdf:PDF},
  publisher = {Springer Science and Business Media LLC},
}

@Article{Mourik_2012,
  author    = {Mourik, V. and Zuo, K. and Frolov, S. M. and Plissard, S. R. and Bakkers, E. P. A. M. and Kouwenhoven, L. P.},
  journal   = {Science},
  title     = {Signatures of Majorana Fermions in Hybrid Superconductor-Semiconductor Nanowire Devices},
  year      = {2012},
  issn      = {1095-9203},
  month     = may,
  number    = {6084},
  pages     = {1003--1007},
  volume    = {336},
  abstract  = {Science 2012.336:1003-1007},
  doi       = {10.1126/science.1222360},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/majorana-og-exp.pdf:PDF},
  publisher = {American Association for the Advancement of Science (AAAS)},
}

@Article{Kitaev_2003,
  author    = {Kitaev, A.Yu.},
  journal   = {Annals of Physics},
  title     = {Fault-tolerant quantum computation by anyons},
  year      = {2003},
  issn      = {0003-4916},
  month     = jan,
  number    = {1},
  pages     = {2--30},
  volume    = {303},
  doi       = {10.1016/S0003-4916(02)00018-0},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/toriccode.pdf:PDF},
  publisher = {Elsevier BV},
}

@Article{Burgholzer_2021,
  author    = {Burgholzer, Lukas and Wille, Robert},
  journal   = {IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems},
  title     = {Advanced Equivalence Checking for Quantum Circuits},
  year      = {2021},
  issn      = {1937-4151},
  month     = sep,
  number    = {9},
  pages     = {1810--1824},
  volume    = {40},
  abstract  = {IEEE Trans. on CAD of Integrated Circuits and Systems},
  doi       = {10.1109/tcad.2020.3032630},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/mqt.pdf:PDF},
  publisher = {Institute of Electrical and Electronics Engineers (IEEE)},
}

@MastersThesis{Oemer2000,
  author   = {Bernhard Ömer},
  school   = {Technical University of Vienna},
  title    = {Quantum Programming in QCL},
  year     = {2000},
  address  = {City, State (optional)},
  month    = jan,
  type     = {Master's thesis (optional)},
  file     = {:papers/qcl.pdf:PDF},
  keywords = {qcl,qpl},
  url      = {http://tph.tuwien.ac.at/~oemer/doc/quprog.pdf},
}

@Misc{Qsharp,
  author       = {Microsoft},
  howpublished = {on 31/12/2024},
  note         = {qpl},
  title        = {Introduction to the quantum programming language Q#},
  year         = {2024},
  keywords     = {qpl},
  url          = {https://learn.microsoft.com/en-us/azure/quantum/qsharp-overview},
}

@InProceedings{Bichsel2020,
  author     = {Bichsel, Benjamin and Baader, Maximilian and Gehr, Timon and Vechev, Martin},
  booktitle  = {Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation},
  title      = {Silq: a high-level quantum language with safe uncomputation and intuitive semantics},
  year       = {2020},
  month      = jun,
  pages      = {286--300},
  publisher  = {ACM},
  series     = {PLDI ’20},
  collection = {PLDI ’20},
  doi        = {10.1145/3385412.3386007},
  file       = {:/Users/luca/Documents/research/bibtexs/papers/silq.pdf:PDF},
  keywords   = {Quantum Language, Uncomputation, Semantics i.e., modify their state to enable ignoring them without side},
}

@Misc{JavadiAbhari2024,
  author        = {Ali Javadi-Abhari and Matthew Treinish and Kevin Krsulich and Christopher J. Wood and Jake Lishman and Julien Gacon and Simon Martiel and Paul D. Nation and Lev S. Bishop and Andrew W. Cross and Blake R. Johnson and Jay M. Gambetta},
  title         = {Quantum computing with Qiskit},
  year          = {2024},
  archiveprefix = {arXiv},
  eprint        = {2405.08810},
  file          = {:/Users/luca/Documents/research/bibtexs/papers/qiskit.pdf:PDF},
  primaryclass  = {quant-ph},
  url           = {https://arxiv.org/abs/2405.08810},
}

@Misc{Bergholm2022,
  author        = {Ville Bergholm and Josh Izaac and Maria Schuld and Christian Gogolin and Shahnawaz Ahmed and Vishnu Ajith and M. Sohaib Alam and Guillermo Alonso-Linaje and B. AkashNarayanan and Ali Asadi and Juan Miguel Arrazola and Utkarsh Azad and Sam Banning and Carsten Blank and Thomas R Bromley and Benjamin A. Cordier and Jack Ceroni and Alain Delgado and Olivia Di Matteo and Amintor Dusko and Tanya Garg and Diego Guala and Anthony Hayes and Ryan Hill and Aroosa Ijaz and Theodor Isacsson and David Ittah and Soran Jahangiri and Prateek Jain and Edward Jiang and Ankit Khandelwal and Korbinian Kottmann and Robert A. Lang and Christina Lee and Thomas Loke and Angus Lowe and Keri McKiernan and Johannes Jakob Meyer and J. A. Montañez-Barrera and Romain Moyard and Zeyue Niu and Lee James O'Riordan and Steven Oud and Ashish Panigrahi and Chae-Yeun Park and Daniel Polatajko and Nicolás Quesada and Chase Roberts and Nahum Sá and Isidor Schoch and Borun Shi and Shuli Shu and Sukin Sim and Arshpreet Singh and Ingrid Strandberg and Jay Soni and Antal Száva and Slimane Thabet and Rodrigo A. Vargas-Hernández and Trevor Vincent and Nicola Vitucci and Maurice Weber and David Wierichs and Roeland Wiersema and Moritz Willmann and Vincent Wong and Shaoming Zhang and Nathan Killoran},
  title         = {PennyLane: Automatic differentiation of hybrid quantum-classical computations},
  year          = {2022},
  archiveprefix = {arXiv},
  eprint        = {1811.04968},
  file          = {:papers/pennylane.pdf:PDF},
  primaryclass  = {quant-ph},
  url           = {https://arxiv.org/abs/1811.04968},
}

@Misc{CirqDevelopers2024,
  author    = {Cirq Developers,},
  title     = {Cirq},
  year      = {2024},
  copyright = {Apache License 2.0},
  doi       = {10.5281/zenodo.4062499},
  publisher = {Zenodo},
}

@Misc{Koch2024,
  author       = {Koch, Mark and Lawrence, Alan and Singhal, Kartik and Sivarajah, Seyon and Duncan, Ross},
  howpublished = {(talk recording)},
  month        = jan,
  title        = {GUPPY: Pythonic Quantum-Classical Programming},
  year         = {2024},
  abstract     = {We present ongoing work on Guppy, a domain-specific language embedded in Python that allows users to write high-level hybrid quantum programs with complex control flow in Pythonic syntax, aiming to run them on actual quantum hardware.},
  booktitle    = {Informal Proceedings of the Fourth International Workshop on Programming Languages for Quantum Computing (PLanQC '24)},
  file         = {:papers/guppy.pdf:PDF},
  keywords     = {Quantum Computing, Quantum Computation, Programming Languages, Type Systems, Quantum Programming Languages, Language Design},
  url          = {https://www.youtube.com/live/D8esZrt7ogk?feature=shared&t=31448},
}

@Article{Ittah_2024,
  author    = {Ittah, David and Asadi, Ali and Lopez, Erick Ochoa and Mironov, Sergei and Banning, Samuel and Moyard, Romain and Peng, Mai Jacob and Izaac, Josh},
  journal   = {Journal of Open Source Software},
  title     = {Catalyst: a Python JIT compiler for auto-differentiable hybrid quantum programs},
  year      = {2024},
  issn      = {2475-9066},
  month     = jul,
  number    = {99},
  pages     = {6720},
  volume    = {9},
  doi       = {10.21105/joss.06720},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/catalyst.pdf:PDF},
  publisher = {The Open Journal},
}

@Misc{Cudaq,
  author       = {{CUDA-Q Developers}},
  howpublished = {on 31/12/24},
  title        = {CUDA-Q Documentation},
  year         = {2024},
  url          = {https://nvidia.github.io/cuda-quantum/latest/index.html},
}

@Article{Ittah_2022,
  author    = {Ittah, David and Häner, Thomas and Kliuchnikov, Vadym and Hoefler, Torsten},
  journal   = {ACM Transactions on Quantum Computing},
  title     = {QIRO: A Static Single Assignment-based Quantum Program Representation for Optimization},
  year      = {2022},
  issn      = {2643-6817},
  month     = jun,
  number    = {3},
  pages     = {1--32},
  volume    = {3},
  doi       = {10.1145/3491247},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/ittah_qiro.pdf:PDF},
  keywords  = {mlir},
  publisher = {Association for Computing Machinery (ACM)},
}

@Misc{CudaqHpc,
  author       = {{NVIDIA}},
  howpublished = {on 31/12/2024},
  title        = {NVIDIA Accelerates Quantum Computing Centers Worldwide With CUDA-Q Platform},
  year         = {2024},
  url          = {https://investor.nvidia.com/news/press-release-details/2024/NVIDIA-Accelerates-Quantum-Computing-Centers-Worldwide-With-CUDA-Q-Platform/default.aspx},
}

@InProceedings{Lattner2004,
  author    = {Chris Lattner and Vikram Adve},
  booktitle = {International Symposium on Code Generation and Optimization, 2004. CGO 2004.},
  title     = {LLVM: A compilation framework for lifelong program analysis \& transformation},
  year      = {2004},
  pages     = {75--86},
  publisher = {IEEE},
  abstract  = {mizations performed at link-time (to preserve the benefits of},
  doi       = {10.1109/CGO.2004.1281665},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/llvm.pdf:PDF},
}

@InProceedings{Lattner_2021,
  author    = {Lattner, Chris and Amini, Mehdi and Bondhugula, Uday and Cohen, Albert and Davis, Andy and Pienaar, Jacques and Riddle, River and Shpeisman, Tatiana and Vasilache, Nicolas and Zinenko, Oleksandr},
  booktitle = {2021 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)},
  title     = {MLIR: Scaling Compiler Infrastructure for Domain Specific Computation},
  year      = {2021},
  month     = feb,
  pages     = {2--14},
  publisher = {IEEE},
  doi       = {10.1109/CGO51591.2021.9370308},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/mlir.pdf:PDF},
}

@Misc{qir,
  author       = {{QIR Alliance}},
  howpublished = {on 31/12/24},
  title        = {{QIR} Specification v0.1},
  year         = {2021},
  url          = {https://www.qir-alliance.org/},
}

@Misc{qirall,
  author       = {{QIR Alliance}},
  howpublished = {on 02/01/2025},
  title        = {{NVIDIA} Joins the {QIR} Alliance as the Effort Enters Year Two},
  year         = {2023},
  url          = {https://www.qir-alliance.org/posts/year_one_in_review/},
}

@Misc{Hugr,
  author       = {Mark Koch, Agustín Borgna, Seyon Sivarajah, Alan Lawrence, Alec Edgington, Douglas Wilson, Craig Roy, Luca Mondada, Lukas Heidemann, Ross Duncan},
  howpublished = {(talk recording)},
  title        = {HUGR: A Quantum-Classical Intermediate Representation},
  year         = {2025},
  abstract     = {on. Quantum algorithms are usually built up from multiple layers of abstraction, start-
ing from some problem domain (say, a Hamiltonian describing a chemical system) that is then
continuously lowered (for example by synthesising oracle circuits, inserting error mitigation steps,
etc.). HUGR is designed to faithfully capture this staged lowering of abstraction levels, allowing
compilers to exploit the unique opportunities for optimisation available at each step.},
  booktitle    = {Fifth International Workshop on Programming Languages for Quantum Computing (PLanQC 2025)},
  file         = {:/Users/luca/Downloads/planqc25-paper51.pdf:PDF},
  url          = {https://www.youtube.com/live/D8esZrt7ogk?feature=shared&t=5217},
}

@InProceedings{McCaskey2021,
  author    = {McCaskey, Alexander and Nguyen, Thien},
  booktitle = {2021 IEEE International Conference on Quantum Computing and Engineering (QCE)},
  title     = {A MLIR Dialect for Quantum Assembly Languages},
  year      = {2021},
  month     = oct,
  publisher = {IEEE},
  abstract  = {2021 IEEE International Conference on Quantum Computing and Engineering (QCE);2021; ; ;10.1109/QCE52317.2021.00043},
  doi       = {10.1109/QCE52317.2021.00043},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/qcor.pdf:PDF},
}

@InProceedings{Rosen1988,
  author     = {Rosen, B. K. and Wegman, M. N. and Zadeck, F. K.},
  booktitle  = {Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL ’88},
  title      = {Global Value Numbers and Redundant Computations},
  year       = {1988},
  number     = {technical},
  pages      = {12--27},
  publisher  = {ACM Press},
  series     = {POPL ’88},
  collection = {POPL ’88},
  doi        = {10.1145/73560.73562},
  file       = {:/Users/luca/Documents/research/bibtexs/papers/ssa.pdf:PDF},
}

@Article{Girard_1987,
  author    = {Girard, Jean-Yves},
  journal   = {Theoretical Computer Science},
  title     = {Linear logic},
  year      = {1987},
  issn      = {0304-3975},
  number    = {1},
  pages     = {1--101},
  volume    = {50},
  doi       = {10.1016/0304-3975(87)90045-4},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/linearlogic.pdf:PDF},
  publisher = {Elsevier BV},
}

@Misc{Niu2024,
  author        = {Niu, Siyuan and Kokcu, Efekan and Mitra, Anupam and Szasz, Aaron and Hashim, Akel and Kalloor, Justin and de Jong, Wibe Albert and Iancu, Costin and Younis, Ed},
  month         = dec,
  title         = {AC/DC: Automated Compilation for Dynamic Circuits},
  year          = {2024},
  archiveprefix = {arXiv},
  copyright     = {arXiv.org perpetual, non-exclusive license},
  doi           = {10.48550/ARXIV.2412.07969},
  eprint        = {2412.07969},
  file          = {:/Users/luca/Documents/research/bibtexs/papers/acdc.pdf:PDF},
  keywords      = {Quantum Physics (quant-ph), FOS: Physical sciences, FOS: Physical sciences},
  primaryclass  = {quant-ph},
  publisher     = {arXiv},
}

@Article{Corcoles2021,
  author    = {Córcoles, A. D. and Takita, Maika and Inoue, Ken and Lekuch, Scott and Minev, Zlatko K. and Chow, Jerry M. and Gambetta, Jay M.},
  journal   = {Physical Review Letters},
  title     = {Exploiting Dynamic Quantum Circuits in a Quantum Algorithm with Superconducting Qubits},
  year      = {2021},
  issn      = {1079-7114},
  month     = aug,
  number    = {10},
  pages     = {100501},
  volume    = {127},
  doi       = {10.1103/physrevlett.127.100501},
  file      = {:papers/mcm-ibm.pdf:PDF},
  publisher = {American Physical Society (APS)},
}

@Article{Graham2023,
  author    = {Graham, T. M. and Phuttitarn, L. and Chinnarasu, R. and Song, Y. and Poole, C. and Jooya, K. and Scott, J. and Scott, A. and Eichler, P. and Saffman, M.},
  journal   = {Physical Review X},
  title     = {Midcircuit Measurements on a Single-Species Neutral Alkali Atom Quantum Processor},
  year      = {2023},
  issn      = {2160-3308},
  month     = dec,
  number    = {4},
  pages     = {041051},
  volume    = {13},
  doi       = {10.1103/physrevx.13.041051},
  file      = {:papers/mcm-neutral.pdf:PDF},
  publisher = {American Physical Society (APS)},
}

@Article{Pino2021,
  author    = {Pino, J. M. and Dreiling, J. M. and Figgatt, C. and Gaebler, J. P. and Moses, S. A. and Allman, M. S. and Baldwin, C. H. and Foss-Feig, M. and Hayes, D. and Mayer, K. and Ryan-Anderson, C. and Neyenhuis, B.},
  journal   = {Nature},
  title     = {Demonstration of the trapped-ion quantum CCD computer architecture},
  year      = {2021},
  issn      = {1476-4687},
  month     = apr,
  number    = {7853},
  pages     = {209--213},
  volume    = {592},
  doi       = {10.1038/s41586-021-03318-4},
  file      = {:papers/quantinuum-h1.pdf:PDF},
  publisher = {Springer Science and Business Media LLC},
}

@Article{Baeumer2024,
  author    = {Bäumer, Elisa and Tripathi, Vinay and Seif, Alireza and Lidar, Daniel and Wang, Derek S.},
  journal   = {Physical Review Letters},
  title     = {Quantum Fourier Transform Using Dynamic Circuits},
  year      = {2024},
  issn      = {1079-7114},
  month     = oct,
  number    = {15},
  pages     = {150602},
  volume    = {133},
  doi       = {10.1103/physrevlett.133.150602},
  file      = {:papers/hybrid-qft.pdf:PDF},
  publisher = {American Physical Society (APS)},
}

@Article{Bluvstein2023,
  author    = {Bluvstein, Dolev and Evered, Simon J. and Geim, Alexandra A. and Li, Sophie H. and Zhou, Hengyun and Manovitz, Tom and Ebadi, Sepehr and Cain, Madelyn and Kalinowski, Marcin and Hangleiter, Dominik and Bonilla Ataides, J. Pablo and Maskara, Nishad and Cong, Iris and Gao, Xun and Sales Rodriguez, Pedro and Karolyshyn, Thomas and Semeghini, Giulia and Gullans, Michael J. and Greiner, Markus and Vuletić, Vladan and Lukin, Mikhail D.},
  journal   = {Nature},
  title     = {Logical quantum processor based on reconfigurable atom arrays},
  year      = {2023},
  issn      = {1476-4687},
  month     = dec,
  number    = {7997},
  pages     = {58--65},
  volume    = {626},
  abstract  = {Nature, doi:10.1038/s41586-023-06927-3},
  doi       = {10.1038/s41586-023-06927-3},
  file      = {:/Users/luca/Downloads/s41586-023-06927-3 (1).pdf:PDF},
  keywords  = {ft,hardware},
  publisher = {Springer Science and Business Media LLC},
}

@Misc{Kottmann2024,
  author       = {Korbinian Kottmann},
  howpublished = {on 08/01/2025},
  month        = feb,
  title        = {Introducing (dynamical) Lie algebras for quantum practitioners},
  year         = {2024},
  priority     = {prio1},
  url          = {https://pennylane.ai/qml/demos/tutorial_liealgebra},
}

@Book{Lehman2017,
  author    = {Lehman, Eric and Leighton, F. Thomson and Meyer, Albert R.},
  publisher = {Samurai Media Limited},
  title     = {Mathematics for Computer Science},
  year      = {2017},
  isbn      = {9789888407064},
  pages     = {988},
}

@Article{Karuppasamy2025,
  author    = {Karuppasamy, Krishnageetha and Puram, Varun and Johnson, Stevens and Thomas, Johnson P.},
  journal   = {Quantum Reports},
  title     = {A Comprehensive Review of Quantum Circuit Optimization: Current Trends and Future Directions},
  year      = {2025},
  issn      = {2624-960X},
  month     = jan,
  number    = {1},
  pages     = {2},
  volume    = {7},
  doi       = {10.3390/quantum7010002},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/quantumrep-07-00002.pdf:PDF},
  priority  = {prio1},
  publisher = {MDPI AG},
}

@Article{Acharya2024,
  author    = {Acharya, Rajeev and Abanin, Dmitry A. and Aghababaie-Beni, Laleh and Aleiner, Igor and Andersen, Trond I. and Ansmann, Markus and Arute, Frank and Arya, Kunal and Asfaw, Abraham and Astrakhantsev, Nikita and Atalaya, Juan and Babbush, Ryan and Bacon, Dave and Ballard, Brian and Bardin, Joseph C. and Bausch, Johannes and Bengtsson, Andreas and Bilmes, Alexander and Blackwell, Sam and Boixo, Sergio and Bortoli, Gina and Bourassa, Alexandre and Bovaird, Jenna and Brill, Leon and et al},
  journal   = {Nature},
  title     = {Quantum error correction below the surface code threshold},
  year      = {2024},
  issn      = {1476-4687},
  month     = dec,
  doi       = {10.1038/s41586-024-08449-y},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/google-willow.pdf:PDF},
  keywords  = {google},
  publisher = {Springer Science and Business Media LLC},
}

@Article{Koch_2007,
  author    = {Koch, Jens and Yu, Terri M. and Gambetta, Jay and Houck, A. A. and Schuster, D. I. and Majer, J. and Blais, Alexandre and Devoret, M. H. and Girvin, S. M. and Schoelkopf, R. J.},
  journal   = {Physical Review A},
  title     = {Charge-insensitive qubit design derived from the Cooper pair box},
  year      = {2007},
  issn      = {1094-1622},
  month     = oct,
  number    = {4},
  pages     = {042319},
  volume    = {76},
  doi       = {10.1103/PhysRevA.76.042319},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/transmon2.pdf:PDF},
  publisher = {American Physical Society (APS)},
}

@Article{Erhard2019,
  author    = {Erhard, Alexander and Wallman, Joel J. and Postler, Lukas and Meth, Michael and Stricker, Roman and Martinez, Esteban A. and Schindler, Philipp and Monz, Thomas and Emerson, Joseph and Blatt, Rainer},
  journal   = {Nature Communications},
  title     = {Characterizing large-scale quantum computers via cycle benchmarking},
  year      = {2019},
  issn      = {2041-1723},
  month     = nov,
  number    = {1},
  volume    = {10},
  abstract  = {Nature Communications, doi:10.1038/s41467-019-13068-7},
  doi       = {10.1038/s41467-019-13068-7},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/aqt-3ms.pdf:PDF},
  publisher = {Springer Science and Business Media LLC},
}

@Article{Bluvstein2022,
  author    = {Bluvstein, Dolev and Levine, Harry and Semeghini, Giulia and Wang, Tout T. and Ebadi, Sepehr and Kalinowski, Marcin and Keesling, Alexander and Maskara, Nishad and Pichler, Hannes and Greiner, Markus and Vuletić, Vladan and Lukin, Mikhail D.},
  journal   = {Nature},
  title     = {A quantum processor based on coherent transport of entangled atom arrays},
  year      = {2022},
  issn      = {1476-4687},
  month     = apr,
  number    = {7906},
  pages     = {451--456},
  volume    = {604},
  abstract  = {Nature, doi:10.1038/s41586-022-04592-6},
  doi       = {10.1038/s41586-022-04592-6},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/neutral-atoms-quera.pdf:PDF},
  keywords  = {quera,neutral atoms},
  publisher = {Springer Science and Business Media LLC},
}

@Article{Arrazola2021,
  author    = {Arrazola, J. M. and Bergholm, V. and Brádler, K. and Bromley, T. R. and Collins, M. J. and Dhand, I. and Fumagalli, A. and Gerrits, T. and Goussev, A. and Helt, L. G. and Hundal, J. and Isacsson, T. and Israel, R. B. and Izaac, J. and Jahangiri, S. and Janik, R. and Killoran, N. and Kumar, S. P. and Lavoie, J. and Lita, A. E. and Mahler, D. H. and Menotti, M. and Morrison, B. and Nam, S. W. and Neuhaus, L. and Qi, H. Y. and Quesada, N. and Repingon, A. and et al},
  journal   = {Nature},
  title     = {Quantum circuits with many photons on a programmable nanophotonic chip},
  year      = {2021},
  issn      = {1476-4687},
  month     = mar,
  number    = {7848},
  pages     = {54--60},
  volume    = {591},
  abstract  = {Nature, doi:10.1038/s41586-021-03202-1},
  doi       = {10.1038/s41586-021-03202-1},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/xanadu-photon-qc.pdf:PDF},
  keywords  = {photonic,xanadu},
  publisher = {Springer Science and Business Media LLC},
}

@Article{Bartolucci_2023,
  author    = {Bartolucci, Sara and Birchall, Patrick and Bombín, Hector and Cable, Hugo and Dawson, Chris and Gimeno-Segovia, Mercedes and Johnston, Eric and Kieling, Konrad and Nickerson, Naomi and Pant, Mihir and Pastawski, Fernando and Rudolph, Terry and Sparrow, Chris},
  journal   = {Nature Communications},
  title     = {Fusion-based quantum computation},
  year      = {2023},
  issn      = {2041-1723},
  month     = feb,
  number    = {1},
  volume    = {14},
  abstract  = {Nature Communications, doi:10.1038/s41467-023-36493-1},
  doi       = {10.1038/s41467-023-36493-1},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/fbqc.pdf:PDF},
  publisher = {Springer Science and Business Media LLC},
}

@Article{Bourassa2021,
  author    = {Bourassa, J. Eli and Alexander, Rafael N. and Vasmer, Michael and Patil, Ashlesha and Tzitrin, Ilan and Matsuura, Takaya and Su, Daiqin and Baragiola, Ben Q. and Guha, Saikat and Dauphinais, Guillaume and Sabapathy, Krishna K. and Menicucci, Nicolas C. and Dhand, Ish},
  journal   = {Quantum},
  title     = {Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer},
  year      = {2021},
  issn      = {2521-327X},
  month     = feb,
  pages     = {392},
  volume    = {5},
  doi       = {10.22331/q-2021-02-04-392},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/xanadu-photon-blueprint.pdf:PDF},
  publisher = {Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften},
  rights    = {CC BY 4.0},
}

@Article{Steiger_2018,
  author    = {Steiger, Damian S. and Häner, Thomas and Troyer, Matthias},
  journal   = {Quantum},
  title     = {ProjectQ: an open source software framework for quantum computing},
  year      = {2018},
  issn      = {2521-327X},
  month     = jan,
  pages     = {49},
  volume    = {2},
  doi       = {10.22331/q-2018-01-31-49},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/projectq.pdf:PDF},
  publisher = {Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften},
  rights    = {CC BY 4.0},
}

@Misc{Gottesman2024,
  author       = {Daniel Gottesman},
  howpublished = {on 08/01/2025 (lecture notes)},
  month        = feb,
  title        = {Surviving as a Quantum Computer in a Classical World},
  year         = {2024},
  file         = {:/Users/luca/Documents/research/bibtexs/papers/gottesman-qec.pdf:PDF},
  url          = {https://www.cs.umd.edu/class/spring2024/cmsc858G/QECCbook-2024-ch1-15.pdf},
}

@Article{Selinger_2013,
  author    = {Selinger, Peter},
  journal   = {Physical Review A},
  title     = {Quantum circuits of T-depth one},
  year      = {2013},
  issn      = {1094-1622},
  month     = apr,
  number    = {4},
  pages     = {042302},
  volume    = {87},
  doi       = {10.1103/physreva.87.042302},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/selinger-t1.pdf:PDF},
  publisher = {American Physical Society (APS)},
}

@Article{Basilewitsch2024,
  author    = {Basilewitsch, Daniel and Dlaska, Clemens and Lechner, Wolfgang},
  journal   = {Physical Review Research},
  title     = {Comparing planar quantum computing platforms at the quantum speed limit},
  year      = {2024},
  issn      = {2643-1564},
  month     = apr,
  number    = {2},
  pages     = {023026},
  volume    = {6},
  abstract  = {Phys. Rev. Res. 6, 023026 (2024). doi:10.1103/PhysRevResearch.6.023026},
  doi       = {10.1103/physrevresearch.6.023026},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/planar-qc.pdf:PDF},
  keywords  = {doi:10.1103/PhysRevResearch.6.023026 url:https://doi.org/10.1103/PhysRevResearch.6.023026},
  publisher = {American Physical Society (APS)},
}

@Misc{Wu2020,
  author        = {Xin-Chuan Wu and Marc Grau Davis and Frederic T. Chong and Costin Iancu},
  month         = dec,
  title         = {QGo: Scalable Quantum Circuit Optimization Using Automated Synthesis},
  year          = {2020},
  archiveprefix = {arXiv},
  copyright     = {arXiv.org perpetual, non-exclusive license},
  eprint        = {2012.09835},
  primaryclass  = {quant-ph},
  publisher     = {arXiv},
}

@Misc{Iten2019,
  author        = {Raban Iten and Oliver Reardon-Smith and Emanuel Malvetti and Luca Mondada and Gabrielle Pauvert and Ethan Redmond and Ravjot Singh Kohli and Roger Colbeck},
  title         = {Introduction to UniversalQCompiler},
  year          = {2019},
  archiveprefix = {arXiv},
  eprint        = {1904.01072},
  primaryclass  = {quant-ph},
}

@Article{Mottonen2004,
  author    = {Möttönen, Mikko and Vartiainen, Juha J. and Bergholm, Ville and Salomaa, Martti M.},
  journal   = {Physical Review Letters},
  title     = {Quantum Circuits for General Multiqubit Gates},
  year      = {2004},
  issn      = {1079-7114},
  month     = sep,
  number    = {13},
  pages     = {130502},
  volume    = {93},
  doi       = {10.1103/PhysRevLett.93.130502},
  publisher = {American Physical Society (APS)},
  url       = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-
                  19644394074&doi=10.1103%2fPhysRevLett.93.130502&partnerID=40&
                  md5=a1533c0d1e47d2bf7d7ffd6c257dfb76},
}

@Article{Krol2021,
  author        = {Krol, Anna M. and Sarkar, Aritra and Ashraf, Imran and Al-Ars, Zaid and Bertels, Koen},
  journal       = {Applied Sciences},
  title         = {Efficient Decomposition of Unitary Matrices in Quantum Circuit Compilers},
  year          = {2022},
  issn          = {2076-3417},
  month         = jan,
  number        = {2},
  pages         = {759},
  volume        = {12},
  archiveprefix = {arXiv},
  doi           = {10.3390/app12020759},
  eprint        = {2101.02993},
  file          = {:papers/krol.pdf:PDF},
  primaryclass  = {quant-ph},
  publisher     = {MDPI AG},
}

@Article{Sedlak2008,
  author    = {Sedlák, Michal and Plesch, Martin},
  journal   = {Open Physics},
  title     = {Towards optimization of quantum circuits},
  year      = {2008},
  issn      = {2391-5471},
  month     = mar,
  number    = {1},
  pages     = {128--134},
  volume    = {6},
  doi       = {10.2478/s11534-008-0039-8},
  publisher = {Walter de Gruyter GmbH},
}

@Article{Amy2013,
  author    = {Amy, M. and Maslov, D. and Mosca, M. and Roetteler, M.},
  journal   = {IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems},
  title     = {A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits},
  year      = {2013},
  issn      = {1937-4151},
  month     = jun,
  number    = {6},
  pages     = {818--830},
  volume    = {32},
  doi       = {10.1109/TCAD.2013.2244643},
  publisher = {Institute of Electrical and Electronics Engineers (IEEE)},
}

@Article{Smith2023,
  author    = {Smith, Ethan and Davis, Marc Grau and Larson, Jeffrey and Younis, Ed and Oftelie, Lindsay Bassman and Lavrijsen, Wim and Iancu, Costin},
  journal   = {ACM Transactions on Quantum Computing},
  title     = {LEAP: Scaling Numerical Optimization Based Synthesis Using an Incremental Approach},
  year      = {2023},
  issn      = {2643-6817},
  month     = feb,
  number    = {1},
  pages     = {1--23},
  volume    = {4},
  doi       = {10.1145/3548693},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/leap.pdf:PDF},
  publisher = {Association for Computing Machinery (ACM)},
}

@Article{Gheorghiu2022,
  author        = {Vlad Gheorghiu and Michele Mosca and Priyanka Mukhopadhyay},
  journal       = {npj Quantum Information},
  title         = {A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits},
  year          = {2022},
  issn          = {2056-6387},
  month         = sep,
  number        = {1},
  volume        = {8},
  archiveprefix = {arXiv},
  doi           = {10.1038/s41534-022-00624-1},
  eprint        = {2101.03142},
  file          = {:/Users/luca/Documents/research/bibtexs/papers/tdepthoptimal.pdf:PDF},
  primaryclass  = {quant-ph},
  publisher     = {Springer Science and Business Media LLC},
}

@Article{Madden2022,
  author        = {Liam Madden and Andrea Simonetto},
  journal       = {ACM Transactions on Quantum Computing},
  title         = {Best Approximate Quantum Compiling Problems},
  year          = {2022},
  issn          = {2643-6817},
  month         = mar,
  number        = {2},
  pages         = {1--29},
  volume        = {3},
  archiveprefix = {arXiv},
  doi           = {10.1145/3505181},
  eprint        = {2106.05649},
  file          = {:/Users/luca/Documents/research/bibtexs/papers/madden.pdf:PDF},
  primaryclass  = {quant-ph},
  publisher     = {Association for Computing Machinery (ACM)},
}

@Article{Loke2014,
  author    = {Loke, T. and Wang, J. B. and Chen, Y. H.},
  journal   = {Computer Physics Communications},
  title     = {OptQC : An optimized parallel quantum compiler},
  year      = {2014},
  issn      = {0010-4655},
  month     = dec,
  number    = {12},
  pages     = {3307--3316},
  volume    = {185},
  doi       = {10.1016/j.cpc.2014.07.022},
  publisher = {Elsevier BV},
  type      = {{Article}},
}

@Article{Iten2016,
  author    = {Iten, Raban and Colbeck, Roger and Kukuljan, Ivan and Home, Jonathan and Christandl, Matthias},
  journal   = {Physical Review A},
  title     = {Quantum circuits for isometries},
  year      = {2016},
  issn      = {2469-9934},
  month     = mar,
  number    = {3},
  pages     = {032318},
  volume    = {93},
  doi       = {10.1103/PhysRevA.93.032318},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/iten-iso-decomp.pdf:PDF},
  publisher = {American Physical Society (APS)},
}

@InProceedings{Davis2020,
  author    = {Davis, Marc G. and Smith, Ethan and Tudor, Ana and Sen, Koushik and Siddiqi, Irfan and Iancu, Costin},
  booktitle = {2020 IEEE International Conference on Quantum Computing and Engineering (QCE)},
  title     = {Towards Optimal Topology Aware Quantum Circuit Synthesis},
  year      = {2020},
  month     = oct,
  pages     = {223--234},
  publisher = {IEEE},
  abstract  = {2020 IEEE International Conference on Quantum Computing and Engineering (QCE);2020; ; ;10.1109/QCE49297.2020.00036},
  date      = {2020-10},
  doi       = {10.1109/QCE49297.2020.00036},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/davis.pdf:PDF},
}

@InProceedings{qfast,
  author    = {Younis, Ed and Sen, Koushik and Yelick, Katherine and Iancu, Costin},
  booktitle = {2021 IEEE International Conference on Quantum Computing and Engineering (QCE)},
  title     = {QFAST: Conflating Search and Numerical Optimization for Scalable Quantum Circuit Synthesis},
  year      = {2021},
  month     = oct,
  pages     = {232--243},
  publisher = {IEEE},
  abstract  = {2021 IEEE International Conference on Quantum Computing and Engineering (QCE);2021; ; ;10.1109/QCE52317.2021.00041},
  doi       = {10.1109/QCE52317.2021.00041},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/qfast.pdf:PDF},
}

@Misc{Younis2022,
  author        = {Ed Younis and Costin Iancu},
  title         = {Quantum Circuit Optimization and Transpilation via Parameterized Circuit Instantiation},
  year          = {2022},
  archiveprefix = {arXiv},
  eprint        = {2206.07885},
  file          = {:/Users/luca/Documents/research/bibtexs/papers/younis2022.pdf:PDF},
  primaryclass  = {quant-ph},
  url           = {https://arxiv.org/abs/2206.07885},
}

@InProceedings{Weiden2023,
  author    = {Mathias Weiden and Ed Younis and Justin Kalloor and John Kubiatowicz and Costin Iancu},
  booktitle = {2023 IEEE International Conference on Quantum Computing and Engineering (QCE)},
  title     = {Improving Quantum Circuit Synthesis with Machine Learning},
  year      = {2023},
  publisher = {IEEE},
  abstract  = {2023 IEEE International Conference on Quantum Computing and Engineering (QCE);2023;01; ;10.1109/QCE57702.2023.00093},
  doi       = {10.1109/QCE57702.2023.00093},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/qseed.pdf:PDF},
}

@InProceedings{qfactor,
  author    = {Kukliansky, Alon and Younis, Ed and Cincio, Lukasz and Iancu, Costin},
  booktitle = {2023 IEEE International Conference on Quantum Computing and Engineering (QCE)},
  title     = {QFactor: A Domain-Specific Optimizer for Quantum Circuit Instantiation},
  year      = {2023},
  month     = sep,
  pages     = {814--824},
  publisher = {IEEE},
  doi       = {10.1109/QCE57702.2023.00096},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/qfactor.pdf:PDF},
}

@Article{Rakyta_2022,
  author    = {Péter Rakyta and Zoltán Zimborás},
  journal   = {Quantum},
  title     = {Approaching the theoretical limit in quantum gate decomposition},
  year      = {2022},
  issn      = {2521-327X},
  month     = may,
  pages     = {710},
  volume    = {6},
  doi       = {10.22331/q-2022-05-11-710},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/rakyta2022.pdf:PDF},
  publisher = {Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften},
  rights    = {CC BY 4.0},
}

@Misc{Ge2024,
  author        = {Yan Ge and Wu Wenjie and Chen Yuheng and Pan Kaisen and Lu Xudong and Zhou Zixiang and Wang Yuhan and Wang Ruocheng and Yan Junchi},
  title         = {Quantum Circuit Synthesis and Compilation Optimization: Overview and Prospects},
  year          = {2024},
  archiveprefix = {arXiv},
  eprint        = {2407.00736},
  file          = {:/Users/luca/Documents/research/bibtexs/papers/synthesis-review.pdf:PDF},
  keywords      = {quantum circuit synthesis, quantum architecture search, quantum circuit optimization, quan},
  primaryclass  = {quant-ph},
  priority      = {prio1},
  url           = {https://arxiv.org/abs/2407.00736},
}

@Misc{bqskit,
  author       = {Costin Iancu, Ed Younis, Bert de Jong, Wim Lavrijsen, Mathias Weiden, Siyuan Niu, Roel Van Beeumen, Alon Kukliansky, Ji Liu, Justin Kalloor, Marc Davis, Bao Bach, John Nguyen, Siddharth Ganapathy},
  howpublished = {on 09/01/2025},
  title        = {Berkeley Quantum Synthesis Toolkit},
  year         = {2025},
  url          = {https://bqskit.lbl.gov/},
}

@Misc{Alam2024,
  author        = {Faisal Alam and Bryan K. Clark},
  title         = {Learning dynamic quantum circuits for efficient state preparation},
  year          = {2024},
  archiveprefix = {arXiv},
  eprint        = {2410.09030},
  file          = {:/Users/luca/Documents/research/bibtexs/papers/learning-dynamic-circuits.pdf:PDF},
  primaryclass  = {quant-ph},
  url           = {https://arxiv.org/abs/2410.09030},
}

@Article{Amy2018,
  author    = {Amy, Matthew and Azimzadeh, Parsiad and Mosca, Michele},
  journal   = {Quantum Science and Technology},
  title     = {On the controlled-NOT complexity of controlled-NOT–phase circuits},
  year      = {2018},
  issn      = {2058-9565},
  month     = sep,
  number    = {1},
  pages     = {015002},
  volume    = {4},
  doi       = {10.1088/2058-9565/aad8ca},
  publisher = {IOP Publishing},
}

@InProceedings{Degriend2020,
  author    = {Arianne Meijer{-}van de Griend and Ross Duncan},
  booktitle = {Proceedings 19th International Conference on Quantum Physics and Logic, {QPL} 2022, Wolfson College, Oxford, UK, 27 June - 1 July 2022},
  title     = {Architecture-Aware Synthesis of Phase Polynomials for {NISQ} Devices},
  year      = {2022},
  editor    = {Stefano Gogioso and Matty Hoban},
  pages     = {116--140},
  series    = {{EPTCS}},
  volume    = {394},
  bibsource = {dblp computer science bibliography, https://dblp.org},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2004-06052.bib},
  doi       = {10.4204/EPTCS.394.8},
  file      = {:papers/aa-phasepoly.pdf:PDF},
  timestamp = {Tue, 02 Jan 2024 12:43:49 +0100},
  url       = {https://doi.org/10.4204/EPTCS.394.8},
}

@InProceedings{Cowtan2019,
  author    = {Alexander Cowtan and Silas Dilkes and Ross Duncan and Will Simmons and Seyon Sivarajah},
  booktitle = {Proceedings 16th International Conference on Quantum Physics and Logic, {QPL} 2019, Chapman University, Orange, CA, USA, June 10-14, 2019},
  title     = {Phase Gadget Synthesis for Shallow Circuits},
  year      = {2019},
  editor    = {Bob Coecke and Matthew Leifer},
  pages     = {213--228},
  series    = {{EPTCS}},
  volume    = {318},
  bibsource = {dblp computer science bibliography, https://dblp.org},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1906-01734.bib},
  doi       = {10.4204/EPTCS.318.13},
  file      = {:papers/phasegadget.pdf:PDF},
  timestamp = {Sat, 23 Jan 2021 01:19:29 +0100},
}

@Article{McClean2016,
  author    = {McClean, Jarrod R and Romero, Jonathan and Babbush, Ryan and Aspuru-Guzik, Alán},
  journal   = {New Journal of Physics},
  title     = {The theory of variational hybrid quantum-classical algorithms},
  year      = {2016},
  issn      = {1367-2630},
  month     = feb,
  number    = {2},
  pages     = {023023},
  volume    = {18},
  doi       = {10.1088/1367-2630/18/2/023023},
  keywords  = {trotter},
  publisher = {IOP Publishing},
}

@Misc{Cowtan2020,
  author        = {Alexander Cowtan and Will Simmons and Ross Duncan},
  title         = {A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz},
  year          = {2020},
  archiveprefix = {arXiv},
  eprint        = {2007.10515},
  file          = {:/Users/luca/Documents/research/bibtexs/papers/ucc-compilation.pdf:PDF},
  primaryclass  = {quant-ph},
  url           = {https://arxiv.org/abs/2007.10515},
}

@Article{Huang2024,
  author     = {Qunsheng Huang and David Winderl and Arianne Meijer{-}van de Griend and Richie Yeung},
  journal    = {CoRR},
  title      = {Redefining Lexicographical Ordering: Optimizing Pauli String Decompositions for Quantum Compiling},
  year       = {2024},
  volume     = {abs/2408.00354},
  bibsource  = {dblp computer science bibliography, https://dblp.org},
  biburl     = {https://dblp.org/rec/journals/corr/abs-2408-00354.bib},
  doi        = {10.48550/ARXIV.2408.00354},
  eprint     = {2408.00354},
  eprinttype = {arXiv},
  file       = {:/Users/luca/Documents/research/bibtexs/papers/richie-pauliopt.pdf:PDF},
  timestamp  = {Sat, 28 Sep 2024 20:40:16 +0200},
  url        = {https://doi.org/10.48550/arXiv.2408.00354},
}

@Article{Schmitz2024,
  author    = {Schmitz, Albert T. and Sawaya, Nicolas P. D. and Johri, Sonika and Matsuura, A. Y.},
  journal   = {Physical Review A},
  title     = {Graph Optimization Perspective for Low-Depth Trotter-Suzuki Decomposition},
  year      = {2024},
  issn      = {2469-9934},
  month     = apr,
  number    = {4},
  pages     = {042418},
  volume    = {109},
  doi       = {10.1103/PhysRevA.109.042418},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/intel-pauli.pdf:PDF},
  publisher = {American Physical Society (APS)},
}

@Article{Wootters1982,
  author    = {Wootters, W. K. and Zurek, W. H.},
  journal   = {Nature},
  title     = {A single quantum cannot be cloned},
  year      = {1982},
  issn      = {1476-4687},
  month     = oct,
  number    = {5886},
  pages     = {802--803},
  volume    = {299},
  doi       = {10.1038/299802a0},
  publisher = {Springer Science and Business Media LLC},
}

@Patent{Gray1953,
  number = {2,632,058},
  year   = {1953},
  author = {Gray, F.},
  title  = {Pulse code communication},
  type   = {Patent},
  url    = {http://www.google.com/patents/US2632058},
}

@Article{Vandaele2022,
  author    = {Vandaele, Vivien and Martiel, Simon and Goubault de Brugière, Timothée},
  journal   = {Quantum Science and Technology},
  title     = {Phase polynomials synthesis algorithms for NISQ architectures and beyond},
  year      = {2022},
  issn      = {2058-9565},
  month     = sep,
  number    = {4},
  pages     = {045027},
  volume    = {7},
  doi       = {10.1088/2058-9565/ac5a0e},
  file      = {:papers/vaendele-phasepoly.pdf:PDF},
  publisher = {IOP Publishing},
}

@Article{Griend2025,
  author    = {Meijer - van de Griend, Arianne},
  journal   = {Journal of Systems and Software},
  title     = {A comparison of quantum compilers using a DAG-based or phase polynomial-based intermediate representation},
  year      = {2025},
  issn      = {0164-1212},
  month     = mar,
  pages     = {112224},
  volume    = {221},
  doi       = {10.1016/j.jss.2024.112224},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/review-phasepoly.pdf:PDF},
  keywords  = {Compiling, Quantum computing, phase polynomial, parity matrix, simulated annealing},
  publisher = {Elsevier BV},
}

@Article{Sun_2023,
  author    = {Sun, Xiaoming and Tian, Guojing and Yang, Shuai and Yuan, Pei and Zhang, Shengyu},
  journal   = {IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems},
  title     = {Asymptotically Optimal Circuit Depth for Quantum State Preparation and General Unitary Synthesis},
  year      = {2023},
  issn      = {1937-4151},
  month     = oct,
  number    = {10},
  pages     = {3301--3314},
  volume    = {42},
  abstract  = {IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;2023;42;10;10.1109/TCAD.2023.3244885},
  doi       = {10.1109/TCAD.2023.3244885},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/sun2021.pdf:PDF},
  publisher = {Institute of Electrical and Electronics Engineers (IEEE)},
}

@Article{Hein2004,
  author    = {Hein, M. and Eisert, J. and Briegel, H. J.},
  journal   = {Physical Review A},
  title     = {Multiparty entanglement in graph states},
  year      = {2004},
  issn      = {1094-1622},
  month     = jun,
  number    = {6},
  pages     = {062311},
  volume    = {69},
  doi       = {10.1103/physreva.69.062311},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/graph-states.pdf:PDF},
  publisher = {American Physical Society (APS)},
}

@Article{Bravyi_2019,
  author    = {Bravyi, Sergey and Browne, Dan and Calpin, Padraic and Campbell, Earl and Gosset, David and Howard, Mark},
  journal   = {Quantum},
  title     = {Simulation of quantum circuits by low-rank stabilizer decompositions},
  year      = {2019},
  issn      = {2521-327X},
  month     = sep,
  pages     = {181},
  volume    = {3},
  doi       = {10.22331/q-2019-09-02-181},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/cliffsim1.pdf:PDF},
  publisher = {Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften},
  rights    = {CC BY 4.0},
}

@Article{Aaronson_2004,
  author    = {Aaronson, Scott and Gottesman, Daniel},
  journal   = {Physical Review A},
  title     = {Improved simulation of stabilizer circuits},
  year      = {2004},
  issn      = {1094-1622},
  month     = nov,
  number    = {5},
  pages     = {052328},
  volume    = {70},
  doi       = {10.1103/PhysRevA.70.052328},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/gottesman-knill.pdf:PDF},
  publisher = {American Physical Society (APS)},
}

@Article{Kissinger_2022,
  author    = {Kissinger, Aleks and van de Wetering, John},
  journal   = {Quantum Science and Technology},
  title     = {Simulating quantum circuits with ZX-calculus reduced stabiliser decompositions},
  year      = {2022},
  issn      = {2058-9565},
  month     = jul,
  number    = {4},
  pages     = {044001},
  volume    = {7},
  doi       = {10.1088/2058-9565/ac5d20},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/cliffsim2.pdf:PDF},
  publisher = {IOP Publishing},
}

@Article{Kliuchnikov2013,
  author    = {Kliuchnikov, Vadym and Maslov, Dmitri},
  journal   = {Physical Review A},
  title     = {Optimization of Clifford circuits},
  year      = {2013},
  issn      = {1094-1622},
  month     = nov,
  number    = {5},
  pages     = {052307},
  volume    = {88},
  doi       = {10.1103/physreva.88.052307},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/clifford-synth.pdf:PDF},
  publisher = {American Physical Society (APS)},
}

@Article{Bravyi2021a,
  author    = {Bravyi, Sergey and Shaydulin, Ruslan and Hu, Shaohan and Maslov, Dmitri},
  journal   = {Quantum},
  title     = {Clifford Circuit Optimization with Templates and Symbolic Pauli Gates},
  year      = {2021},
  issn      = {2521-327X},
  month     = nov,
  pages     = {580},
  volume    = {5},
  doi       = {10.22331/q-2021-11-16-580},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/cliff-peephole.pdf:PDF},
  publisher = {Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften},
  rights    = {CC BY 4.0},
}

@InProceedings{Fagan2018,
  author    = {Andrew Fagan and Ross Duncan},
  booktitle = {Proceedings 15th International Conference on Quantum Physics and Logic, {QPL} 2018, Halifax, Canada, 3-7th June 2018},
  title     = {Optimising Clifford Circuits with Quantomatic},
  year      = {2018},
  editor    = {Peter Selinger and Giulio Chiribella},
  pages     = {85--105},
  series    = {{EPTCS}},
  volume    = {287},
  bibsource = {dblp computer science bibliography, https://dblp.org},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1901-10114.bib},
  doi       = {10.4204/EPTCS.287.5},
  file      = {:papers/cliff-quantomatic.pdf:PDF},
  timestamp = {Thu, 14 Oct 2021 09:16:03 +0200},
  url       = {https://doi.org/10.4204/EPTCS.287.5},
}

@InProceedings{Gottesman1999,
  author    = {Daniel Gottesman},
  booktitle = {Group 22: Proceedings of the 12th International Colloquium onGroup Theoretical Methods in Physics,},
  title     = {The Heisenberg representation of quantum computers},
  year      = {1999},
  editor    = {S. P. Corney, R. Delbourgo, and P. D. Jarvis},
  pages     = {32--43},
  publisher = {International Press},
}

@InProceedings{Aaronson2018,
  author     = {Aaronson, Scott},
  booktitle  = {Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing},
  title      = {Shadow tomography of quantum states},
  year       = {2018},
  month      = jun,
  pages      = {325--338},
  publisher  = {ACM},
  series     = {STOC ’18},
  collection = {STOC ’18},
  doi        = {10.1145/3188745.3188802},
  keywords   = {shadow,tomography},
}

@Article{Maslov2018,
  author    = {Maslov, Dmitri and Roetteler, Martin},
  journal   = {IEEE Transactions on Information Theory},
  title     = {Shorter Stabilizer Circuits via Bruhat Decomposition and Quantum Circuit Transformations},
  year      = {2018},
  issn      = {1557-9654},
  month     = jul,
  number    = {7},
  pages     = {4729--4738},
  volume    = {64},
  doi       = {10.1109/tit.2018.2825602},
  publisher = {Institute of Electrical and Electronics Engineers (IEEE)},
}

@Article{Bravyi_2021,
  author    = {Bravyi, Sergey and Maslov, Dmitri},
  journal   = {IEEE Transactions on Information Theory},
  title     = {Hadamard-Free Circuits Expose the Structure of the Clifford Group},
  year      = {2021},
  issn      = {1557-9654},
  month     = jul,
  number    = {7},
  pages     = {4546--4563},
  volume    = {67},
  abstract  = {IEEE Transactions on Information Theory;2021;67;7;10.1109/TIT.2021.3081415},
  doi       = {10.1109/TIT.2021.3081415},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/maslow-cliff.pdf:PDF},
  publisher = {Institute of Electrical and Electronics Engineers (IEEE)},
}

@Article{Duncan2020,
  author    = {Duncan, Ross and Kissinger, Aleks and Perdrix, Simon and van de Wetering, John},
  journal   = {Quantum},
  title     = {Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus},
  year      = {2020},
  issn      = {2521-327X},
  month     = jun,
  pages     = {279},
  volume    = {4},
  doi       = {10.22331/q-2020-06-04-279},
  publisher = {Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften},
}

@Article{Prasad2006,
  author    = {Prasad, Aditya K. and Shende, Vivek V. and Markov, Igor L. and Hayes, John P. and Patel, Ketan N.},
  journal   = {ACM Journal on Emerging Technologies in Computing Systems},
  title     = {Data structures and algorithms for simplifying reversible circuits},
  year      = {2006},
  issn      = {1550-4840},
  month     = oct,
  number    = {4},
  pages     = {277--293},
  volume    = {2},
  doi       = {10.1145/1216396.1216399},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/revcirc.pdf:PDF},
  keywords  = {peephole},
  publisher = {Association for Computing Machinery (ACM)},
}

@Article{Iten2022,
  author    = {Iten, Raban and Moyard, Romain and Metger, Tony and Sutter, David and Woerner, Stefan},
  journal   = {ACM Transactions on Quantum Computing},
  title     = {Exact and Practical Pattern Matching for Quantum Circuit Optimization},
  year      = {2022},
  issn      = {2643-6817},
  month     = jan,
  number    = {1},
  pages     = {1--41},
  volume    = {3},
  doi       = {10.1145/3498325},
  keywords  = {pattern matching},
  publisher = {Association for Computing Machinery (ACM)},
}

@Misc{Rovara2024,
  author        = {Damian Rovara and Lukas Burgholzer and Robert Wille},
  title         = {A Framework for Debugging Quantum Programs},
  year          = {2024},
  archiveprefix = {arXiv},
  eprint        = {2412.12269},
  file          = {:/Users/luca/Documents/research/bibtexs/papers/mqt-debug.pdf:PDF},
  primaryclass  = {quant-ph},
  url           = {https://arxiv.org/abs/2412.12269},
}

@Misc{Gosset2024,
  author        = {David Gosset and Robin Kothari and Kewen Wu},
  title         = {Quantum state preparation with optimal T-count},
  year          = {2024},
  archiveprefix = {arXiv},
  eprint        = {2411.04790},
  file          = {:/Users/luca/Documents/research/bibtexs/papers/tcountbounds.pdf:PDF},
  primaryclass  = {quant-ph},
  url           = {https://arxiv.org/abs/2411.04790},
}

@InProceedings{Gogioso2022,
  author    = {Stefano Gogioso and Richie Yeung},
  booktitle = {Proceedings 19th International Conference on Quantum Physics and Logic, {QPL} 2022, Wolfson College, Oxford, UK, 27 June - 1 July 2022},
  title     = {Annealing Optimisation of Mixed {ZX} Phase Circuits},
  year      = {2022},
  editor    = {Stefano Gogioso and Matty Hoban},
  pages     = {415--431},
  series    = {{EPTCS}},
  volume    = {394},
  bibsource = {dblp computer science bibliography, https://dblp.org},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2206-11839.bib},
  doi       = {10.4204/EPTCS.394.20},
  timestamp = {Fri, 22 Dec 2023 11:34:29 +0100},
  url       = {https://doi.org/10.4204/EPTCS.394.20},
}

@InProceedings{Peham2023,
  author    = {Tom Peham and Nina Brandl and Richard Kueng and Robert Wille and Lukas Burgholzer},
  booktitle = {{IEEE} International Conference on Quantum Computing and Engineering, {QCE} 2023, Bellevue, WA, USA, September 17-22, 2023},
  title     = {Depth-Optimal Synthesis of Clifford Circuits with {SAT} Solvers},
  year      = {2023},
  editor    = {Brian La Cour and Lia Yeh and Marek Osinski},
  pages     = {802--813},
  publisher = {{IEEE}},
  bibsource = {dblp computer science bibliography, https://dblp.org},
  biburl    = {https://dblp.org/rec/conf/qce/PehamBKWB23.bib},
  doi       = {10.1109/QCE57702.2023.00095},
  timestamp = {Fri, 15 Dec 2023 20:24:40 +0100},
  url       = {https://doi.org/10.1109/QCE57702.2023.00095},
}

@InProceedings{Schneider2023,
  author     = {Schneider, Sarah and Burgholzer, Lukas and Wille, Robert},
  booktitle  = {Proceedings of the 28th Asia and South Pacific Design Automation Conference},
  title      = {A SAT Encoding for Optimal Clifford Circuit Synthesis},
  year       = {2023},
  month      = jan,
  publisher  = {IEEE},
  series     = {ASPDAC ’23},
  abstract   = {2023 28th Asia and South Pacific Design Automation Conference (ASP-DAC);2023; ; ;},
  collection = {ASPDAC ’23},
  doi        = {10.1145/3566097.3567929},
  file       = {:/Users/luca/Documents/research/bibtexs/papers/A_SAT_Encoding_for_Optimal_Clifford_Circuit_Synthesis.pdf:PDF},
}

@Misc{Winderl2024,
  author        = {David Winderl and Qunsheng Huang and Arianne Meijer-van de Griend and Richie Yeung},
  title         = {Architecture-Aware Synthesis of Stabilizer Circuits from Clifford Tableaus},
  year          = {2024},
  archiveprefix = {arXiv},
  eprint        = {2309.08972},
  file          = {:/Users/luca/Documents/research/bibtexs/papers/cliff-aa.pdf:PDF},
  primaryclass  = {quant-ph},
  url           = {https://arxiv.org/abs/2309.08972},
}

@Article{Saeedi2013,
  author    = {Saeedi, Mehdi and Markov, Igor L.},
  journal   = {ACM Computing Surveys},
  title     = {Synthesis and optimization of reversible circuits—a survey},
  year      = {2013},
  issn      = {1557-7341},
  month     = feb,
  number    = {2},
  pages     = {1--34},
  volume    = {45},
  doi       = {10.1145/2431211.2431220},
  publisher = {Association for Computing Machinery (ACM)},
}

@InProceedings{Shende2002,
  author     = {Shende, V.V. and Prasad, A.K. and Markov, I.L. and Hayes, J.P.},
  booktitle  = {IEEE/ACM International Conference on Computer Aided Design, 2002},
  title      = {Reversible logic circuit synthesis},
  year       = {2002},
  month      = nov,
  pages      = {353--360},
  publisher  = {IEEE},
  series     = {ICCAD-02},
  collection = {ICCAD-02},
  doi        = {10.1109/iccad.2002.1167558},
  issn       = {1092-3152},
}

@Misc{Shende2008,
  author        = {Vivek V. Shende and Igor L. Markov},
  title         = {On the CNOT-cost of TOFFOLI gates},
  year          = {2008},
  archiveprefix = {arXiv},
  eprint        = {0803.2316},
  primaryclass  = {quant-ph},
}

@Article{Li2014,
  author    = {Li, Zhiqiang and Chen, Hanwu and Song, Xiaoyu and Perkowski, Marek},
  journal   = {ACM Journal on Emerging Technologies in Computing Systems},
  title     = {A Synthesis Algorithm for 4-Bit Reversible Logic Circuits with Minimum Quantum Cost},
  year      = {2014},
  issn      = {1550-4840},
  month     = dec,
  number    = {3},
  pages     = {1--19},
  volume    = {11},
  doi       = {10.1145/2629542},
  publisher = {Association for Computing Machinery (ACM)},
}

@Article{Stojkovic2019,
  author    = {Stojković, Suzana and Stanković, Radomir and Moraga, Claudio and Stanković, Milena},
  journal   = {Journal of Circuits, Systems and Computers},
  title     = {Reversible Circuits Synthesis from Functional Decision Diagrams by using Node Dependency Matrices},
  year      = {2019},
  issn      = {1793-6454},
  month     = aug,
  number    = {05},
  pages     = {2050079},
  volume    = {29},
  doi       = {10.1142/s0218126620500796},
  publisher = {World Scientific Pub Co Pte Lt},
}

@InProceedings{Scott2008,
  author     = {Scott, Nathan O. and Dueck, Gerhard W.},
  booktitle  = {Proceedings of the 18th ACM Great Lakes symposium on VLSI},
  title      = {Pairwise decomposition of toffoli gates in a quantum circuit},
  year       = {2008},
  month      = may,
  pages      = {231--236},
  publisher  = {ACM},
  series     = {GLSVLSI08},
  collection = {GLSVLSI08},
  doi        = {10.1145/1366110.1366168},
}

@InProceedings{Arabzadeh2010,
  author    = {Arabzadeh, Mona and Saeedi, Mehdi and Zamani, Morteza Saheb},
  booktitle = {2010 15th Asia and South Pacific Design Automation Conference (ASP-DAC)},
  title     = {Rule-based optimization of reversible circuits},
  year      = {2010},
  month     = jan,
  pages     = {849--854},
  publisher = {IEEE},
  doi       = {10.1109/aspdac.2010.5419684},
}

@InBook{Datta2013,
  author    = {Datta, Kamalika and Rathi, Gaurav and Wille, Robert and Sengupta, Indranil and Rahaman, Hafizur and Drechsler, Rolf},
  pages     = {209--220},
  publisher = {Springer Berlin Heidelberg},
  title     = {Exploiting Negative Control Lines in the Optimization of Reversible Circuits},
  year      = {2013},
  isbn      = {9783642389863},
  booktitle = {Reversible Computation},
  doi       = {10.1007/978-3-642-38986-3_17},
  issn      = {1611-3349},
}

@InBook{Rahman2014,
  author    = {Rahman, Md Zamilur and Rice, Jacqueline E.},
  pages     = {125--136},
  publisher = {Springer International Publishing},
  title     = {Templates for Positive and Negative Control Toffoli Networks},
  year      = {2014},
  isbn      = {9783319084947},
  booktitle = {Reversible Computation},
  doi       = {10.1007/978-3-319-08494-7_10},
  issn      = {1611-3349},
}

@Article{Datta2015,
  author    = {Datta, Kamalika and Sengupta, Indranil and Rahaman, Hafizur},
  journal   = {IEEE Transactions on Computers},
  title     = {A Post-Synthesis Optimization Technique for Reversible Circuits Exploiting Negative Control Lines},
  year      = {2015},
  issn      = {2326-3814},
  month     = apr,
  number    = {4},
  pages     = {1208--1214},
  volume    = {64},
  doi       = {10.1109/tc.2014.2315641},
  publisher = {Institute of Electrical and Electronics Engineers (IEEE)},
}

@InProceedings{Arpita2015,
  author    = {Arpita, Pyreddy Mary and Datta, Kamalika and Vemula, Rohith and Sengupta, Indranil},
  booktitle = {2015 International Conference on Electronic Design, Computer Networks &amp; Automated Verification (EDCAV)},
  title     = {Optimization of reversible circuits using triple-gate templates at quantum gate level},
  year      = {2015},
  month     = jan,
  pages     = {120--124},
  publisher = {IEEE},
  doi       = {10.1109/edcav.2015.7060551},
}

@InProceedings{Abdessaied2016,
  author    = {Abdessaied, Nabila and Amy, Matthew and Soeken, Mathias and Drechsler, Rolf},
  booktitle = {2016 IEEE 46th International Symposium on Multiple-Valued Logic (ISMVL)},
  title     = {Technology Mapping of Reversible Circuits to Clifford+T Quantum Circuits},
  year      = {2016},
  month     = may,
  pages     = {150--155},
  publisher = {IEEE},
  doi       = {10.1109/ismvl.2016.33},
}

@Article{Gado2021,
  author    = {Gado, Mariam and Younes, Ahmed},
  journal   = {Symmetry},
  title     = {Optimization of Reversible Circuits Using Toffoli Decompositions with Negative Controls},
  year      = {2021},
  issn      = {2073-8994},
  month     = jun,
  number    = {6},
  pages     = {1025},
  volume    = {13},
  doi       = {10.3390/sym13061025},
  publisher = {MDPI AG},
}

@InProceedings{Mohammadi2008,
  author    = {Mohammadi, Majid and Eshghi, Mohammad},
  booktitle = {2008 5th International Multi-Conference on Systems, Signals and Devices},
  title     = {Behavioral description of quantum V and V+ gates to design quantum logic circuits},
  year      = {2008},
  month     = jul,
  pages     = {1--5},
  publisher = {IEEE},
  doi       = {10.1109/ssd.2008.4632850},
}

@InProceedings{Soeken2012,
  author    = {Soeken, M. and Sasanian, Z. and Wille, R. and Miller, D. M. and Drechsler, R.},
  booktitle = {2012 IEEE 42nd International Symposium on Multiple-Valued Logic},
  title     = {Optimizing the Mapping of Reversible Circuits to Four-Valued Quantum Gate Circuits},
  year      = {2012},
  month     = may,
  pages     = {173--178},
  publisher = {IEEE},
  doi       = {10.1109/ismvl.2012.64},
}

@InBook{Rahman2012,
  author    = {Rahman, Md. Mazder and Dueck, Gerhard W. and Banerjee, Anindita},
  pages     = {43--53},
  publisher = {Springer Berlin Heidelberg},
  title     = {Optimization of Reversible Circuits Using Reconfigured Templates},
  year      = {2012},
  isbn      = {9783642295171},
  booktitle = {Reversible Computation},
  doi       = {10.1007/978-3-642-29517-1_4},
  issn      = {1611-3349},
}

@Article{Maslov2016,
  author    = {Maslov, Dmitri},
  journal   = {Physical Review A},
  title     = {Advantages of using relative-phase Toffoli gates with an application to multiple control Toffoli optimization},
  year      = {2016},
  issn      = {2469-9934},
  month     = feb,
  number    = {2},
  pages     = {022311},
  volume    = {93},
  doi       = {10.1103/physreva.93.022311},
  publisher = {American Physical Society (APS)},
}

@Article{Wille2010,
  author    = {Wille, Robert and Drechsler, Rolf},
  journal   = {Electronic Notes in Theoretical Computer Science},
  title     = {Effect of BDD Optimization on Synthesis of Reversible and Quantum Logic},
  year      = {2010},
  issn      = {1571-0661},
  month     = mar,
  number    = {6},
  pages     = {57--70},
  volume    = {253},
  doi       = {10.1016/j.entcs.2010.02.006},
  publisher = {Elsevier BV},
}

@InProceedings{Pang2011,
  author    = {Pang, Yu and Wang, Shaoquan and He, Zhilong and Lin, Jinzhao and Sultana, Sayeeda and Radecka, Katarzyna},
  booktitle = {2011 IEEE 29th International Conference on Computer Design (ICCD)},
  title     = {Positive Davio-based synthesis algorithm for reversible logic},
  year      = {2011},
  month     = oct,
  pages     = {212--218},
  publisher = {IEEE},
  doi       = {10.1109/iccd.2011.6081399},
}

@InProceedings{Fazel2007,
  author    = {Fazel, K. and Thornton, M. A. and Rice, J. E.},
  booktitle = {2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing},
  title     = {ESOP-based Toffoli Gate Cascade Generation},
  year      = {2007},
  month     = aug,
  publisher = {IEEE},
  doi       = {10.1109/pacrim.2007.4313212},
}

@InProceedings{Bandyopadhyay2014,
  author    = {Bandyopadhyay, Chandan and Rahaman, Hafizur and Drechsler, Rolf},
  booktitle = {2014 IEEE 44th International Symposium on Multiple-Valued Logic},
  title     = {A Cube Pairing Approach for Synthesis of ESOP-Based Reversible Circuit},
  year      = {2014},
  month     = may,
  pages     = {109--114},
  publisher = {IEEE},
  doi       = {10.1109/ismvl.2014.27},
}

@InProceedings{Jegier2017,
  author    = {Jegier, Jerzy and Kerntopf, Paweł},
  booktitle = {Photonics Applications in Astronomy, Communications, Industry, and High Energy Physics Experiments 2017},
  title     = {PPRM-based approach to synthesis of reversible functions},
  year      = {2017},
  editor    = {Romaniuk, Ryszard S. and Linczuk, Maciej},
  month     = aug,
  pages     = {1044523},
  publisher = {SPIE},
  volume    = {10445},
  doi       = {10.1117/12.2280943},
  issn      = {0277-786X},
}

@InBook{Coecke2008,
  author    = {Coecke, Bob and Duncan, Ross},
  pages     = {298--310},
  publisher = {Springer Berlin Heidelberg},
  title     = {Interacting Quantum Observables},
  year      = {2008},
  isbn      = {9783540705833},
  booktitle = {Automata, Languages and Programming},
  doi       = {10.1007/978-3-540-70583-3_25},
  issn      = {1611-3349},
}

@Misc{vandewetering2020,
  author        = {John van de Wetering},
  title         = {ZX-calculus for the working quantum computer scientist},
  year          = {2020},
  archiveprefix = {arXiv},
  eprint        = {2012.13966},
  primaryclass  = {quant-ph},
}

@InProceedings{Coecke2012,
  author    = {Coecke, Bob and Duncan, Ross and Kissinger, Aleks and Wang, Quanlong},
  booktitle = {2012 27th Annual IEEE Symposium on Logic in Computer Science},
  title     = {Strong Complementarity and Non-locality in Categorical Quantum Mechanics},
  year      = {2012},
  month     = jun,
  pages     = {245--254},
  publisher = {IEEE},
  doi       = {10.1109/lics.2012.35},
}

@Article{Backens2019,
  author    = {Backens, Miriam and Kissinger, Aleks},
  journal   = {Electronic Proceedings in Theoretical Computer Science},
  title     = {ZH: A Complete Graphical Calculus for Quantum Computations Involving Classical Non-linearity},
  year      = {2019},
  issn      = {2075-2180},
  month     = jan,
  pages     = {23--42},
  volume    = {287},
  booktitle = {Proceedings of the 15th International Conference on Quantum Physics and Logic, Halifax, Canada, 3-7th June 2018},
  doi       = {10.4204/EPTCS.287.2},
  editor    = {Selinger, Peter and Chiribella, Giulio},
  keywords  = {ZH-calculus, Completeness},
  link      = {https://arxiv.org/abs/1805.02175},
  publisher = {Open Publishing Association},
  series    = {Electronic Proceedings in Theoretical Computer Science},
  urldate   = {2018-05-06},
}

@InProceedings{Roy2011,
  author    = {Roy, Shibdas and Home, Dipankar and Kar, Guruprasad and Majumda, Archan S.},
  booktitle = {AIP Conference Proceedings},
  title     = {Towards Normal Forms for GHZ∕W Calculus},
  year      = {2011},
  pages     = {112--119},
  publisher = {AIP},
  doi       = {10.1063/1.3635852},
  issn      = {0094-243X},
}

@Misc{Duncan2019,
  author        = {{Duncan}, Ross and {Kissinger}, Aleks and {Perdrix}, Simon and {van de Wetering}, John},
  month         = feb,
  title         = {{Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus}},
  year          = {2019},
  archiveprefix = {arXiv},
  eprint        = {1902.03178},
  primaryclass  = {quant-ph},
}

@Misc{Wetering2024,
  author        = {John van de Wetering and Richie Yeung and Tuomas Laakkonen and Aleks Kissinger},
  title         = {Optimal compilation of parametrised quantum circuits},
  year          = {2024},
  archiveprefix = {arXiv},
  eprint        = {2401.12877},
  primaryclass  = {quant-ph},
  url           = {https://arxiv.org/abs/2401.12877},
}

@InProceedings{Felice2023,
  author    = {de Felice, Giovanni and Coecke, Bob},
  booktitle = {Proceedings 19th International Conference on Quantum Physics and Logic, Wolfson College, Oxford, UK, 27 June - 1 July 2022},
  title     = {Quantum Linear Optics via String Diagrams},
  year      = {2023},
  editor    = {Gogioso, Stefano and Hoban, Matty},
  pages     = {83-100},
  publisher = {Open Publishing Association},
  series    = {Electronic Proceedings in Theoretical Computer Science},
  volume    = {394},
  abstract  = {We establish a formal bridge between qubit-based and photonic quantum computing. We do this by defining a functor from the ZX calculus to linear optical circuits. In the process we provide a compositional theory of quantum linear optics which allows to reason about events involving multiple photons such as those required to perform linear-optical and fusion-based quantum computing.},
  doi       = {10.4204/EPTCS.394.6},
  video     = {https://www.youtube.com/watch?v=BomcbwrJxvs},
}

@InProceedings{Ehrig1973,
  author    = {Hartmut Ehrig and Michael Pfender and Hans Jürgen Schneider},
  booktitle = {14th Annual Symposium on Switching and Automata Theory, Iowa City, Iowa, USA, October 15-17, 1973},
  title     = {Graph-Grammars: An Algebraic Approach},
  year      = {1973},
  pages     = {167--180},
  publisher = {{IEEE} Computer Society},
  bibsource = {dblp computer science bibliography, https://dblp.org},
  biburl    = {https://dblp.org/rec/conf/focs/EhrigPS73.bib},
  doi       = {10.1109/SWAT.1973.11},
  timestamp = {Thu, 23 Mar 2023 23:57:53 +0100},
  url       = {https://doi.org/10.1109/SWAT.1973.11},
}

@Book{Rozenberg1997,
  author    = {Grzegorz Rozenberg},
  publisher = {World Scientific},
  title     = {Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations},
  year      = {1997},
  isbn      = {9810228848},
  bibsource = {dblp computer science bibliography, https://dblp.org},
  biburl    = {https://dblp.org/rec/conf/gg/1997handbook.bib},
  timestamp = {Thu, 08 Jun 2017 18:28:27 +0200},
}

@InProceedings{Koenig2018,
  author    = {Barbara König and Dennis Nolte and Julia Padberg and Arend Rensink},
  booktitle = {Graph Transformation, Specifications, and Nets - In Memory of Hartmut Ehrig},
  title     = {A Tutorial on Graph Transformation},
  year      = {2018},
  editor    = {Reiko Heckel and Gabriele Taentzer},
  pages     = {83--104},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {10800},
  bibsource = {dblp computer science bibliography, https://dblp.org},
  biburl    = {https://dblp.org/rec/conf/birthday/0001NPR18.bib},
  doi       = {10.1007/978-3-319-75396-6\_5},
  file      = {:papers/graph-rewrite-tut.pdf:PDF},
  timestamp = {Tue, 14 May 2019 10:00:52 +0200},
  url       = {https://doi.org/10.1007/978-3-319-75396-6\_5},
}

@InCollection{Dershowitz1990,
  author    = {Dershowitz, Nachum and Jouannaud, Jean-Pierre},
  booktitle = {Formal Models and Semantics},
  publisher = {Elsevier},
  title     = {Rewrite Systems},
  year      = {1990},
  chapter   = {6},
  editor    = {van Leeuwen, Jan},
  pages     = {243--320},
  series    = {Handbook of Theoretical Computer Science},
  volume    = {B},
}

@Book{Bezem2003,
  author    = {Marc Bezem and Jan Willem Klop and Roel Vrijer},
  editor    = {Marc Bezem and Jan Willem Klop and Roel Vrijer},
  publisher = {Cambridge University Press},
  title     = {Term Rewriting Systems},
  year      = {2003},
  address   = {Cambridge},
  edition   = {1. publ.},
  isbn      = {978-0-521-39115-3},
  number    = {55},
  series    = {Cambridge tracts in theoretical computer science},
  pagetotal = {884},
  ppn_gvk   = {120269953},
  subtitle  = {Terese},
}

@Misc{Biamonte2023,
  author        = {J Biamonte and A Nasrallah},
  title         = {The ZX-Calculus is Canonical in the Heisenberg Picture for Stabilizer Quantum Mechanics},
  year          = {2023},
  archiveprefix = {arXiv},
  eprint        = {2301.05717},
  primaryclass  = {quant-ph},
  url           = {https://arxiv.org/abs/2301.05717},
}

@Article{Verma1995,
  author    = {Verma, Rakesh M.},
  journal   = {Theoretical Computer Science},
  title     = {Transformations and confluence for rewrite systems},
  year      = {1995},
  issn      = {0304-3975},
  month     = dec,
  number    = {2},
  pages     = {269--283},
  volume    = {152},
  doi       = {10.1016/0304-3975(94)00255-0},
  publisher = {Elsevier BV},
}

@Article{Backens2014,
  author    = {Backens, Miriam},
  journal   = {New Journal of Physics},
  title     = {The ZX-calculus is complete for stabilizer quantum mechanics},
  year      = {2014},
  issn      = {1367-2630},
  month     = sep,
  number    = {9},
  pages     = {093021},
  volume    = {16},
  doi       = {10.1088/1367-2630/16/9/093021},
  publisher = {IOP Publishing},
}

@InProceedings{Kissinger2020,
  author    = {Kissinger, Aleks and van de Wetering, John},
  booktitle = {Proceedings 16th International Conference on Quantum Physics and Logic, Chapman University, Orange, CA, USA., 10-14 June 2019},
  title     = {{PyZX: Large Scale Automated Diagrammatic Reasoning}},
  year      = {2020},
  editor    = {Coecke, Bob and Leifer, Matthew},
  pages     = {229-241},
  publisher = {Open Publishing Association},
  series    = {Electronic Proceedings in Theoretical Computer Science},
  volume    = {318},
  abstract  = {The ZX-calculus is a graphical language for reasoning about ZX-diagrams, a tensor network-like language that can represent arbitrary linear maps between qubits. Using the ZX-calculus, we can intuitively reason about quantum mechanics, and optimise and validate quantum circuits. In this paper we introduce PyZX, an open source library for automated reasoning with large ZX-diagrams. We give a brief introduction to the ZX-calculus, then show how PyZX implements methods for circuit optimisation, equality validation, and visualisation and how it can be used in tandem with other software. We end with a set of challenges that when solved would expand the power of automated diagrammatic reasoning.},
  doi       = {10.4204/EPTCS.318.14},
  keywords  = {ZX-calculus, Optimisation, PyZX, Automation},
  link      = {https://arxiv.org/abs/1904.04735},
  urldate   = {2019-04-09},
  video     = {https://www.youtube.com/watch?v=JafI_LZts2g},
}

@Article{Yeung2024,
  author   = {Yeung, Richie and Meichanetzidis, Konstantinos and Krajenbrink, Alexandre and Charton, François},
  journal  = {MathAI submission},
  title    = {{Teaching small transformers to rewrite ZX diagrams}},
  year     = {2024},
  abstract = {ZX calculus is a graphical language for reasoning about linear maps. Maps are represented as graphs, and reasoning amounts to graph rewrites. The main applications of ZX calculus are in quantum computation. We train small transformers to simplify ZX graphs, i.e. perform resource optimisation of quantum circuits. Preliminary experiments show that transformers can be trained to simplify CNOT and Clifford circuits with high accuracy. These are the simplest kinds of ZX graphs, in the sense that there exists an efficient rewrite strategy. We also show evidence that transformers learn to simplify the more complex Clifford+T graphs, for which in general there does not exist an efficient simplification algorithm.},
  keywords = {Optimisation, Automation, ZX-calculus},
  link     = {https://mathai2023.github.io/papers/34.pdf},
  urldate  = {2023-08-28},
  video    = {https://www.youtube.com/watch?v=gW_ZzRoIUMU},
}

@PhdThesis{Borgna2023,
  author   = {Borgna, Agust\'in},
  school   = {Loria, Universit\'e de Lorraine},
  title    = {{Towards a compiler toolchain for quantum programs}},
  year     = {2023},
  keywords = {ZX-calculus, Scalable ZX, Mixed States, Protocols, PyZX, Automation, Optimisation, Category Theory, Circuit Extraction, Applied, PhD Thesis},
  link     = {https://lmf.cnrs.fr/downloads/Perso/thesis-aborgna.pdf},
  urldate  = {2023-01-13},
}

@Article{Backens2021,
  author    = {Backens, Miriam and Miller-Bakewell, Hector and de Felice, Giovanni and Lobski, Leo and van de Wetering, John},
  journal   = {Quantum},
  title     = {{There and back again: A circuit extraction tale}},
  year      = {2021},
  issn      = {2521-327X},
  month     = mar,
  pages     = {421},
  volume    = {5},
  abstract  = {We give the first circuit-extraction algorithm to work for one-way computations containing measurements in all three planes and having gflow. The algorithm is efficient and the resulting circuits do not contain ancillae. One-way computations are represented using the ZX-calculus, hence the algorithm also represents the most general known procedure for extracting circuits from ZX-diagrams. In developing this algorithm, we generalise several concepts and results previously known for computations containing only XY-plane measurements. We bring together several known rewrite rules for measurement patterns and formalise them in a unified notation using the ZX-calculus. These rules are used to simplify measurement patterns by reducing the number of qubits while preserving both the semantics and the existence of gflow. The results can be applied to circuit optimisation by translating circuits to patterns and back again.},
  doi       = {10.22331/q-2021-03-25-421},
  keywords  = {ZX-Calculus, circuit extraction, MBQC, gflow, Optimisation, Graph States, Phase Gadgets, Applied},
  link      = {https://arxiv.org/abs/2003.01664},
  publisher = {{Verein zur F{\"{o}}rderung des Open Access Publizierens in den Quantenwissenschaften}},
  urldate   = {2020-03-03},
  video     = {https://www.youtube.com/watch?v=Orilw6ujWag},
}

@InProceedings{Quanz2024,
  author    = {Quanz, Marcel and Staudacher, Korbinian and Fürlinger, Karl},
  booktitle = {2024 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)},
  title     = {Parallel Quantum Circuit Extraction from MBQC-Patterns},
  year      = {2024},
  pages     = {1078-1087},
  abstract  = {In the model of measurement-based quantum computing (MBQC), computations are performed via sequential measurements on a highly entangled graph state. MBQC is a natural model for photonic quantum computing and has been shown to be useful for tasks like optimization and verification of general quantum computations. Therefore, it is often necessary to translate between MBQC and the predominantly used quantum circuit model in a fast and reliable way. While there are algorithms with linear complexity to extract quantum circuits from measurement patterns using additional ancilla qubits, efficient ancilla-free extraction has shown to be more costly. We develop strategies to parallelize an existing extraction algorithm based on ZX-calculus by exploiting the graph structure of measurement patterns and evaluate the performance on patterns obtained from a benchmark set of quantum circuits. Our results suggest that possible parallelization speedups are closely related to the graph structure of a pattern.},
  doi       = {10.1109/IPDPSW63119.2024.00179},
  keywords  = {MBQC, ZX-calculus, Circuit Extraction, Applied},
  link      = {https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=10596505&casa_token=IvO5I8HAAmsAAAAA:s1XrQZcpF079508i5_tYXIbnybpxOWLWMuGULR-iMG0gI6LUZh9bw2OHBsaAOUYTySpqIi-jHwo&tag=1},
  urldate   = {2024-09-15},
}

@Misc{Heurtel2024,
  author        = {Nicolas Heurtel},
  title         = {A Complete Graphical Language for Linear Optical Circuits with Finite-Photon-Number Sources and Detectors},
  year          = {2024},
  archiveprefix = {arXiv},
  eprint        = {2402.17693},
  primaryclass  = {quant-ph},
  url           = {https://arxiv.org/abs/2402.17693},
}

@Misc{Booth2024,
  author        = {Robert I. Booth and Titouan Carette and Cole Comfort},
  title         = {Graphical Symplectic Algebra},
  year          = {2024},
  archiveprefix = {arXiv},
  eprint        = {2401.07914},
  primaryclass  = {cs.LO},
  url           = {https://arxiv.org/abs/2401.07914},
}

@Article{Felice2023a,
  author    = {de Felice, Giovanni and Shaikh, Razin A. and Poór, Boldizsár and Yeh, Lia and Wang, Quanlong and Coecke, Bob},
  journal   = {Electronic Proceedings in Theoretical Computer Science},
  title     = {Light-Matter Interaction in the ZXW Calculus},
  year      = {2023},
  issn      = {2075-2180},
  month     = aug,
  pages     = {20--46},
  volume    = {384},
  abstract  = {In this paper, we develop a graphical calculus to rewrite photonic circuits involving light-matter interactions and non-linear optical effects. We introduce the infinite ZW calculus, a graphical language for linear operators on the bosonic Fock space which captures both linear and non-linear photonic circuits. This calculus is obtained by combining the QPath calculus, a diagrammatic language for linear optics, and the recently developed qudit ZXW calculus, a complete axiomatisation of linear maps between qudits. It comes with a 'lifting' theorem allowing to prove equalities between infinite operators by rewriting in the ZXW calculus. We give a method for representing bosonic and fermionic Hamiltonians in the infinite ZW calculus. This allows us to derive their exponentials by diagrammatic reasoning. Examples include phase shifts and beam splitters, as well as non-linear Kerr media and Jaynes-Cummings light-matter interaction.},
  booktitle = {Proceedings of the Twentieth International Conference on Quantum Physics and Logic, Paris, France, 17-21st July 2023},
  doi       = {10.4204/EPTCS.384.2},
  editor    = {Mansfield, Shane and Val\^iron, Benoit and Zamdzhiev, Vladimir},
  keywords  = {Photons, ZW-calculus, Fermionic quantum computing, Algebraic ZX, Qudits, Qudits},
  link      = {http://arxiv.org/abs/2306.02114},
  publisher = {Open Publishing Association},
  series    = {Electronic Proceedings in Theoretical Computer Science},
  urldate   = {2023-06-03},
  video     = {https://www.youtube.com/watch?v=nOli0jB2hoY},
}

@InProceedings{Carette2023,
  author    = {Carette, Titouan and Hoffreumon, Timothée and Larroque, Émile and Vilmart, Renaud},
  booktitle = {2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
  title     = {Complete Graphical Language for Hermiticity-Preserving Superoperators},
  year      = {2023},
  month     = jun,
  pages     = {1--22},
  publisher = {IEEE},
  abstract  = {Universal and complete graphical languages have been successfully designed for pure state quantum mechanics, corresponding to linear maps between Hilbert spaces, and mixed states quantum mechanics, corresponding to completely positive superoperators. In this paper, we go one step further and present a universal and complete graphical language for Hermiticity-preserving superoperators. Such a language opens the possibility of diagrammatic compositional investigations of antilinear transformations featured in various physical situations, such as the Choi-Jamio{\l}kowski isomorphism, spin-flip, or entanglement witnesses. Our construction relies on an extension of the ZW-calculus exhibiting a normal form for Hermitian matrices.},
  doi       = {10.1109/LICS56636.2023.10175712},
  keywords  = {ZW-calculus, Completeness, Category Theory, Mixed States},
  link      = {http://arxiv.org/abs/2302.04212},
  urldate   = {2023-02-08},
}

@InProceedings{Borgna2021,
  author    = {Borgna, Agust{\'i}n and Perdrix, Simon and Valiron, Beno{\^i}t},
  booktitle = {Programming Languages and Systems},
  title     = {Hybrid Quantum-Classical Circuit Simplification with the ZX-Calculus},
  year      = {2021},
  address   = {Cham},
  editor    = {Oh, Hakjoo},
  pages     = {121--139},
  publisher = {Springer International Publishing},
  doi       = {10.1007/978-3-030-89051-3_8},
  file      = {:papers/agustin-hybrid-zx.pdf:PDF},
  isbn      = {9783030890513},
  issn      = {1611-3349},
  keywords  = {ZX-calculus, Mixed States, Optimisation, Automation, PyZX, Applied},
  link      = {http://arxiv.org/abs/2109.06071},
  urldate   = {2021-09-13},
  video     = {https://www.youtube.com/watch?v=-Frd8w-hTD0},
}

@Misc{KoziellPipe2024,
  author        = {Alexander Koziell-Pipe and Aleks Kissinger},
  title         = {Hybrid Quantum-Classical Machine Learning with String Diagrams},
  year          = {2024},
  archiveprefix = {arXiv},
  eprint        = {2407.03673},
  primaryclass  = {quant-ph},
  url           = {https://arxiv.org/abs/2407.03673},
}

@Article{Carette2021,
  author    = {Carette, Titouan and Jeandel, Emmanuel and Perdrix, Simon and Vilmart, Renaud},
  journal   = {ACM Transactions on Quantum Computing},
  title     = {Completeness of Graphical Languages for Mixed State Quantum Mechanics},
  year      = {2021},
  issn      = {2643-6817},
  month     = dec,
  number    = {4},
  pages     = {1--28},
  volume    = {2},
  doi       = {10.1145/3464693},
  publisher = {Association for Computing Machinery (ACM)},
}

@PhdThesis{Amy2019,
  author = {Matthew Amy},
  school = {University of Waterloo},
  title  = {Formal methods in Quantum Circuit Design},
  year   = {2019},
  url    = {https://uwspace.uwaterloo.ca/handle/10012/14480},
}

@Article{McKeeman1965,
  author    = {McKeeman, W. M.},
  journal   = {Communications of the ACM},
  title     = {Peephole optimization},
  year      = {1965},
  issn      = {1557-7317},
  month     = jul,
  number    = {7},
  pages     = {443--444},
  volume    = {8},
  doi       = {10.1145/364995.365000},
  publisher = {Association for Computing Machinery (ACM)},
}

@InProceedings{Liu2021,
  author    = {Liu, Ji and Bello, Luciano and Zhou, Huiyang},
  booktitle = {2021 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)},
  title     = {Relaxed Peephole Optimization: A Novel Compiler Optimization for Quantum Circuits},
  year      = {2021},
  month     = feb,
  pages     = {301--314},
  publisher = {IEEE},
  doi       = {10.1109/cgo51591.2021.9370310},
}

@Article{Tanenbaum1982,
  author    = {Tanenbaum, Andrew S. and van Staveren, Hans and Stevenson, Johan W.},
  journal   = {ACM Transactions on Programming Languages and Systems},
  title     = {Using Peephole Optimization on Intermediate Code},
  year      = {1982},
  issn      = {1558-4593},
  month     = jan,
  number    = {1},
  pages     = {21--36},
  volume    = {4},
  doi       = {10.1145/357153.357155},
  publisher = {Association for Computing Machinery (ACM)},
}

@Article{Menendez2017,
  author    = {Menendez, David and Nagarakatte, Santosh},
  journal   = {ACM SIGPLAN Notices},
  title     = {Alive-Infer: data-driven precondition inference for peephole optimizations in LLVM},
  year      = {2017},
  issn      = {1558-1160},
  month     = jun,
  number    = {6},
  pages     = {49--63},
  volume    = {52},
  doi       = {10.1145/3140587.3062372},
  publisher = {Association for Computing Machinery (ACM)},
}

@InProceedings{Lopes2015,
  author     = {Lopes, Nuno P. and Menendez, David and Nagarakatte, Santosh and Regehr, John},
  booktitle  = {Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation},
  title      = {Provably correct peephole optimizations with alive},
  year       = {2015},
  month      = jun,
  pages      = {22--32},
  publisher  = {ACM},
  series     = {PLDI ’15},
  collection = {PLDI ’15},
  doi        = {10.1145/2737924.2737965},
}

@Article{Click1995,
  author    = {Click, Cliff and Cooper, Keith D.},
  journal   = {ACM Transactions on Programming Languages and Systems},
  title     = {Combining analyses, combining optimizations},
  year      = {1995},
  issn      = {1558-4593},
  month     = mar,
  number    = {2},
  pages     = {181--196},
  volume    = {17},
  doi       = {10.1145/201059.201061},
  publisher = {Association for Computing Machinery (ACM)},
}

@Misc{Riddle2021,
  author       = {River Riddle},
  howpublished = {on 13/01/2025 (RFC on Discourse)},
  month        = nov,
  title        = {PDLL: a new declarative rewrite frontend for MLIR},
  year         = {2021},
  series       = {Request for Comments},
  url          = {https://discourse.llvm.org/t/rfc-pdll-a-new-declarative-rewrite-frontend-for-mlir/4798},
}

@InProceedings{Thier2018,
  author     = {Thier, Patrick and Ertl, M. Anton and Krall, Andreas},
  booktitle  = {Proceedings of the 27th International Conference on Compiler Construction},
  title      = {Fast and flexible instruction selection with constraints},
  year       = {2018},
  month      = feb,
  pages      = {93--103},
  publisher  = {ACM},
  series     = {CGO ’18},
  collection = {CGO ’18},
  doi        = {10.1145/3178372.3179501},
}

@Book{Muchnick2007,
  author    = {Muchnick, Steven S.},
  publisher = {Morgan Kaufmann},
  title     = {Advanced compiler design and implementation},
  year      = {2007},
  address   = {San Francisco, Calif. [u.a.]},
  edition   = {[Nachdr.]},
  isbn      = {9781558603202},
  note      = {Nachdr. der Ausg. 1997},
  pagetotal = {856},
  ppn_gvk   = {588863629},
}

@InProceedings{Cheung2007,
  author       = {Cheung, Donny and Maslov, Dmitri and Severini, Simone},
  booktitle    = {Workshop on quantum information processing},
  title        = {Translation techniques between quantum circuit architectures},
  year         = {2007},
  organization = {Citeseer},
  pages        = {1--3},
}

@Misc{Tucci2005,
  author        = {Robert R. Tucci},
  title         = {An Introduction to Cartan's KAK Decomposition for QC Programmers},
  year          = {2005},
  archiveprefix = {arXiv},
  eprint        = {quant-ph/0507171},
  primaryclass  = {quant-ph},
  url           = {https://arxiv.org/abs/quant-ph/0507171},
}

@Article{Cross2019,
  author    = {Cross, Andrew W. and Bishop, Lev S. and Sheldon, Sarah and Nation, Paul D. and Gambetta, Jay M.},
  journal   = {Physical Review A},
  title     = {Validating quantum computers using randomized model circuits},
  year      = {2019},
  issn      = {2469-9934},
  month     = sep,
  number    = {3},
  pages     = {032328},
  volume    = {100},
  doi       = {10.1103/physreva.100.032328},
  publisher = {American Physical Society (APS)},
}

@Article{Chatzisavvas2009,
  author    = {Chatzisavvas, K. Ch. and Chadzitaskos, G. and Daskaloyannis, C. and Schirmer, S. G.},
  journal   = {Physical Review A},
  title     = {Improving quantum gate fidelities using optimized Euler angles},
  year      = {2009},
  issn      = {1094-1622},
  month     = nov,
  number    = {5},
  pages     = {052329},
  volume    = {80},
  doi       = {10.1103/physreva.80.052329},
  publisher = {American Physical Society (APS)},
}

@Misc{autorebase,
  author       = {TKET contributors},
  howpublished = {on 13/01/2025 (TKET docs)},
  title        = {Documentation: pytket.passes.AutoRebase},
  year         = {2025},
  url          = {https://docs.quantinuum.com/tket/api-docs/passes.html#pytket.passes.AutoRebase},
}

@InProceedings{Liang2023,
  author    = {Liang, Youwei and Stone, Kevin and Shameli, Ali and Cummins, Chris and Elhoushi, Mostafa and Guo, Jiadong and Steiner, Benoit and Yang, Xiaomeng and Xie, Pengtao and Leather, Hugh and Tian, Yuandong},
  booktitle = {Proceedings of the 40th International Conference on Machine Learning},
  title     = {Learning Compiler Pass Orders using Coreset and Normalized Value Prediction},
  year      = {2023},
  publisher = {JMLR.org},
  series    = {ICML'23},
  abstract  = {Finding the optimal pass sequence of compilation can lead to a significant reduction in program size. Prior works on compilation pass ordering have two major drawbacks. They either require an excessive budget (in terms of the number of compilation passes) at compile time or fail to generalize to unseen programs. In this work, instead of predicting passes sequentially, we directly learn a policy on the pass sequence space, which outperforms the default -Oz flag by an average of 4.5\% over a large collection (4683) of unseen code repositories from diverse domains across 14 datasets. To achieve this, we first identify a small set (termed coreset) of pass sequences that generally optimize the size of most programs. Then, a policy is learned to pick the optimal sequences by predicting the normalized values of the pass sequences in the coreset. Our results demonstrate that existing human-designed compiler passes can be improved with a simple yet effective technique that leverages pass sequence space which contains dense rewards, while approaches operating on the individual pass space may suffer from issues of sparse reward, and do not generalize well to heldout programs from different domains. Website: https://rlcompopt.github.io},
  articleno = {855},
  copyright = {Creative Commons Attribution 4.0 International},
  doi       = {10.48550/ARXIV.2301.05104},
  keywords  = {Programming Languages (cs.PL), Artificial Intelligence (cs.AI), Machine Learning (cs.LG), FOS: Computer and information sciences, FOS: Computer and information sciences},
  location  = {Honolulu, Hawaii, USA},
  numpages  = {17},
}

@InProceedings{Clement2024,
  author     = {Clément, Alexandre and Delorme, Noé and Perdrix, Simon},
  booktitle  = {Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science},
  title      = {Minimal Equational Theories for Quantum Circuits},
  year       = {2024},
  month      = jul,
  pages      = {1--14},
  publisher  = {ACM},
  series     = {LICS ’24},
  collection = {LICS ’24},
  doi        = {10.1145/3661814.3662088},
}

@InProceedings{Clement2023,
  author    = {Clément, Alexandre and Heurtel, Nicolas and Mansfield, Shane and Perdrix, Simon and Valiron, Benoît},
  booktitle = {2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
  title     = {A Complete Equational Theory for Quantum Circuits},
  year      = {2023},
  month     = jun,
  pages     = {1--13},
  publisher = {IEEE},
  doi       = {10.1109/lics56636.2023.10175801},
}

@Article{Maslov2008,
  author    = {Maslov, D. and Dueck, G.W. and Miller, D.M. and Negrevergne, C.},
  journal   = {IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems},
  title     = {Quantum Circuit Simplification and Level Compaction},
  year      = {2008},
  issn      = {1937-4151},
  month     = mar,
  number    = {3},
  pages     = {436--444},
  volume    = {27},
  doi       = {10.1109/tcad.2007.911334},
  publisher = {Institute of Electrical and Electronics Engineers (IEEE)},
}

@InProceedings{Massalin1987,
  author     = {Massalin, Henry},
  booktitle  = {Proceedings of the second international conference on Architectual support for programming languages and operating systems},
  title      = {Superoptimizer: a look at the smallest program},
  year       = {1987},
  month      = oct,
  pages      = {122--126},
  publisher  = {ACM},
  series     = {ASPLOS II},
  collection = {ASPLOS II},
  doi        = {10.1145/36206.36194},
}

@Article{Bansal2006,
  author    = {Bansal, Sorav and Aiken, Alex},
  journal   = {ACM SIGARCH Computer Architecture News},
  title     = {Automatic generation of peephole superoptimizers},
  year      = {2006},
  issn      = {0163-5964},
  month     = oct,
  number    = {5},
  pages     = {394--403},
  volume    = {34},
  doi       = {10.1145/1168919.1168906},
  publisher = {Association for Computing Machinery (ACM)},
}

@Misc{Sands2011,
  author       = {Duncan Sands},
  howpublished = {on 13/01/2025 (LLVM Developer's meeting)},
  month        = nov,
  title        = {Super-optimizing LLVM IR},
  year         = {2011},
  url          = {http://llvm.org/devmtg/2011-11/Sands_Super-optimizingLLVMIR.pdf},
}

@InProceedings{Fraser1979,
  author     = {Fraser, Christopher W.},
  booktitle  = {Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL ’79},
  title      = {A compact, machine-independent peephole optimizer},
  year       = {1979},
  pages      = {1--6},
  publisher  = {ACM Press},
  series     = {POPL ’79},
  collection = {POPL ’79},
  doi        = {10.1145/567752.567753},
}

@Article{Sasnauskas2017,
  author     = {Raimondas Sasnauskas and Yang Chen and Peter Collingbourne and Jeroen Ketema and Jubi Taneja and John Regehr},
  journal    = {CoRR},
  title      = {Souper: {A} Synthesizing Superoptimizer},
  year       = {2017},
  volume     = {abs/1711.04422},
  bibsource  = {dblp computer science bibliography, https://dblp.org},
  biburl     = {https://dblp.org/rec/journals/corr/abs-1711-04422.bib},
  eprint     = {1711.04422},
  eprinttype = {arXiv},
  timestamp  = {Mon, 02 Aug 2021 08:40:02 +0200},
  url        = {http://arxiv.org/abs/1711.04422},
}

@InProceedings{Jia2019,
  author     = {Jia, Zhihao and Padon, Oded and Thomas, James and Warszawski, Todd and Zaharia, Matei and Aiken, Alex},
  booktitle  = {Proceedings of the 27th ACM Symposium on Operating Systems Principles},
  title      = {TASO: optimizing deep learning computation with automatic generation of graph substitutions},
  year       = {2019},
  month      = oct,
  pages      = {47--62},
  publisher  = {ACM},
  series     = {SOSP ’19},
  collection = {SOSP ’19},
  doi        = {10.1145/3341301.3359630},
  journal    = {Proceedings of the 27th ACM Symposium on Operating Systems Principles},
  url        = {https://api.semanticscholar.org/CorpusID:202726856},
}

@Article{Fang2020,
  author    = {Fang, Jingzhi and Shen, Yanyan and Wang, Yue and Chen, Lei},
  journal   = {Proceedings of the VLDB Endowment},
  title     = {Optimizing DNN computation graph using graph substitutions},
  year      = {2020},
  issn      = {2150-8097},
  month     = aug,
  number    = {12},
  pages     = {2734--2746},
  volume    = {13},
  doi       = {10.14778/3407790.3407857},
  publisher = {Association for Computing Machinery (ACM)},
  url       = {https://api.semanticscholar.org/CorpusID:221539744},
}

@InProceedings{Xu2022,
  author     = {Xu, Mingkuan and Li, Zikun and Padon, Oded and Lin, Sina and Pointing, Jessica and Hirth, Auguste and Ma, Henry and Palsberg, Jens and Aiken, Alex and Acar, Umut A. and Jia, Zhihao},
  booktitle  = {Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation},
  title      = {{Quartz: Superoptimization of Quantum Circuits}},
  year       = {2022},
  month      = jun,
  pages      = {625--640},
  publisher  = {Association for Computing Machinery},
  series     = {PLDI 2022},
  collection = {PLDI ’22},
  doi        = {10.1145/3519939.3523433},
  file       = {:papers/quartz.pdf:PDF},
  isbn       = {9781450392655},
  keywords   = {quantum computing, superoptimization},
  location   = {San Diego, CA, USA},
  numpages   = {16},
}

@Article{Xu2023,
  author    = {Xu, Amanda and Molavi, Abtin and Pick, Lauren and Tannu, Swamit and Albarghouthi, Aws},
  journal   = {Proceedings of the ACM on Programming Languages},
  title     = {Synthesizing Quantum-Circuit Optimizers},
  year      = {2023},
  issn      = {2475-1421},
  month     = jun,
  number    = {PLDI},
  pages     = {835--859},
  volume    = {7},
  doi       = {10.1145/3591254},
  publisher = {Association for Computing Machinery (ACM)},
}

@Article{Tate2009,
  author    = {Tate, Ross and Stepp, Michael and Tatlock, Zachary and Lerner, Sorin},
  journal   = {ACM SIGPLAN Notices},
  title     = {Equality saturation: a new approach to optimization},
  year      = {2009},
  issn      = {1558-1160},
  month     = jan,
  number    = {1},
  pages     = {264--276},
  volume    = {44},
  doi       = {10.1145/1594834.1480915},
  publisher = {Association for Computing Machinery (ACM)},
}

@Article{Whitfield1997,
  author    = {Whitfield, Deborah L. and Soffa, Mary Lou},
  journal   = {ACM Transactions on Programming Languages and Systems},
  title     = {An approach for exploring code improving transformations},
  year      = {1997},
  issn      = {1558-4593},
  month     = nov,
  number    = {6},
  pages     = {1053--1084},
  volume    = {19},
  doi       = {10.1145/267959.267960},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/phase-order2.pdf:PDF},
  publisher = {Association for Computing Machinery (ACM)},
}

@PhdThesis{Willsey2021,
  author = {Max Willsey},
  school = {University of Washington},
  title  = {Practical and Flexible Equality Saturation},
  year   = {2021},
  file   = {:/Users/luca/Documents/research/bibtexs/papers/egg-thesis.pdf:PDF},
}

@Misc{Willsey2025,
  author       = {Max Willsey},
  howpublished = {on 14/01/2025 (code repository)},
  title        = {egg: egraphs good},
  year         = {2025},
  url          = {https://github.com/egraphs-good/egg},
}

@Misc{Bernstein2024,
  author       = {Max Bernstein},
  howpublished = {on 14/01/2025 (blog post)},
  month        = sep,
  title        = {What's in an e-graph?},
  year         = {2024},
  url          = {https://bernsteinbear.com/blog/whats-in-an-egraph/},
}

@Misc{Fallin2022,
  author       = {Chris Fallin},
  howpublished = {on 14/01/2025 (RFC)},
  month        = aug,
  title        = {Cranelift: Using E-Graphs for Verified, Cooperating Middle-End Optimizations},
  year         = {2022},
  url          = {https://github.com/bytecodealliance/rfcs/blob/main/accepted/cranelift-egraph.md},
}

@Article{Galler1964,
  author    = {Galler, Bernard A. and Fisher, Michael J.},
  journal   = {Communications of the ACM},
  title     = {An improved equivalence algorithm},
  year      = {1964},
  issn      = {1557-7317},
  month     = may,
  number    = {5},
  pages     = {301--303},
  volume    = {7},
  doi       = {10.1145/364099.364331},
  publisher = {Association for Computing Machinery (ACM)},
}

@Book{Cormen2009,
  author    = {Cormen, Thomas H and Leiserson, Charles E and Rivest, Ronald L and Stein, Clifford},
  editor    = {Charles Eric Leiserson and Ronald Linn Rivest and Clifford Stein},
  publisher = {MIT Press},
  title     = {Introduction to algorithms},
  year      = {2009},
  address   = {Cambridge, Massachusetts},
  edition   = {Third edition},
  isbn      = {978-0-262-03384-8},
  note      = {Description based upon print version of record. - IMD-Felder maschinell generiert},
  pagetotal = {11292},
  ppn_gvk   = {1655311530},
}

@Book{Biere2021,
  author    = {Armin Biere and Marijn J. H. Heule and Hans Maaren and Toby Walsh},
  editor    = {Armin Biere and Marijn J. H. Heule and Hans Maaren and Toby Walsh},
  publisher = {IOS Press},
  title     = {Handbook of satisfiability},
  year      = {2021},
  address   = {Amsterdam},
  edition   = {Second edition},
  isbn      = {9781643681610},
  number    = {volume 336},
  series    = {Frontiers in artificial intelligence and applications},
  pagetotal = {11465},
  ppn_gvk   = {1775115682},
  subtitle  = {Part 1/part 2},
}

@Article{Willsey2021a,
  author     = {Willsey, Max and Nandi, Chandrakana and Wang, Yisu Remy and Flatt, Oliver and Tatlock, Zachary and Panchekha, Pavel},
  journal    = {Proceedings of the ACM on Programming Languages},
  title      = {egg: Fast and extensible equality saturation},
  year       = {2021},
  issn       = {2475-1421},
  month      = jan,
  number     = {POPL},
  pages      = {1--29},
  volume     = {5},
  abstract   = {An e-graph efficiently represents a congruence relation over many expressions. Although they were originally developed in the late 1970s for use in automated theorem provers, a more recent technique known as equality saturation repurposes e-graphs to implement state-of-the-art, rewrite-driven compiler optimizations and program synthesizers. However, e-graphs remain unspecialized for this newer use case. Equality saturation workloads exhibit distinct characteristics and often require ad-hoc e-graph extensions to incorporate transformations beyond purely syntactic rewrites.  This work contributes two techniques that make e-graphs fast and extensible, specializing them to equality saturation. A new amortized invariant restoration technique called rebuilding takes advantage of equality saturation's distinct workload, providing asymptotic speedups over current techniques in practice. A general mechanism called e-class analyses integrates domain-specific analyses into the e-graph, reducing the need for ad hoc manipulation.  We implemented these techniques in a new open-source library called egg. Our case studies on three previously published applications of equality saturation highlight how egg's performance and flexibility enable state-of-the-art results across diverse domains.},
  address    = {New York, NY, USA},
  articleno  = {23},
  doi        = {10.1145/3434304},
  issue_date = {January 2021},
  keywords   = {e-graphs, equality saturation},
  numpages   = {29},
  publisher  = {Association for Computing Machinery},
}

@Article{Yang2021,
  author     = {Yichen Yang and Mangpo Phitchaya Phothilimtha and Yisu Remy Wang and Max Willsey and Sudip Roy and Jacques Pienaar},
  journal    = {CoRR},
  title      = {Equality Saturation for Tensor Graph Superoptimization},
  year       = {2021},
  volume     = {abs/2101.01332},
  bibsource  = {dblp computer science bibliography, https://dblp.org},
  biburl     = {https://dblp.org/rec/journals/corr/abs-2101-01332.bib},
  copyright  = {arXiv.org perpetual, non-exclusive license},
  doi        = {10.48550/ARXIV.2101.01332},
  eprint     = {2101.01332},
  eprinttype = {arXiv},
  file       = {:papers/Yang2021 - Equality Saturation for Tensor Graph Superoptimization.pdf:PDF},
  keywords   = {Artificial Intelligence (cs.AI),Distributed,Parallel,and Cluster Computing (cs.DC),FOS: Computer and information sciences},
  publisher  = {arXiv},
  timestamp  = {Tue, 26 Jan 2021 13:39:42 +0100},
}

@Article{Mondada2024,
  author    = {Luca Mondada and Pablo Andrés-Martínez},
  journal   = {Electronic Proceedings in Theoretical Computer Science},
  title     = {Scalable Pattern Matching in Computation Graphs},
  year      = {2025},
  issn      = {2075-2180},
  month     = mar,
  pages     = {71--95},
  volume    = {417},
  booktitle = {15th International Workshop on Graph Computation Models},
  doi       = {10.4204/eptcs.417.5},
  publisher = {Open Publishing Association},
}

@Article{Fernandez2018,
  author    = {Maribel Fernández and Hélène Kirchner and Bruno Pinaud},
  journal   = {Electronic Notes in Theoretical Computer Science},
  title     = {Labelled Port Graph – A Formal Structure for Models and Computations},
  year      = {2018},
  issn      = {1571-0661},
  month     = oct,
  note      = {The 12th Workshop on Logical and Semantic Frameworks, with Applications (LSFA 2017)},
  pages     = {3--21},
  volume    = {338},
  abstract  = {We present a general definition of labelled port graph that serves as a basis for the design of graph-based programming and modelling frameworks (syntax and semantics). We show that this structure provides the syntax for programs, which are composed of an initial graph, a set of rules and a strategy. Rules, represented as labelled port graphs, apply to states, also represented as labelled port graphs, and compute their successors according to the given strategy. The description of states, rules, and computations controlled by strategies, using labelled port graphs, is detailed and illustrated with examples from Porgy, a strategic port graph rewriting environment for the design of executable specifications of complex systems.},
  doi       = {10.1016/j.entcs.2018.10.002},
  keywords  = {labelled port graph, rewrite rule, strategy, rule-based modelling, Porgy},
  publisher = {Elsevier BV},
}

@InBook{Rudolf2000,
  author    = {Rudolf, Michael},
  pages     = {238--251},
  publisher = {Springer Berlin Heidelberg},
  title     = {Utilizing Constraint Satisfaction Techniques for Efficient Graph Pattern Matching},
  year      = {2000},
  isbn      = {9783540464648},
  booktitle = {Theory and Application of Graph Transformations},
  doi       = {10.1007/978-3-540-46464-8_17},
  file      = {:papers/csp-graph-matching.pdf:PDF},
  issn      = {1611-3349},
}

@InBook{Boutillier2017,
  author    = {Boutillier, Pierre and Ehrhard, Thomas and Krivine, Jean},
  pages     = {201--228},
  publisher = {Springer Berlin Heidelberg},
  title     = {Incremental Update for Graph Rewriting},
  year      = {2017},
  isbn      = {9783662544341},
  booktitle = {Programming Languages and Systems},
  doi       = {10.1007/978-3-662-54434-1_8},
  file      = {:papers/978-3-662-54434-1.pdf:PDF},
  issn      = {1611-3349},
}

@Book{Heckel2020,
  author    = {Heckel, Reiko and Taentzer, Gabriele},
  publisher = {Springer International Publishing},
  title     = {Graph Transformation for Software Engineers: With Applications to Model-Based Development and Domain-Specific Language Engineering},
  year      = {2020},
  isbn      = {9783030439163},
  doi       = {10.1007/978-3-030-43916-3},
  file      = {:papers/reiko-book.pdf:PDF},
}

@Misc{Valve2024,
  author       = {{Valve Corporation}},
  howpublished = {on 30/01/2025},
  month        = dec,
  title        = {Steam Hardware & Software Survey: December 2024},
  year         = {2024},
  url          = {https://store.steampowered.com/hwsurvey/processormfg/},
}

@PhdThesis{Waterman2016,
  author = {Waterman, Andrew Shell},
  school = {University of Berkeley},
  title  = {Design of the RISC-V Instruction Set Architecture},
  year   = {2016},
  file   = {:papers/qt7zj0b3m7.pdf:PDF},
}

@Article{Hennessy1982,
  author    = {Hennessy, John and Jouppi, Norman and Przybylski, Steven and Rowen, Christopher and Gross, Thomas and Baskett, Forest and Gill, John},
  journal   = {ACM SIGMICRO Newsletter},
  title     = {MIPS: A microprocessor architecture},
  year      = {1982},
  issn      = {1050-916X},
  month     = dec,
  number    = {4},
  pages     = {17--22},
  volume    = {13},
  doi       = {10.1145/1014194.800930},
  publisher = {Association for Computing Machinery (ACM)},
}

@Article{Heurtel2023,
  author    = {Heurtel, Nicolas and Fyrillas, Andreas and Gliniasty, Gr{\'{e}}goire de and Le Bihan, Rapha{\"{e}}l and Malherbe, S{\'{e}}bastien and Pailhas, Marceau and Bertasi, Eric and Bourdoncle, Boris and Emeriau, Pierre-Emmanuel and Mezher, Rawad and Music, Luka and Belabas, Nadia and Valiron, Benoît and Senellart, Pascale and Mansfield, Shane and Senellart, Jean},
  journal   = {{Quantum}},
  title     = {Perceval: {A} {S}oftware {P}latform for {D}iscrete {V}ariable {P}hotonic {Q}uantum {C}omputing},
  year      = {2023},
  issn      = {2521-327X},
  month     = feb,
  pages     = {931},
  volume    = {7},
  doi       = {10.22331/q-2023-02-21-931},
  publisher = {{Verein zur F{\"{o}}rderung des Open Access Publizierens in den Quantenwissenschaften}},
  url       = {https://doi.org/10.22331/q-2023-02-21-931},
}

@Misc{Cross2017,
  author        = {Andrew W. Cross and Lev S. Bishop and John A. Smolin and Jay M. Gambetta},
  title         = {Open Quantum Assembly Language},
  year          = {2017},
  archiveprefix = {arXiv},
  eprint        = {1707.03429},
  keywords      = {openqasm},
  primaryclass  = {quant-ph},
  url           = {https://arxiv.org/abs/1707.03429},
}

@PhdThesis{Azad2024,
  author = {Fariha Azad},
  school = {University College London.},
  title  = {Tensor networks for classical andquantum simulation of open and closedquantum systems},
  year   = {2024},
  month  = jan,
}

@PhdThesis{Flannigan2020,
  author = {Flannigan, Stuart},
  school = {University of Strathclyde},
  title  = {The application of quantum simulation to topological and open many-body systems},
  year   = {2020},
}

@Article{Maslov2023,
  author    = {Maslov, Dmitri and Yang, Willers},
  journal   = {npj Quantum Information},
  title     = {CNOT circuits need little help to implement arbitrary Hadamard-free Clifford transformations they generate},
  year      = {2023},
  issn      = {2056-6387},
  month     = sep,
  number    = {1},
  volume    = {9},
  doi       = {10.1038/s41534-023-00760-2},
  publisher = {Springer Science and Business Media LLC},
}

@Misc{Abramsky2008,
  author        = {Samson Abramsky and Bob Coecke},
  title         = {Categorical quantum mechanics},
  year          = {2008},
  archiveprefix = {arXiv},
  eprint        = {0808.1023},
  primaryclass  = {quant-ph},
  url           = {https://arxiv.org/abs/0808.1023},
}

@Article{Penrose1964,
  author    = {Penrose, Roger},
  journal   = {General Relativity and Gravitation},
  title     = {Conformal treatment of infinity},
  year      = {1964},
  issn      = {1572-9532},
  number    = {3},
  pages     = {901--922 (reprint)},
  volume    = {43},
  doi       = {10.1007/s10714-010-1110-5},
  publisher = {Springer Science and Business Media LLC},
}

@Article{Feynman1949,
  author    = {Feynman, R. P.},
  journal   = {Physical Review},
  title     = {Space-Time Approach to Quantum Electrodynamics},
  year      = {1949},
  issn      = {0031-899X},
  month     = sep,
  number    = {6},
  pages     = {769--789},
  volume    = {76},
  doi       = {10.1103/physrev.76.769},
  publisher = {American Physical Society (APS)},
}

@InBook{Ehrig1976,
  author    = {Ehrig, Hartmut and Kreowski, Hans-Jörg},
  pages     = {284--293},
  publisher = {Springer Berlin Heidelberg},
  title     = {Parallelism of manipulations in multidimensional information structures},
  year      = {1976},
  isbn      = {9783540381693},
  booktitle = {Mathematical Foundations of Computer Science 1976},
  doi       = {10.1007/3-540-07854-1_188},
  issn      = {1611-3349},
}

@Article{Lack2005,
  author    = {Stephen Lack and Pawel Sobocinski},
  journal   = {RAIRO - Theoretical Informatics and Applications},
  title     = {Adhesive and quasiadhesive categories},
  year      = {2005},
  issn      = {1290-385X},
  month     = jul,
  number    = {3},
  pages     = {511--545},
  volume    = {39},
  bibsource = {dblp computer science bibliography, https://dblp.org},
  biburl    = {https://dblp.org/rec/journals/ita/LackS05.bib},
  doi       = {10.1051/ITA:2005028},
  publisher = {EDP Sciences},
  timestamp = {Mon, 15 Jun 2020 16:59:25 +0200},
  url       = {https://doi.org/10.1051/ita:2005028},
}

@InBook{Bonchi2017,
  author    = {Bonchi, Filippo and Gadducci, Fabio and Kissinger, Aleks and Sobociński, Paweł and Zanasi, Fabio},
  pages     = {141--169},
  publisher = {Springer Berlin Heidelberg},
  title     = {Confluence of Graph Rewriting with Interfaces},
  year      = {2017},
  isbn      = {9783662544341},
  booktitle = {Programming Languages and Systems},
  doi       = {10.1007/978-3-662-54434-1_6},
  issn      = {1611-3349},
}

@InProceedings{Hefford2024,
  author     = {Hefford, James and Wilson, Matt},
  booktitle  = {Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science},
  title      = {A Profunctorial Semantics for Quantum Supermaps},
  year       = {2024},
  month      = jul,
  pages      = {1--15},
  publisher  = {ACM},
  series     = {LICS ’24},
  collection = {LICS ’24},
  doi        = {10.1145/3661814.3662123},
}

@InProceedings{pytorch,
  author    = {Adam Paszke and Sam Gross and Francisco Massa and A. Lerer and J. Bradbury and G. Chanan and T. Killeen and Z. Lin and N. Gimelshein and L. Antiga and A. Desmaison and A. K{\"o}pf and E. Yang and Z. DeVito and M. Raison and A. Tejani and S. Chilamkurthy and B. Steiner and L. Fang and J. Bai and S. Chintala},
  booktitle = {Neural Information Processing Systems},
  title     = {{PyTorch}: An Imperative Style, High-Performance Deep Learning Library},
  year      = {2019},
  doi       = {10.5555/3454287.3455008},
}

@Article{Bonchi2022,
  author    = {Filippo Bonchi and Fabio Gadducci and Aleks Kissinger and Pawel Sobocinski and Fabio Zanasi},
  journal   = {Journal of the ACM},
  title     = {String Diagram Rewrite Theory I: Rewriting with Frobenius Structure},
  year      = {2022},
  issn      = {1557-735X},
  month     = mar,
  number    = {2},
  pages     = {1 - 58},
  volume    = {69},
  doi       = {10.1145/3502719},
  publisher = {Association for Computing Machinery (ACM)},
}

@Article{Bonchi2022a,
  author    = {Filippo Bonchi and Fabio Gadducci and Aleks Kissinger and Pawel Sobocinski and Fabio Zanasi},
  journal   = {Mathematical Structures in Computer Science},
  title     = {String diagram rewrite theory II: Rewriting with symmetric monoidal structure},
  year      = {2022},
  issn      = {1469-8072},
  month     = apr,
  number    = {4},
  pages     = {511--541},
  volume    = {32},
  doi       = {10.1017/s0960129522000317},
  publisher = {Cambridge University Press (CUP)},
}

@Article{Forgy1982,
  author    = {Charles L. Forgy},
  journal   = {Artificial Intelligence},
  title     = {Rete: A fast algorithm for the many pattern/many object pattern match problem},
  year      = {1982},
  issn      = {0004-3702},
  month     = sep,
  number    = {1},
  pages     = {17--37},
  volume    = {19},
  doi       = {10.1016/0004-3702(82)90020-0},
  publisher = {Elsevier BV},
}

@InBook{Varro2013,
  author    = {Varró, Gergely and Deckwerth, Frederik},
  pages     = {125--140},
  publisher = {Springer Berlin Heidelberg},
  title     = {A Rete Network Construction Algorithm for Incremental Pattern Matching},
  year      = {2013},
  isbn      = {9783642388835},
  booktitle = {Theory and Practice of Model Transformations},
  doi       = {10.1007/978-3-642-38883-5_13},
  issn      = {1611-3349},
}

@Article{Sellis1988,
  author     = {Sellis, Timos K.},
  journal    = {ACM Transactions on Database Systems},
  title      = {Multiple-query optimization},
  year       = {1988},
  issn       = {1557-4644},
  month      = mar,
  number     = {1},
  pages      = {23–52},
  volume     = {13},
  address    = {New York, NY, USA},
  doi        = {10.1145/42201.42203},
  issue_date = {March 1988},
  numpages   = {30},
  publisher  = {Association for Computing Machinery},
}

@Article{Ren2016,
  author     = {Xuguang Ren and Junhu Wang},
  journal    = {Proceedings of the VLDB Endowment},
  title      = {Multi-Query Optimization for Subgraph Isomorphism Search},
  year       = {2016},
  issn       = {2150-8097},
  month      = nov,
  number     = {3},
  pages      = {121–132},
  volume     = {10},
  doi        = {10.14778/3021924.3021929},
  issue_date = {November 2016},
  keywords   = {multi-query optimization, subgraph isomorphism},
  numpages   = {12},
  publisher  = {Association for Computing Machinery (ACM)},
  url        = {https://www.semanticscholar.org/paper/0830a4caf30051a565b85b882b64b66645664c53},
  venue      = {Proceedings of the VLDB Endowment},
}

@Article{Messmer1999,
  author    = {Bruno T. Messmer and Horst Bunke},
  journal   = {Pattern Recognition},
  title     = {A decision tree approach to graph and subgraph isomorphism detection},
  year      = {1999},
  issn      = {0031-3203},
  month     = dec,
  number    = {12},
  pages     = {1979--1998},
  volume    = {32},
  doi       = {10.1016/S0031-3203(98)90142-X},
  publisher = {Elsevier BV},
}

@Article{Danos2004,
  author    = {Danos, Vincent and Laneve, Cosimo},
  journal   = {Theoretical Computer Science},
  title     = {Formal molecular biology},
  year      = {2004},
  issn      = {0304-3975},
  month     = sep,
  number    = {1},
  pages     = {69--110},
  volume    = {325},
  doi       = {10.1016/j.tcs.2004.03.065},
  publisher = {Elsevier BV},
}

@InBook{Danos2007,
  author    = {Danos, Vincent and Feret, Jérôme and Fontana, Walter and Krivine, Jean},
  pages     = {139--157},
  publisher = {Springer Berlin Heidelberg},
  title     = {Scalable Simulation of Cellular Signaling Networks},
  year      = {2007},
  isbn      = {9783540766377},
  booktitle = {Programming Languages and Systems},
  doi       = {10.1007/978-3-540-76637-7_10},
  issn      = {1611-3349},
}

@Article{Sneddon2010,
  author    = {Sneddon, Michael W and Faeder, James R and Emonet, Thierry},
  journal   = {Nature Methods},
  title     = {Efficient modeling, simulation and coarse-graining of biological complexity with NFsim},
  year      = {2010},
  issn      = {1548-7105},
  month     = dec,
  number    = {2},
  pages     = {177--183},
  volume    = {8},
  doi       = {10.1038/nmeth.1546},
  publisher = {Springer Science and Business Media LLC},
}

@Article{Bachman2011,
  author    = {Bachman, John A and Sorger, Peter},
  journal   = {Nature Methods},
  title     = {New approaches to modeling complex biochemistry},
  year      = {2011},
  issn      = {1548-7105},
  month     = jan,
  number    = {2},
  pages     = {130--131},
  volume    = {8},
  doi       = {10.1038/nmeth0211-130},
  publisher = {Springer Science and Business Media LLC},
}

@PhdThesis{Armstrong2014,
  author = {Dylan Armstrong},
  school = {University of Dublin, Trinity College},
  title  = {Memory Efficient Stream Reasoning onResource-Limited Devices},
  year   = {2014},
}

@Article{Ian2003,
  author  = {Ian, Wright and Marshall, James A. R.},
  journal = {International Journal of Intelligent Games and Simulation},
  title   = {The execution kernel of RC++: RETE*, a faster RETE with TREAT as a special case},
  year    = {2003},
  month   = {Feb},
  number  = {1},
  pages   = {36-48},
  volume  = {2},
}

@PhdThesis{Miranker1987,
  author   = {Miranker, D. P.},
  school   = {Columbia University},
  title    = {TREAT: a new and efficient match algorithm for AI production systems},
  year     = {1987},
  address  = {2960 Broadway New York, NYUnited States},
  note     = {UMI Order No. GAX87-10209},
  abstract = {Due to the dramatic increase in computing power and the concomitant decrease in computing cost that has occurred over the last decade, many researchers are attempting to design computing systems to solve complicated problems or execute tasks that have in the past been performed by human experts. The focus of Knowledge Engineering is the construction of such complex "expert system" programs. This thesis will describe the architecture and the software systems embodying the DADO machine, a parallel tree-structured computer designed to provide significant performance improvements over serial computers of comparable hardware complexity in the execution of large expert systems implemented in production system form.The central contribution of this thesis is a new match algorithm for executing production systems, TREAT, that will be presented and comparatively analyzed with the RETE match algorithm. TREAT, originally designed specifically for the DADO machine architecture can handle efficiently both temporally redundant and nontemporally redundant production system programs. Although the development of the algorithm was motivated by the inadequacies of the parallel versions of existing production system algorithms, it is shown that the TREAT algorithm performs better than the best known sequential algorithm, the RETE match, even on a sequential machine.},
}

@Article{Rakib2018,
  author    = {Rakib, Abdur and Uddin, Ijaz},
  journal   = {Mobile Networks and Applications},
  title     = {An Efficient Rule-Based Distributed Reasoning Framework for Resource-bounded Systems},
  year      = {2018},
  issn      = {1572-8153},
  month     = oct,
  number    = {1},
  pages     = {82--99},
  volume    = {24},
  doi       = {10.1007/s11036-018-1140-x},
  publisher = {Springer Science and Business Media LLC},
}

@InBook{Uddin2016,
  author    = {Uddin, Ijaz and Ul Haque, Hafiz Mahfooz and Rakib, Abdur and Segi Rahmat, Mohamad Rafi},
  pages     = {153--164},
  publisher = {Springer International Publishing},
  title     = {Resource-Bounded Context-Aware Applications: A Survey and Early Experiment},
  year      = {2016},
  isbn      = {9783319469096},
  booktitle = {Nature of Computation and Communication},
  doi       = {10.1007/978-3-319-46909-6_15},
  issn      = {1867-822X},
}

@Article{Yang2008,
  author    = {Yang, Jin and Monine, Michael I. and Faeder, James R. and Hlavacek, William S.},
  journal   = {Physical Review E},
  title     = {Kinetic Monte Carlo method for rule-based modeling of biochemical networks},
  year      = {2008},
  issn      = {1550-2376},
  month     = sep,
  number    = {3},
  pages     = {031910},
  volume    = {78},
  doi       = {10.1103/physreve.78.031910},
  publisher = {American Physical Society (APS)},
}

@InProceedings{Cook1971,
  author     = {Cook, Stephen A.},
  booktitle  = {Proceedings of the third annual ACM symposium on Theory of computing - STOC ’71},
  title      = {The complexity of theorem-proving procedures},
  year       = {1971},
  pages      = {151--158},
  publisher  = {ACM Press},
  series     = {STOC ’71},
  collection = {STOC ’71},
  doi        = {10.1145/800157.805047},
}

@Book{Stanley2015,
  author    = {Stanley, Richard P.},
  publisher = {Cambridge University Press},
  title     = {Catalan Numbers},
  year      = {2015},
  isbn      = {9781139871495},
  month     = mar,
  doi       = {10.1017/CBO9781139871495},
  place     = {Cambridge},
}

@Article{Aval2008,
  author    = {Aval, Jean-Christophe},
  journal   = {Discrete Mathematics},
  title     = {Multivariate Fuss–Catalan numbers},
  year      = {2008},
  issn      = {0012-365X},
  month     = oct,
  number    = {20},
  pages     = {4660–4669},
  volume    = {308},
  doi       = {10.1016/j.disc.2007.08.100},
  publisher = {Elsevier BV},
}

@Book{Knuth1999,
  author    = {Donald Knuth},
  publisher = {Addison-Wesley},
  title     = {The Art of Computer Programming: Sorting and Searching, Volume 3},
  year      = {1999},
  address   = {Reading MA},
}

@Article{Barenco_1995,
  author    = {Barenco, Adriano and Bennett, Charles H. and Cleve, Richard and DiVincenzo, David P. and Margolus, Norman and Shor, Peter and Sleator, Tycho and Smolin, John A. and Weinfurter, Harald},
  journal   = {Physical Review A},
  title     = {Elementary gates for quantum computation},
  year      = {1995},
  issn      = {1094-1622},
  month     = nov,
  number    = {5},
  pages     = {3457--3467},
  volume    = {52},
  doi       = {10.1103/PhysRevA.52.3457},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/cnot-one-qubit.pdf:PDF},
  issue     = {5},
  numpages  = {0},
  publisher = {American Physical Society},
}

@Article{Andrei2011,
  author    = {Andrei, Oana and Fernández, Maribel and Kirchner, Hélène and Melançon, Guy and Namet, Olivier and Pinaud, Bruno},
  journal   = {Electronic Proceedings in Theoretical Computer Science},
  title     = {PORGY: Strategy-Driven Interactive Transformation of Graphs},
  year      = {2011},
  issn      = {2075-2180},
  month     = feb,
  pages     = {54--68},
  volume    = {48},
  doi       = {10.4204/eptcs.48.7},
  publisher = {Open Publishing Association},
}

@Article{Fernandez2010,
  author    = {Fernández, Maribel and Namet, Olivier},
  journal   = {Electronic Proceedings in Theoretical Computer Science},
  title     = {Strategic programming on graph rewriting systems},
  year      = {2010},
  issn      = {2075-2180},
  month     = dec,
  pages     = {1--20},
  volume    = {44},
  doi       = {10.4204/eptcs.44.1},
  publisher = {Open Publishing Association},
}

@InProceedings{Echahed2017,
  author    = {Echahed, Rachid and Maignan, Aude},
  booktitle = {Proceedings of the 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR},
  title     = {Parallel Graph Rewriting with Overlapping Rules},
  year      = {2017},
  editor    = {Thomas Eiter and David Sands},
  pages     = {300--318},
  volume    = {46},
  doi       = {10.29007/576h},
  issn      = {2398-7340},
}

@InProceedings{Echahed2008,
  author    = {Echahed, Rachid},
  booktitle = {Graph Transformations, ICGT},
  title     = {Inductively Sequential Term-Graph Rewrite Systems},
  year      = {2008},
  editor    = {Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G.},
  pages     = {84--98},
  publisher = {Springer Berlin Heidelberg},
  doi       = {10.1007/978-3-540-87405-8_7},
  isbn      = {9783540874058},
  issn      = {1611-3349},
}

@Article{Assmann2000,
  author    = {Assmann, Uwe},
  journal   = {ACM Transactions on Programming Languages and Systems},
  title     = {Graph rewrite systems for program optimization},
  year      = {2000},
  issn      = {1558-4593},
  month     = jul,
  number    = {4},
  pages     = {583--637},
  volume    = {22},
  doi       = {10.1145/363911.363914},
  publisher = {Association for Computing Machinery (ACM)},
}

@InProceedings{Baldan1998,
  author    = {Baldan, Paolo and Corradini, Andrea and Montanari, Ugo},
  booktitle = {Automata, Languages and Programming, ICALP},
  title     = {Concatenable graph processes: Relating processes and derivation traces},
  year      = {1998},
  editor    = {Larsen, K.G., Skyum, S., Winskel, G.},
  pages     = {283--295},
  publisher = {Springer Berlin Heidelberg},
  volume    = {1443},
  doi       = {10.1007/bfb0055061},
  isbn      = {9783540686811},
  issn      = {1611-3349},
}

@InProceedings{Baldan1999,
  author    = {Baldan, Paolo and Corradini, Andrea and Montanari, Ugo and Rossi, Francesca and Ehrig, Hartmut and Löwe, Michael},
  booktitle = {Handbook of Graph Grammars and Computing by Graph Transformation},
  title     = {Concurrent Semantic of Algebraic Graph Transformations},
  year      = {1999},
  month     = aug,
  pages     = {107--187},
  publisher = {World Scientific},
  doi       = {10.1142/9789812814951_0003},
  isbn      = {9789812814951},
}

@Article{Corradini1996,
  author    = {Corradini, A. and Montanari, U. and Rossi, F.},
  journal   = {Fundamenta Informaticae},
  title     = {Graph Processes},
  year      = {1996},
  issn      = {0169-2968},
  number    = {3,4},
  pages     = {241--265},
  volume    = {26},
  doi       = {10.3233/fi-1996-263402},
  publisher = {SAGE Publications},
}

@InProceedings{Rensink2004,
  author    = {Rensink, Arend},
  booktitle = {Applications of Graph Transformations with Industrial Relevance},
  title     = {The GROOVE Simulator: A Tool for State Space Generation},
  year      = {2004},
  editor    = {Pfaltz, J.L., Nagl, M., Böhlen, B.},
  pages     = {479--485},
  publisher = {Springer Berlin Heidelberg},
  volume    = {3062},
  doi       = {10.1007/978-3-540-25959-6_40},
  isbn      = {9783540259596},
  issn      = {1611-3349},
}

@InProceedings{Geiss2006,
  author    = {Geiß, Rubino and Batz, Gernot Veit and Grund, Daniel and Hack, Sebastian and Szalkowski, Adam},
  booktitle = {Graph Transformations. ICGT 2006.},
  title     = {GrGen: A Fast SPO-Based Graph Rewriting Tool},
  year      = {2006},
  editor    = {Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G.},
  pages     = {383--397},
  publisher = {Springer Berlin Heidelberg},
  volume    = {4178},
  doi       = {10.1007/11841883_27},
  isbn      = {9783540388722},
  issn      = {1611-3349},
}

@InProceedings{Rensink2004a,
  author    = {Rensink, Arend and Schmidt, Ákos and Varró, Dániel},
  booktitle = {Graph Transformations. ICGT 2004},
  title     = {Model Checking Graph Transformations: A Comparison of Two Approaches},
  year      = {2004},
  editor    = {Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G.},
  pages     = {226--241},
  publisher = {Springer Berlin Heidelberg},
  doi       = {10.1007/978-3-540-30203-2_17},
  isbn      = {9783540302032},
  issn      = {1611-3349},
}

@InProceedings{Weber2022,
  author    = {Weber, Jens H.},
  booktitle = {Graph Transformation. ICGT 2022},
  title     = {Tool Support for Functional Graph Rewriting with Persistent Data Structures - GrapeVine},
  year      = {2022},
  editor    = {Behr, N., Strüber, D.},
  pages     = {195--206},
  publisher = {Springer International Publishing},
  doi       = {10.1007/978-3-031-09843-7_11},
  isbn      = {9783031098437},
  issn      = {1611-3349},
}

@Article{Driscoll1989,
  author    = {Driscoll, James R. and Sarnak, Neil and Sleator, Daniel D. and Tarjan, Robert E.},
  journal   = {Journal of Computer and System Sciences},
  title     = {Making data structures persistent},
  year      = {1989},
  issn      = {0022-0000},
  month     = feb,
  number    = {1},
  pages     = {86--124},
  volume    = {38},
  doi       = {10.1016/0022-0000(89)90034-2},
  publisher = {Elsevier BV},
}

@Book{Okasaki1996,
  author    = {Okasaki, Chris and Lee, Peter},
  publisher = {Carnegie Mellon University},
  title     = {Purely functional data structures},
  year      = {1996},
  address   = {USA},
  isbn      = {978-0-591-64723-5},
  abstract  = {When a C programmer needs an efficient data structure for a particular problem, he or she can often simply look one up in any of a number of good textbooks or handbooks. Unfortunately, programmers in functional languages such as Standard ML or Haskell do not have this luxury. Although some data structures designed for imperative languages such as C can be quite easily adapted to a functional setting, most cannot, usually because they depend in crucial ways on assignments, which are disallowed, or at least discouraged, in functional languages. To address this imbalance, we describe several techniques for designing functional data structures, and numerous original data structures based on these techniques, including multiple variations of lists, queues, double-ended queues, and heaps, many supporting more exotic features such as random access or efficient catenation. In addition, we expose the fundamental role of lazy evaluation in amortized functional data structures. Traditional methods of amortization break down when old versions of a data structure, not just the most recent, are available for further processing. This property is known as persistence, and is taken for granted in functional languages. On the surface, persistence and amortization appear to be incompatible, but we show how lazy evaluation can be used to resolve this conflict, yielding amortized data structures that are efficient even when used persistently. Turning this relationship between lazy evaluation and amortization around, the notion of amortization also provides the first practical techniques for analyzing the time requirements of non-trivial lazy programs.Finally, our data structures offer numerous hints to programming language designers, illustrating the utility of combining strict and lazy evaluation in a single language, and providing non-trivial examples using polymorphic recursion and higher-order, recursive modules.},
}

@InProceedings{Lagogiannis2005,
  author    = {Lagogiannis, George and Panagis, Yannis and Sioutas, Spyros and Tsakalidis, Athanasios},
  booktitle = {Proceedings of the 9th WSEAS International Conference on Computers},
  title     = {A survey of persistent data structures},
  year      = {2005},
  address   = {Stevens Point, Wisconsin, USA},
  publisher = {World Scientific and Engineering Academy and Society (WSEAS)},
  series    = {ICCOMP'05},
  abstract  = {Several years after the introduction of the notion of persistence by Driscoll et al. [15] we review, in this paper, the most important data structuring paradigms and applications both in main and secondary memory.},
  articleno = {8},
  isbn      = {9608457297},
  keywords  = {temporal databases, persistence, node splitting, node copying, fat node, data structures, applications},
  location  = {Athens, Greece},
  numpages  = {6},
}

@InProceedings{Okasaki1998,
  author    = {Chris Okasaki and Andy Gill},
  booktitle = {Workshop on ML},
  title     = {Fast Mergeable Integer Maps},
  year      = {1998},
  month     = sep,
  pages     = {77--86},
  url       = {https://api.semanticscholar.org/CorpusID:15349011},
}

@Article{Hinze2005,
  author    = {Hinze, Ralf and Paterson, Ross},
  journal   = {Journal of Functional Programming},
  title     = {Finger trees: a simple general-purpose data structure},
  year      = {2005},
  month     = nov,
  number    = {02},
  pages     = {197},
  volume    = {16},
  doi       = {10.1017/s0956796805005769},
  publisher = {Cambridge University Press (CUP)},
}

@InProceedings{Demaine2008,
  author    = {Demaine, Erik D. and Langerman, Stefan and Price, Eric},
  booktitle = {Algorithm Theory – SWAT 2008},
  title     = {Confluently Persistent Tries for Efficient Version Control},
  year      = {2008},
  editor    = {Joachim Gudmundsson},
  pages     = {160--172},
  publisher = {Springer Berlin Heidelberg},
  volume    = {5124},
  doi       = {10.1007/978-3-540-69903-3_16},
  isbn      = {9783540699033},
  issn      = {1611-3349},
}

@Article{Fiat2003,
  author    = {Fiat, Amos and Kaplan, Haim},
  journal   = {Journal of Algorithms},
  title     = {Making data structures confluently persistent},
  year      = {2003},
  issn      = {0196-6774},
  month     = aug,
  number    = {1},
  pages     = {16--58},
  volume    = {48},
  doi       = {10.1016/s0196-6774(03)00044-0},
  publisher = {Elsevier BV},
}

@Article{Driscoll1994,
  author    = {Driscoll, James R. and Sleator, Daniel D. K. and Tarjan, Robert E.},
  journal   = {Journal of the ACM},
  title     = {Fully persistent lists with catenation},
  year      = {1994},
  issn      = {1557-735X},
  month     = sep,
  number    = {5},
  pages     = {943--959},
  volume    = {41},
  doi       = {10.1145/185675.185791},
  publisher = {Association for Computing Machinery (ACM)},
}

@InProceedings{Chalermsook2018,
  author    = {Chalermsook, Parinya and Goswami, Mayank and Kozma, László and Mehlhorn, Kurt and Saranurak, Thatchaphol},
  booktitle = {International Symposium on Algorithms and Computation 2018},
  title     = {Multi-Finger Binary Search Trees},
  year      = {2018},
  publisher = {Schloss Dagstuhl – Leibniz-Zentrum für Informatik},
  copyright = {Creative Commons Attribution 3.0 Unported license},
  doi       = {10.4230/LIPICS.ISAAC.2018.55},
  keywords  = {binary search trees, dynamic optimality, finger search, k-server},
  language  = {en},
}

@InProceedings{Collette2012,
  author    = {Collette, Sébastien and Iacono, John and Langerman, Stefan},
  booktitle = {Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms},
  title     = {Confluent Persistence Revisited},
  year      = {2012},
  month     = jan,
  pages     = {593--601},
  publisher = {Society for Industrial and Applied Mathematics},
  doi       = {10.1137/1.9781611973099.50},
}

@InProceedings{Weber2017,
  author    = {Weber, Jens H.},
  booktitle = {Graph Transformation},
  title     = {GRAPE – A Graph Rewriting and Persistence Engine},
  year      = {2017},
  pages     = {209--220},
  publisher = {Springer International Publishing},
  doi       = {10.1007/978-3-319-61470-0_13},
  isbn      = {9783319614700},
  issn      = {1611-3349},
}

@InProceedings{Nieuwenhuis2006,
  author    = {Nieuwenhuis, Robert and Oliveras, Albert},
  booktitle = {Theory and Applications of Satisfiability Testing - SAT 2006},
  title     = {On SAT Modulo Theories and Optimization Problems},
  year      = {2006},
  pages     = {156--169},
  publisher = {Springer Berlin Heidelberg},
  doi       = {10.1007/11814948_18},
  isbn      = {9783540372073},
  issn      = {1611-3349},
}

@InBook{Barrett2018,
  author    = {Barrett, Clark and Tinelli, Cesare},
  editor    = {Edmund M. Clarke, Thomas A. Henzinger, Helmut Veith, Roderick Bloem},
  pages     = {305--343},
  publisher = {Springer International Publishing},
  title     = {Satisfiability Modulo Theories},
  year      = {2018},
  isbn      = {9783319105758},
  booktitle = {Handbook of Model Checking},
  doi       = {10.1007/978-3-319-10575-8_11},
}

@InProceedings{Moskewicz2001,
  author     = {Moskewicz, Matthew W. and Madigan, Conor F. and Zhao, Ying and Zhang, Lintao and Malik, Sharad},
  booktitle  = {Proceedings of the 38th conference on Design automation - DAC ’01},
  title      = {Chaff: engineering an efficient SAT solver},
  year       = {2001},
  pages      = {530--535},
  publisher  = {ACM Press},
  series     = {DAC ’01},
  collection = {DAC ’01},
  doi        = {10.1145/378239.379017},
}

@InProceedings{Moura2008,
  author    = {de Moura, Leonardo and Bjørner, Nikolaj},
  booktitle = {Tools and Algorithms for the Construction and Analysis of Systems},
  title     = {Z3: An Efficient SMT Solver},
  year      = {2008},
  pages     = {337--340},
  publisher = {Springer Berlin Heidelberg},
  doi       = {10.1007/978-3-540-78800-3_24},
  isbn      = {9783540788003},
  issn      = {1611-3349},
}

@InProceedings{Sebastiani2015,
  author    = {Sebastiani, Roberto and Trentin, Patrick},
  booktitle = {Computer Aided Verification},
  title     = {OptiMathSAT: A Tool for Optimization Modulo Theories},
  year      = {2015},
  pages     = {447--454},
  publisher = {Springer International Publishing},
  doi       = {10.1007/978-3-319-21690-4_27},
  isbn      = {9783319216904},
  issn      = {1611-3349},
}

@Misc{Wang2024,
  author        = {Hao Wang and Erjia Xiao and Songhuan He and Zhongyi Ni and Lingfeng Zhang and Xiaokun Zhan and Yifei Cui and Jinguo Liu and Cheng Wang and Zhongrui Wang and Renjing Xu},
  title         = {CIM-Based Parallel Fully FFNN Surface Code High-Level Decoder for Quantum Error Correction},
  year          = {2024},
  archiveprefix = {arXiv},
  eprint        = {2411.18090},
  primaryclass  = {cs.AR},
}

@Misc{Cao2023,
  author        = {Hanyan Cao and Feng Pan and Yijia Wang and Pan Zhang},
  title         = {qecGPT: decoding Quantum Error-correcting Codes with Generative Pre-trained Transformers},
  year          = {2023},
  archiveprefix = {arXiv},
  eprint        = {2307.09025},
  primaryclass  = {quant-ph},
  url           = {https://arxiv.org/abs/2307.09025},
}

@Article{Overwater2022,
  author    = {Overwater, Ramon W. J. and Babaie, Masoud and Sebastiano, Fabio},
  journal   = {IEEE Transactions on Quantum Engineering},
  title     = {Neural-Network Decoders for Quantum Error Correction Using Surface Codes: A Space Exploration of the Hardware Cost-Performance Tradeoffs},
  year      = {2022},
  issn      = {2689-1808},
  pages     = {1--19},
  volume    = {3},
  doi       = {10.1109/tqe.2022.3174017},
  publisher = {Institute of Electrical and Electronics Engineers (IEEE)},
}

@Article{Meinerz2022,
  author    = {Meinerz, Kai and Park, Chae-Yeun and Trebst, Simon},
  journal   = {Physical Review Letters},
  title     = {Scalable Neural Decoder for Topological Surface Codes},
  year      = {2022},
  issn      = {1079-7114},
  month     = feb,
  number    = {8},
  pages     = {080505},
  volume    = {128},
  doi       = {10.1103/physrevlett.128.080505},
  publisher = {American Physical Society (APS)},
}

@InProceedings{Ueno2021,
  author    = {Ueno, Yosuke and Kondo, Masaaki and Tanaka, Masamitsu and Suzuki, Yasunari and Tabuchi, Yutaka},
  booktitle = {2021 58th ACM/IEEE Design Automation Conference (DAC)},
  title     = {QECOOL: On-Line Quantum Error Correction with a Superconducting Decoder for Surface Code},
  year      = {2021},
  month     = dec,
  pages     = {451--456},
  publisher = {IEEE},
  doi       = {10.1109/dac18074.2021.9586326},
}

@Article{Feo1990,
  author    = {Feo, John T. and Cann, David C. and Oldehoeft, Rodney R.},
  journal   = {Journal of Parallel and Distributed Computing},
  title     = {A report on the sisal language project},
  year      = {1990},
  issn      = {0743-7315},
  month     = dec,
  number    = {4},
  pages     = {349--366},
  volume    = {10},
  doi       = {10.1016/0743-7315(90)90035-n},
  publisher = {Elsevier BV},
}

@PhdThesis{Kahn1976,
  author = {Kahn, Gilles and MacQueen, David},
  school = {IRIA},
  title  = {Coroutines and networks of parallel processes},
  year   = {1976},
}

@InProceedings{Bergstra2011,
  author       = {Bergstra, James and Bastien, Fr{\'e}d{\'e}ric and Breuleux, Olivier and Lamblin, Pascal and Pascanu, Razvan and Delalleau, Olivier and Desjardins, Guillaume and Warde-Farley, David and Goodfellow, Ian and Bergeron, Arnaud and others},
  booktitle    = {NIPS 2011, BigLearning Workshop, Granada, Spain},
  title        = {Theano: Deep learning on gpus with python},
  year         = {2011},
  number       = {0},
  organization = {Citeseer},
  volume       = {3},
}

@Article{Cytron1991,
  author    = {Cytron, Ron and Ferrante, Jeanne and Rosen, Barry K. and Wegman, Mark N. and Zadeck, F. Kenneth},
  journal   = {ACM Transactions on Programming Languages and Systems},
  title     = {Efficiently computing static single assignment form and the control dependence graph},
  year      = {1991},
  issn      = {1558-4593},
  month     = oct,
  number    = {4},
  pages     = {451--490},
  volume    = {13},
  doi       = {10.1145/115372.115320},
  publisher = {Association for Computing Machinery (ACM)},
}

@Article{Briggs1994,
  author    = {Briggs, Preston and Cooper, Keith D.},
  journal   = {ACM SIGPLAN Notices},
  title     = {Effective partial redundancy elimination},
  year      = {1994},
  issn      = {1558-1160},
  month     = jun,
  number    = {6},
  pages     = {159--170},
  volume    = {29},
  doi       = {10.1145/773473.178257},
  publisher = {Association for Computing Machinery (ACM)},
}

@InBook{Barendregt1987,
  author    = {Barendregt, H. P. and Eekelen, M. C. J. D. and Glauert, J. R. W. and Kennaway, J. R. and Plasmeijer, M. J. and Sleep, M. R.},
  editor    = {de Bakker, J. W. and Nijman, A. J. and Treleaven, P. C.},
  pages     = {141--158},
  publisher = {Springer Berlin Heidelberg},
  title     = {Term Graph Rewriting},
  year      = {1987},
  address   = {Berlin, Heidelberg},
  isbn      = {9783540471813},
  series    = {Lecture Notes in Computer Science},
  volume    = {259},
  booktitle = {Parallel Architectures and Languages Europe},
  doi       = {10.1007/3-540-17945-3_8},
  issn      = {1611-3349},
}

@InBook{Plump1999,
  author    = {Plump, Detlef},
  chapter   = {1},
  pages     = {3--61},
  publisher = {World Scientific},
  title     = {Term Graph Rewriting},
  year      = {1999},
  address   = {Singapore},
  isbn      = {9789812815149},
  month     = oct,
  booktitle = {Handbook of Graph Grammars and Computing by Graph Transformation},
  doi       = {10.1142/9789812815149_0001},
}

@InProceedings{Cocke1970,
  author    = {Cocke, John},
  booktitle = {Proceedings of a symposium on Compiler optimization -},
  title     = {Global common subexpression elimination},
  year      = {1970},
  pages     = {20--24},
  publisher = {ACM Press},
  doi       = {10.1145/800028.808480},
}

@Article{Zhao2023,
  author    = {Zhao, Yuxuan and Sun, Qi and He, Zhuolun and Bai, Yang and Yu, Bei},
  journal   = {Proceedings of the AAAI Conference on Artificial Intelligence},
  title     = {AutoGraph: Optimizing DNN Computation Graph for Parallel GPU Kernel Execution},
  year      = {2023},
  issn      = {2159-5399},
  month     = jun,
  number    = {9},
  pages     = {11354--11362},
  volume    = {37},
  doi       = {10.1609/aaai.v37i9.26343},
  publisher = {Association for the Advancement of Artificial Intelligence (AAAI)},
}

@Article{Wilson2022,
  author    = {Wilson, Paul and Zanasi, Fabio},
  journal   = {Electronic Proceedings in Theoretical Computer Science},
  title     = {The Cost of Compositionality: A High-Performance Implementation of String Diagram Composition},
  year      = {2022},
  issn      = {2075-2180},
  month     = nov,
  pages     = {262--275},
  volume    = {372},
  doi       = {10.4204/eptcs.372.19},
  publisher = {Open Publishing Association},
}

@InBook{Selinger2010,
  author    = {Selinger, P.},
  pages     = {289--355},
  publisher = {Springer Berlin Heidelberg},
  title     = {A Survey of Graphical Languages for Monoidal Categories},
  year      = {2010},
  isbn      = {9783642128219},
  booktitle = {New Structures for Physics},
  doi       = {10.1007/978-3-642-12821-9_4},
  issn      = {1616-6361},
}

@Article{Schroedinger1935,
  author  = {Erwin Schrödinger},
  journal = {Naturwissenschaftern},
  title   = {Die gegenwärtige Situation in der Quantenmechanik},
  year    = {1935},
  number  = {23},
}

@Misc{openqasm3,
  author       = {Hossein Ajallooiean, Thomas Alexander, Lev Bishop, Yudong Cao, Andrew Cross, Niel de Beaudrap, Jay Gambetta, Ali Javadi-Abhari, Blake Johnson, Moritz Kirste, Colm Ryan, John Smolin, Ntwali Bashige Toussaint},
  howpublished = {on 15/03/2025},
  title        = {OpenQASM 3.0 Specification},
  year         = {2023},
  url          = {https://openqasm.com/versions/3.0/intro.html},
}

@Book{Kissinger2024,
  author    = {Kissinger, Aleks and van de Wetering, John},
  publisher = {Preprint},
  title     = {Picturing Quantum Software: An Introduction to the ZX-Calculus and Quantum Compilation},
  year      = {2024},
}

@InProceedings{Deutsch1989,
  author    = {David Deutsch},
  booktitle = {Proceedings of the Royal Society of London. Series A, Mathematical and Physical Sciences},
  title     = {Quantum Computational Networks},
  year      = {1989},
  number    = {1868},
  pages     = {73--90},
  publisher = {Royal Society},
  volume    = {425},
}

@Article{Piroli2021,
  author    = {Piroli, Lorenzo and Styliaris, Georgios and Cirac, J. Ignacio},
  journal   = {Physical Review Letters},
  title     = {Quantum Circuits Assisted by Local Operations and Classical Communication: Transformations and Phases of Matter},
  year      = {2021},
  issn      = {1079-7114},
  month     = nov,
  number    = {22},
  pages     = {220503},
  volume    = {127},
  doi       = {10.1103/physrevlett.127.220503},
  publisher = {American Physical Society (APS)},
}

@Article{Smith2024,
  author    = {Smith, Kevin C. and Khan, Abid and Clark, Bryan K. and Girvin, S.M. and Wei, Tzu-Chieh},
  journal   = {PRX Quantum},
  title     = {Constant-Depth Preparation of Matrix Product States with Adaptive Quantum Circuits},
  year      = {2024},
  issn      = {2691-3399},
  month     = sep,
  number    = {3},
  pages     = {030344},
  volume    = {5},
  doi       = {10.1103/prxquantum.5.030344},
  publisher = {American Physical Society (APS)},
}

@Article{Bennett1993,
  author    = {Bennett, Charles H. and Brassard, Gilles and Crépeau, Claude and Jozsa, Richard and Peres, Asher and Wootters, William K.},
  journal   = {Physical Review Letters},
  title     = {Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels},
  year      = {1993},
  issn      = {0031-9007},
  month     = mar,
  number    = {13},
  pages     = {1895--1899},
  volume    = {70},
  doi       = {10.1103/physrevlett.70.1895},
  publisher = {American Physical Society (APS)},
}

@Article{Bravyi2005,
  author    = {Sergey Bravyi and Alexei Kitaev},
  journal   = {Physical Review A},
  title     = {Universal quantum computation with ideal Clifford gates and noisy ancillas},
  year      = {2005},
  issn      = {1094-1622},
  month     = feb,
  number    = {2},
  pages     = {022316},
  volume    = {71},
  doi       = {10.1103/PhysRevA.71.022316},
  file      = {:/Users/luca/Documents/research/bibtexs/papers/bravyi-kitaev-qec.pdf:PDF},
  keywords  = {magicstate},
  publisher = {American Physical Society (APS)},
}

@Article{Paetznick2014,
  author     = {Paetznick, Adam and Svore, Krysta M.},
  journal    = {Quantum Information & Computation},
  title      = {Repeat-until-success: non-deterministic decomposition of single-qubit unitaries},
  year       = {2014},
  issn       = {1533-7146},
  month      = nov,
  number     = {15–16},
  pages      = {1277–1301},
  volume     = {14},
  abstract   = {We present a decomposition technique that uses non-deterministic circuits to approximate an arbitrary single-qubit unitary to within distance ε and requires significantly fewer non-Clifford gates than existing techniques. We develop "Repeat-Until-Success" (RUS) circuits and characterize unitaries that can be exactly represented as an RUS circuit. Our RUS circuits operate by conditioning on a given measurement outcome and using only a small number of non-Clifford gates and ancilla qubits. We construct an algorithm based on RUS circuits that approximates an arbitrary single-qubit Z-axis rotation to within distance ε, where the number of T gates scales as 1:26 log2(1/ε) - 3:53, an improvement of roughly three-fold over state-of-the-art techniques. We then extend our algorithm and show that a scaling of 2:4 log2(1/ε) - 3:28 can be achieved for arbitrary unitaries and a small range of ε, which is roughly twice as good as optimal deterministic decomposition methods.},
  address    = {Paramus, NJ},
  issue_date = {November 2014},
  keywords   = {unitary decomposition, quantum circuits},
  numpages   = {25},
  publisher  = {Rinton Press, Incorporated},
}

@Article{Fowler2012,
  author    = {Fowler, Austin G. and Mariantoni, Matteo and Martinis, John M. and Cleland, Andrew N.},
  journal   = {Physical Review A},
  title     = {Surface codes: Towards practical large-scale quantum computation},
  year      = {2012},
  issn      = {1094-1622},
  month     = sep,
  number    = {3},
  pages     = {032324},
  volume    = {86},
  doi       = {10.1103/physreva.86.032324},
  publisher = {American Physical Society (APS)},
}

@InProceedings{Gilyen2019,
  author     = {Gilyén, András and Su, Yuan and Low, Guang Hao and Wiebe, Nathan},
  booktitle  = {Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing},
  title      = {Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics},
  year       = {2019},
  month      = jun,
  pages      = {193--204},
  publisher  = {ACM},
  series     = {STOC ’19},
  collection = {STOC ’19},
  doi        = {10.1145/3313276.3316366},
}

@Article{Chakraborty2024,
  author    = {Chakraborty, Shantanav},
  journal   = {Quantum},
  title     = {Implementing any Linear Combination of Unitaries on Intermediate-term Quantum Computers},
  year      = {2024},
  issn      = {2521-327X},
  month     = oct,
  pages     = {1496},
  volume    = {8},
  doi       = {10.22331/q-2024-10-10-1496},
  publisher = {Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften},
}

@Misc{Sze2025,
  author        = {Michelle Wynne Sze and Yao Tang and Silas Dilkes and David Muñoz Ramo and Ross Duncan and Nathan Fitzpatrick},
  title         = {Hamiltonian dynamics simulation using linear combination of unitaries on an ion trap quantum computer},
  year          = {2025},
  archiveprefix = {arXiv},
  eprint        = {2501.18515},
  primaryclass  = {quant-ph},
  url           = {https://arxiv.org/abs/2501.18515},
}

@Misc{Wetering2024a,
  author        = {John van de Wetering and Matt Amy},
  title         = {Optimising quantum circuits is generally hard},
  year          = {2024},
  archiveprefix = {arXiv},
  eprint        = {2310.05958},
  primaryclass  = {quant-ph},
  url           = {https://arxiv.org/abs/2310.05958},
}

@PhdThesis{Zulkoski2018,
  author = {Edward Zulkoski},
  school = {University of Waterloo},
  title  = {Understanding and Enhancing CDCL-based SAT Solvers},
  year   = {2018},
}

@Article{Amy2025,
  author    = {Amy, Matthew and Lunderville, Joseph},
  journal   = {Proceedings of the ACM on Programming Languages},
  title     = {Linear and Non-linear Relational Analyses for Quantum Program Optimization},
  year      = {2025},
  issn      = {2475-1421},
  month     = jan,
  number    = {POPL},
  pages     = {1072--1103},
  volume    = {9},
  doi       = {10.1145/3704873},
  publisher = {Association for Computing Machinery (ACM)},
}

@InProceedings{Dongarra1993,
  author     = {Dongarra, J., Hempel, R., Hey, A., & Walker, D},
  booktitle  = {Proceedings of the 1993 ACM/IEEE conference on Supercomputing},
  title      = {MPI: a message passing interface},
  year       = {1993},
  pages      = {878--883},
  publisher  = {ACM Press},
  series     = {Supercomputing ’93},
  collection = {Supercomputing ’93},
  doi        = {10.1145/169627.169855},
}

@Article{Simmons2021,
  author    = {Simmons, Will},
  journal   = {Electronic Proceedings in Theoretical Computer Science},
  title     = {Relating Measurement Patterns to Circuits via Pauli Flow},
  year      = {2021},
  issn      = {2075-2180},
  month     = sep,
  pages     = {50--101},
  volume    = {343},
  doi       = {10.4204/eptcs.343.4},
  publisher = {Open Publishing Association},
}

@Misc{Sutcliffe2025,
  author        = {Matthew Sutcliffe and Aleks Kissinger},
  title         = {Fast classical simulation of quantum circuits via parametric rewriting in the ZX-calculus},
  year          = {2025},
  archiveprefix = {arXiv},
  eprint        = {2403.06777},
  primaryclass  = {quant-ph},
  url           = {https://arxiv.org/abs/2403.06777},
}

@Article{Cowtan2024,
  author    = {Cowtan, Alexander and Burton, Simon},
  journal   = {Quantum},
  title     = {CSS code surgery as a universal construction},
  year      = {2024},
  issn      = {2521-327X},
  month     = may,
  pages     = {1344},
  volume    = {8},
  doi       = {10.22331/q-2024-05-14-1344},
  publisher = {Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften},
}

@Article{Beaudrap2020,
  author    = {de Beaudrap, Niel and Horsman, Dominic},
  journal   = {Quantum},
  title     = {The ZX calculus is a language for surface code lattice surgery},
  year      = {2020},
  issn      = {2521-327X},
  month     = jan,
  pages     = {218},
  volume    = {4},
  doi       = {10.22331/q-2020-01-09-218},
  publisher = {Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften},
}

@InProceedings{Kissinger2022,
  author    = {Kissinger, Aleks and van de Wetering, John and Vilmart, Renaud},
  title     = {Classical Simulation of Quantum Circuits with Partial and Graphical Stabiliser Decompositions},
  year      = {2022},
  publisher = {Schloss Dagstuhl – Leibniz-Zentrum für Informatik},
  copyright = {Creative Commons Attribution 4.0 International license},
  doi       = {10.4230/LIPICS.TQC.2022.5},
  keywords  = {ZX-calculus,Stabiliser Rank,Quantum Simulation,Theory of computation → Quantum computation theory,quizx},
  language  = {en},
}

@InProceedings{Jiang1998,
  author    = {Jiang, Xiaoyi and Bunke, Horst},
  booktitle = {Advances in Pattern Recognition},
  title     = {Marked subgraph isomorphism of ordered graphs},
  year      = {1998},
  address   = {Berlin, Heidelberg},
  editor    = {Amin, Adnan and Dori, Dov and Pudil, Pavel and Freeman, Herbert},
  pages     = {122--131},
  publisher = {Springer Berlin Heidelberg},
  doi       = {10.1007/bfb0033230},
  isbn      = {978-3-540-68526-5},
  issn      = {1611-3349},
}

@Misc{Barbulescu2024,
  author        = {George-Octavian Bărbulescu and Taiyi Wang and Zak Singh and Eiko Yoneki},
  title         = {Learned Graph Rewriting with Equality Saturation: A New Paradigm in Relational Query Rewrite and Beyond},
  year          = {2024},
  archiveprefix = {arXiv},
  eprint        = {2407.12794},
  primaryclass  = {cs.DB},
  url           = {https://arxiv.org/abs/2407.12794},
}

@InProceedings{Green2013,
  author     = {Green, Alexander S. and Lumsdaine, Peter LeFanu and Ross, Neil J. and Selinger, Peter and Valiron, Benoît},
  booktitle  = {Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation},
  title      = {Quipper: a scalable quantum programming language},
  year       = {2013},
  address    = {New York, NY, USA},
  month      = jun,
  pages      = {333--342},
  publisher  = {Association for Computing Machinery},
  series     = {PLDI ’13},
  collection = {PLDI ’13},
  doi        = {10.1145/2491956.2462177},
  isbn       = {9781450320146},
  keywords   = {quipper, quantum programming languages},
  location   = {Seattle, Washington, USA},
  numpages   = {10},
}

@Article{Rios2018,
  author    = {Rios, Francisco and Selinger, Peter},
  journal   = {Electronic Proceedings in Theoretical Computer Science},
  title     = {A Categorical Model for a Quantum Circuit Description Language (Extended Abstract)},
  year      = {2018},
  issn      = {2075-2180},
  month     = feb,
  pages     = {164--178},
  volume    = {266},
  doi       = {10.4204/eptcs.266.11},
  publisher = {Open Publishing Association},
}

@Article{Fu2023,
  author    = {Fu, Peng and Kishida, Kohei and Ross, Neil J. and Selinger, Peter},
  journal   = {Proceedings of the ACM on Programming Languages},
  title     = {Proto-Quipper with Dynamic Lifting},
  year      = {2023},
  issn      = {2475-1421},
  month     = jan,
  number    = {POPL},
  pages     = {309--334},
  volume    = {7},
  doi       = {10.1145/3571204},
  publisher = {Association for Computing Machinery (ACM)},
}

@InProceedings{Lack2004,
  author    = {Lack, Stephen and Sobociński, Paweł},
  booktitle = {Foundations of Software Science and Computation Structures},
  title     = {Adhesive Categories},
  year      = {2004},
  address   = {Berlin, Heidelberg},
  editor    = {Walukiewicz, Igor},
  pages     = {273--288},
  publisher = {Springer Berlin Heidelberg},
  doi       = {10.1007/978-3-540-24727-2_20},
  isbn      = {978-3-540-24727-2},
  issn      = {1611-3349},
}

@Article{Drewes2002,
  author    = {Drewes, Frank and Hoffmann, Berthold and Plump, Detlef},
  journal   = {Journal of Computer and System Sciences},
  title     = {Hierarchical Graph Transformation},
  year      = {2002},
  issn      = {0022-0000},
  month     = mar,
  number    = {2},
  pages     = {249--283},
  volume    = {64},
  doi       = {10.1006/jcss.2001.1790},
  keywords  = {hierarchical graphs, graph transformation},
  publisher = {Elsevier BV},
}

@InProceedings{Ehrig2004,
  author    = {Ehrig, Hartmut and Prange, Ulrike and Taentzer, Gabriele},
  booktitle = {Graph Transformations},
  title     = {Fundamental Theory for Typed Attributed Graph Transformation},
  year      = {2004},
  address   = {Berlin, Heidelberg},
  editor    = {Ehrig, Hartmut and Engels, Gregor and Parisi-Presicce, Francesco and Rozenberg, Grzegorz},
  pages     = {161--177},
  publisher = {Springer Berlin Heidelberg},
  doi       = {10.1007/978-3-540-30203-2_13},
  isbn      = {978-3-540-30203-2},
  issn      = {1611-3349},
}

@Article{Palacz2004,
  author    = {Palacz, Wojciech},
  journal   = {Journal of Computer and System Sciences},
  title     = {Algebraic hierarchical graph transformation},
  year      = {2004},
  issn      = {0022-0000},
  month     = may,
  number    = {3},
  pages     = {497--520},
  volume    = {68},
  doi       = {10.1016/s0022-0000(03)00064-3},
  keywords  = {Hierarchical graphs, Hierarchical hypergraphs, Double-pushout approach},
  publisher = {Elsevier BV},
  url       = {https://www.sciencedirect.com/science/article/pii/S0022000003000643},
}

@Article{BUSATTO2005,
  author    = {Busatto, Giorgio and Kreowski, Hans-Jörg and Kuske, Sabine},
  journal   = {Mathematical Structures in Computer Science},
  title     = {Abstract hierarchical graph transformation},
  year      = {2005},
  issn      = {1469-8072},
  month     = jul,
  number    = {4},
  pages     = {773--819},
  volume    = {15},
  doi       = {10.1017/s0960129505004846},
  publisher = {Cambridge University Press (CUP)},
}

@InProceedings{Padberg2017,
  author    = {Padberg, Julia},
  booktitle = {Graph Transformation},
  title     = {Hierarchical Graph Transformation Revisited: Transformations of Coalgebraic Graphs},
  year      = {2017},
  address   = {Cham},
  editor    = {de Lara, Juan and Plump, Detlef},
  pages     = {20--35},
  publisher = {Springer International Publishing},
  doi       = {10.1007/978-3-319-61470-0_2},
  isbn      = {978-3-319-61470-0},
  issn      = {1611-3349},
}

@Article{Kissinger2019,
  author    = {Kissinger, Aleks and Uijlen, Sander},
  journal   = {Logical Methods in Computer Science},
  title     = {A categorical semantics for causal structure},
  year      = {2019},
  issn      = {1860-5974},
  month     = aug,
  volume    = {Volume 15, Issue 3},
  doi       = {10.23638/lmcs-15(3:15)2019},
  publisher = {Centre pour la Communication Scientifique Directe (CCSD)},
}

@InProceedings{Corradini2006,
  author    = {Corradini, Andrea and Heindel, Tobias and Hermann, Frank and König, Barbara},
  booktitle = {Graph Transformations},
  title     = {Sesqui-Pushout Rewriting},
  year      = {2006},
  address   = {Berlin, Heidelberg},
  editor    = {Corradini, Andrea and Ehrig, Hartmut and Montanari, Ugo and Ribeiro, Leila and Rozenberg, Grzegorz},
  pages     = {30--45},
  publisher = {Springer Berlin Heidelberg},
  doi       = {10.1007/11841883_4},
  isbn      = {9783540388722},
  issn      = {1611-3349},
}

@Book{Borceux1994,
  author    = {Borceux, Francis},
  publisher = {Cambridge University Press},
  title     = {Handbook of Categorical Algebra},
  year      = {1994},
  isbn      = {9780511525858},
  month     = aug,
  doi       = {10.1017/cbo9780511525858},
}

@PhdThesis{Loewe1991,
  author = {Michael Löwe},
  school = {Technical University of Berlin},
  title  = {Extended algebraic graph transformation},
  year   = {1991},
  url    = {http://d-nb.info/910935696},
}

@InBook{Danos2014,
  author    = {Danos, Vincent and Heckel, Reiko and Sobocinski, Pawel},
  pages     = {146--160},
  publisher = {Springer International Publishing},
  title     = {Transformation and Refinement of Rigid Structures},
  year      = {2014},
  isbn      = {9783319091082},
  booktitle = {Graph Transformation},
  doi       = {10.1007/978-3-319-09108-2_10},
  issn      = {1611-3349},
}

@InProceedings{Baldan1999a,
  author    = {Baldan, Paolo and Corradini, Andrea and Montanari, Ugo},
  booktitle = {Foundations of Software Science and Computation Structures},
  title     = {Unfolding and Event Structure Semantics for Graph Grammars},
  year      = {1999},
  address   = {Berlin, Heidelberg},
  editor    = {Thomas, Wolfgang},
  pages     = {73--89},
  publisher = {Springer Berlin Heidelberg},
  doi       = {10.1007/3-540-49019-1_6},
  isbn      = {978-3-540-49019-7},
  issn      = {0302-9743},
}

@InBook{Winskel1987,
  author    = {Winskel, Glynn},
  pages     = {325--392},
  publisher = {Springer Berlin Heidelberg},
  title     = {Event structures},
  year      = {1987},
  isbn      = {9783540479260},
  booktitle = {Petri Nets: Applications and Relationships to Other Models of Concurrency},
  doi       = {10.1007/3-540-17906-2_31},
  issn      = {1611-3349},
}

@Article{Behr2019,
  author    = {Behr, Nicolas},
  journal   = {Electronic Proceedings in Theoretical Computer Science},
  title     = {Sesqui-Pushout Rewriting: Concurrency, Associativity and Rule Algebra Framework},
  year      = {2019},
  issn      = {2075-2180},
  month     = dec,
  pages     = {23--52},
  volume    = {309},
  doi       = {10.4204/eptcs.309.2},
  publisher = {Open Publishing Association},
}

@Article{Baldan2014,
  author    = {Baldan, Paolo and Corradini, Andrea and Heindel, Tobias and König, Barbara and Sobociński, Paweł},
  journal   = {Mathematical Structures in Computer Science},
  title     = {Processes and unfoldings: concurrent computations in adhesive categories},
  year      = {2014},
  issn      = {1469-8072},
  month     = jun,
  number    = {4},
  volume    = {24},
  doi       = {10.1017/s096012951200031x},
  publisher = {Cambridge University Press (CUP)},
}

@Article{Baldan2007,
  author    = {Baldan, Paolo and Corradini, Andrea and Montanari, Ugo and Ribeiro, Leila},
  journal   = {Information and Computation},
  title     = {Unfolding semantics of graph transformation},
  year      = {2007},
  issn      = {0890-5401},
  month     = may,
  number    = {5},
  pages     = {733--782},
  volume    = {205},
  doi       = {10.1016/j.ic.2006.11.004},
  publisher = {Elsevier BV},
}

@InBook{Baldan2008,
  author    = {Baldan, Paolo and Corradini, Andrea and König, Barbara},
  editor    = {Degano, Pierpaolo and De Nicola, Rocco and Meseguer, Jos{\'e}},
  pages     = {16--36},
  publisher = {Springer Berlin Heidelberg},
  title     = {Unfolding Graph Transformation Systems: Theory and Applications to Verification},
  year      = {2008},
  address   = {Berlin, Heidelberg},
  isbn      = {978-3-540-68679-8},
  booktitle = {Concurrency, Graphs and Models},
  doi       = {10.1007/978-3-540-68679-8_3},
  issn      = {1611-3349},
}

@Article{Costa2012,
  author    = {da Costa, Simone André and Ribeiro, Leila},
  journal   = {Science of Computer Programming},
  title     = {Verification of graph grammars using a logical approach},
  year      = {2012},
  issn      = {0167-6423},
  month     = apr,
  note      = {Brazilian Symposium on Formal Methods (SBMF 2008)},
  number    = {4},
  pages     = {480--504},
  volume    = {77},
  doi       = {10.1016/j.scico.2010.02.006},
  keywords  = {(Attributed) graph grammars, Relational structures, Theorem proving},
  publisher = {Elsevier BV},
}

@InBook{Baldan2008a,
  author    = {Baldan, Paolo and Chatain, Thomas and Haar, Stefan and König, Barbara},
  pages     = {203--217},
  publisher = {Springer Berlin Heidelberg},
  title     = {Unfolding-Based Diagnosis of Systems with an Evolving Topology},
  year      = {2008},
  isbn      = {9783540853619},
  booktitle = {CONCUR 2008 - Concurrency Theory},
  doi       = {10.1007/978-3-540-85361-9_19},
  issn      = {1611-3349},
}

@PhdThesis{Bisztray2009,
  author = {Bisztray, Dénes András},
  school = {University of Leicester},
  title  = {Compositional verification of model-level refactorings based on graph transformations},
  year   = {2009},
  month  = may,
  url    = {https://figshare.le.ac.uk/articles/thesis/Compositional_verification_of_model-level_refactorings_based_on_graph_transformations/10091939?file=18193655},
}

@Article{Baldan2008b,
  author    = {Baldan, Paolo and Corradini, Andrea and König, Barbara},
  journal   = {Information and Computation},
  title     = {A framework for the verification of infinite-state graph transformation systems},
  year      = {2008},
  issn      = {0890-5401},
  month     = jul,
  number    = {7},
  pages     = {869--907},
  volume    = {206},
  doi       = {10.1016/j.ic.2008.04.002},
  publisher = {Elsevier BV},
}

@InProceedings{Baldan2004,
  author    = {Baldan, Paolo and Corradini, Andrea and König, Barbara},
  booktitle = {CONCUR 2004 - Concurrency Theory},
  title     = {Verifying Finite-State Graph Grammars: An Unfolding-Based Approach},
  year      = {2004},
  address   = {Berlin, Heidelberg},
  editor    = {Gardner, Philippa and Yoshida, Nobuko},
  pages     = {83--98},
  publisher = {Springer Berlin Heidelberg},
  doi       = {10.1007/978-3-540-28644-8_6},
  isbn      = {978-3-540-28644-8},
  issn      = {1611-3349},
}

@InBook{Baldan2008c,
  author    = {Baldan, Paolo and Corradini, Andrea and König, Barbara and Schwoon, Stefan},
  pages     = {199–220},
  publisher = {Springer Berlin Heidelberg},
  title     = {McMillan's Complete Prefix for Contextual Nets},
  year      = {2008},
  address   = {Berlin, Heidelberg},
  isbn      = {9783540892861},
  booktitle = {Transactions on Petri Nets and Other Models of Concurrency I},
  doi       = {10.1007/978-3-540-89287-8_12},
  issn      = {1611-3349},
  numpages  = {22},
}

@InProceedings{Baldan2010,
  author    = {Baldan, Paolo and Bruni, Alessandro and Corradini, Andrea and König, Barbara and Schwoon, Stefan},
  booktitle = {Graph Transformations},
  title     = {On the Computation of McMillan's Prefix for Contextual Nets and Graph Grammars},
  year      = {2010},
  address   = {Berlin, Heidelberg},
  editor    = {Ehrig, Hartmut and Rensink, Arend and Rozenberg, Grzegorz and Sch{\"u}rr, Andy},
  pages     = {91--106},
  publisher = {Springer Berlin Heidelberg},
  doi       = {10.1007/978-3-642-15928-2_7},
  isbn      = {978-3-642-15928-2},
  issn      = {1611-3349},
}

@PhdThesis{Schwoon2013,
  author = {Schwoon, Stefan},
  school = {{\'E}cole normale sup{\'e}rieure de Cachan-ENS Cachan},
  title  = {Efficient verification of sequential and concurrent systems},
  year   = {2013},
}

@InProceedings{Corradini2018,
  author    = {Corradini, Andrea and Duval, Dominique and Löwe, Michael and Ribeiro, Leila and Machado, Rodrigo and Costa, Andrei and Azzi, Guilherme Grochau and Bezerra, Jonas Santos and Rodrigues, Leonardo Marques},
  booktitle = {Graph Transformation, Specifications, and Nets},
  title     = {On the Essence of Parallel Independence for the Double-Pushout and Sesqui-Pushout Approaches},
  year      = {2018},
  address   = {Cham},
  editor    = {Heckel, Reiko and Taentzer, Gabriele},
  pages     = {1--18},
  publisher = {Springer International Publishing},
  doi       = {10.1007/978-3-319-75396-6_1},
  isbn      = {978-3-319-75396-6},
  issn      = {1611-3349},
}

@Article{Hart1968,
  author    = {Hart, Peter and Nilsson, Nils and Raphael, Bertram},
  journal   = {IEEE Transactions on Systems Science and Cybernetics},
  title     = {A Formal Basis for the Heuristic Determination of Minimum Cost Paths},
  year      = {1968},
  issn      = {0536-1567},
  number    = {2},
  pages     = {100--107},
  volume    = {4},
  doi       = {10.1109/tssc.1968.300136},
  publisher = {Institute of Electrical and Electronics Engineers (IEEE)},
}
