var bibbase_data = {"data":"<img src=\"//bibbase.org/img/ajax-loader.gif\" id=\"spinner\"\n  style=\"display: none;\" alt=\"Loading..\" />\n\n<div id=\"bibbase\">\n\n  <script type=\"text/javascript\">\n    var bibbase = {\n      params: {\"bib\":\"https://raw.githubusercontent.com/Aerylia/aerylia.github.io/master/publications.bib\",\"jsonp\":\"1\",\"host\":\"bibbase.org\",\"ssl\":false},\n      data: [{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"\\\\textbfArianne\"],\"propositions\":[],\"lastnames\":[\"\\\\textbfMeijer-van de Griend\"],\"suffixes\":[]}],\"booktitle\":\"2024 IEEE International Conference on Software Analysis, Evolution and Reengineering - Companion (SANER-C)\",\"title\":\"The Quantum Circuit Model is not a Practical Representation of Quantum Software\",\"year\":\"2024\",\"volume\":\"\",\"number\":\"\",\"pages\":\"146-148\",\"keywords\":\"Codes;Computational modeling;Debugging;Programming;Software;Hardware;Mathematical models;quantum computing;quantum circuit model;quantum software, published\",\"doi\":\"10.1109/SANER-C62648.2024.00025\",\"bibtex\":\"@INPROCEEDINGS{10621734,\\n  author={\\\\textbf{Arianne} \\\\textbf{Meijer-van de Griend}},\\n  booktitle={2024 IEEE International Conference on Software Analysis, Evolution and Reengineering - Companion (SANER-C)}, \\n  title={The Quantum Circuit Model is not a Practical Representation of Quantum Software}, \\n  year={2024},\\n  volume={},\\n  number={},\\n  pages={146-148},\\n  keywords={Codes;Computational modeling;Debugging;Programming;Software;Hardware;Mathematical models;quantum computing;quantum circuit model;quantum software, published},\\n  doi={10.1109/SANER-C62648.2024.00025}}\\n\\n\",\"author_short\":[\"\\\\textbfMeijer-van de Griend, \\\\.\"],\"key\":\"10621734\",\"id\":\"10621734\",\"bibbaseid\":\"textbfmeijervandegriend-thequantumcircuitmodelisnotapracticalrepresentationofquantumsoftware-2024\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Codes;Computational modeling;Debugging;Programming;Software;Hardware;Mathematical models;quantum computing;quantum circuit model;quantum software\",\"published\"],\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"online\",\"type\":\"online\",\"author\":[{\"firstnames\":[\"\\\\textbfArianne\"],\"propositions\":[],\"lastnames\":[\"\\\\textbfMeijer-van de Griend\"],\"suffixes\":[]}],\"title\":\"Constrained quantum CNOT circuit re-synthesis using deep reinforcement learning\",\"year\":\"2019\",\"eprint\":\"RG.2.2.11886.77125\",\"eprinttype\":\"ResearchGate\",\"note\":\"Master thesis Artificial Intelligence\",\"url_paper\":\"https://www.researchgate.net/publication/335977643_Constrained_quantum_CNOT_circuit_re-synthesis_using_deep_reinforcement_learning\",\"abstract\":\"In this master thesis, we describe a novel approach to constrained CNOT circuit resynthesis as a first step towards neural constrained quantum circuit re-synthesis. We train a neural network to do constrained Gaussian elimination from a parity matrix using deep reinforcement learning. The CNOT circuit is transformed into a parity matrix from which an equivalent CNOT circuit is synthesized such that all CNOT gates adhere to the connectivity constraints provided by the quantum computer architecture. For our n-step deep Q learning approach, we have used an asynchronous dueling neural network with three different action selection policies: ϵ-greedy, softmax and a novel oracle selection policy. To train this neural network, we have proposed a novel phased training procedure that guides the training process from trivial problems to arbitrary ones while simulating. Although we were only able to successfully train an agent for trivial quantum computer connectivity constraints, the 2 and 3 qubit coupling graphs. We did show that those agents were able to perform similar to the genetic Steiner baseline and could even improve on them. We also investigated the effect of coupling graph sizes and connectivity on network performance and training time. Lastly, we show that transfer learning can result in an improved network, but it takes longer to train. This is a very promising start of a new research field that could result in a universal quantum circuit optimization and mapping algorithm that is robust to both expected and unexpected future changes in quantum computer architectures.\",\"keywords\":\"unpublished\",\"bibtex\":\"@online{AIThesis,\\nAuthor = {\\\\textbf{Arianne} \\\\textbf{Meijer-van de Griend}},\\nTitle = {Constrained quantum CNOT circuit re-synthesis using deep reinforcement learning},\\nYear = {2019},\\nEprint = {RG.2.2.11886.77125},\\nEprinttype = {ResearchGate},\\nnote = {Master thesis Artificial Intelligence},\\nurl_Paper = {https://www.researchgate.net/publication/335977643_Constrained_quantum_CNOT_circuit_re-synthesis_using_deep_reinforcement_learning},\\nabstract = {In this master thesis, we describe a novel approach to constrained CNOT circuit resynthesis as a first step towards neural constrained quantum circuit re-synthesis. We train a neural network to do constrained Gaussian elimination from a parity matrix using deep reinforcement learning. The CNOT circuit is transformed into a parity matrix from which an equivalent CNOT circuit is synthesized such that all CNOT gates adhere to the connectivity constraints provided by the quantum computer architecture. For our n-step deep Q learning approach, we have used an asynchronous dueling neural network with three different action selection policies: ϵ-greedy, softmax and a novel oracle selection policy. To train this neural network, we have proposed a novel phased training procedure that guides the training process from trivial problems to arbitrary ones while simulating. Although we were only able to successfully train an agent for trivial quantum computer connectivity constraints, the 2 and 3 qubit coupling graphs. We did show that those agents were able to perform similar to the genetic Steiner baseline and could even improve on them. We also investigated the effect of coupling graph sizes and connectivity on network performance and training time. Lastly, we show that transfer learning can result in an improved network, but it takes longer to train. This is a very promising start of a new research field that could result in a universal quantum circuit optimization and mapping algorithm that is robust to both expected and unexpected future changes in quantum computer architectures.},\\nkeywords = {unpublished}\\n}\\n\\n\",\"author_short\":[\"\\\\textbfMeijer-van de Griend, \\\\.\"],\"key\":\"AIThesis\",\"id\":\"AIThesis\",\"bibbaseid\":\"textbfmeijervandegriend-constrainedquantumcnotcircuitresynthesisusingdeepreinforcementlearning-2019\",\"role\":\"author\",\"urls\":{\" paper\":\"https://www.researchgate.net/publication/335977643_Constrained_quantum_CNOT_circuit_re-synthesis_using_deep_reinforcement_learning\"},\"keyword\":[\"unpublished\"],\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Kissinger\"],\"firstnames\":[\"Aleks\"],\"suffixes\":[]},{\"firstnames\":[\"\\\\textbfArianne\"],\"propositions\":[],\"lastnames\":[\"\\\\textbfMeijer-van de Griend\"],\"suffixes\":[]}],\"title\":\"CNOT circuit extraction for topologically-constrained quantum memories\",\"journal\":\"Quantum Information and Computation\",\"volume\":\"20\",\"number\":\"7&8\",\"pages\":\"581–596\",\"year\":\"2020\",\"doi\":\"10.26421/QIC20.7-8-4\",\"note\":\"Also presented at QPL 2019, Chapman University (Orange, USA)\",\"url_paper\":\"http://www.rintonpress.com/xxqic20/qic-20-78/0581-0596.pdf\",\"abstract\":\"Many physical implementations of quantum computers impose stringent memory constraints in which 2-qubit operations can only be performed between qubits which are nearest neighbours in a lattice or graph structure. Hence, before a computation can be run on such a device, it must be mapped onto the physical architecture. That is, logical qubits must be assigned physical locations in the quantum memory, and the circuit must be replaced by an equivalent one containing only operations between nearest neighbours. In this paper, we give a new technique for quantum circuit mapping (a.k.a. routing), based on Gaussian elimination constrained to certain optimal spanning trees called Steiner trees. We give a reference implementation of the technique for CNOT circuits and show that it significantly outperforms general-purpose routines on CNOT circuits. We then comment on how the technique can be extended straightforwardly to the synthesis of CNOT+Rz circuits and as a modification to a recently-proposed circuit simplification/extraction procedure for generic circuits based on the ZX-calculus. \",\"keywords\":\"published\",\"bibtex\":\"@article{1904.00633,\\nAuthor = {Kissinger, Aleks and \\\\textbf{Arianne} \\\\textbf{Meijer-van de Griend}},\\nTitle = {CNOT circuit extraction for topologically-constrained quantum memories},\\njournal={Quantum Information and Computation},\\nvolume={20},\\nnumber={7\\\\&8},\\npages={581--596},\\nyear={2020},\\ndoi={10.26421/QIC20.7-8-4},\\nnote = {Also presented at QPL 2019, Chapman University (Orange, USA)},\\nurl_Paper = {http://www.rintonpress.com/xxqic20/qic-20-78/0581-0596.pdf},\\nabstract = {Many physical implementations of quantum computers impose stringent\\nmemory constraints in which 2-qubit operations can only be performed between\\nqubits which are nearest neighbours in a lattice or graph structure. Hence, before\\na computation can be run on such a device, it must be mapped onto the physical\\narchitecture. That is, logical qubits must be assigned physical locations in the\\nquantum memory, and the circuit must be replaced by an equivalent one containing\\nonly operations between nearest neighbours. In this paper, we give a new technique\\nfor quantum circuit mapping (a.k.a. routing), based on Gaussian elimination\\nconstrained to certain optimal spanning trees called Steiner trees. We give a reference\\nimplementation of the technique for CNOT circuits and show that it significantly outperforms general-purpose routines on CNOT circuits. We then comment on how the\\ntechnique can be extended straightforwardly to the synthesis of CNOT+Rz circuits and\\nas a modification to a recently-proposed circuit simplification/extraction procedure for\\ngeneric circuits based on the ZX-calculus.\\n},\\nkeywords = {published}\\n}\\n\\n\",\"author_short\":[\"Kissinger, A.\",\"\\\\textbfMeijer-van de Griend, \\\\.\"],\"key\":\"1904.00633\",\"id\":\"1904.00633\",\"bibbaseid\":\"kissinger-textbfmeijervandegriend-cnotcircuitextractionfortopologicallyconstrainedquantummemories-2020\",\"role\":\"author\",\"urls\":{\" paper\":\"http://www.rintonpress.com/xxqic20/qic-20-78/0581-0596.pdf\"},\"keyword\":[\"published\"],\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"online\",\"type\":\"online\",\"author\":[{\"firstnames\":[\"\\\\textbfArianne\"],\"propositions\":[],\"lastnames\":[\"\\\\textbfvan de Griend\"],\"suffixes\":[]}],\"title\":\"Natural language generation for commercial applications\",\"year\":\"2018\",\"eprint\":\"RG.2.2.21953.10087\",\"eprinttype\":\"ResearchGate\",\"note\":\"Master thesis Computing Science\",\"url_paper\":\"https://www.researchgate.net/publication/335977746_Natural_language_generation_for_commercial_applications\",\"abstract\":\"This master thesis gives an overview on natural language generation with the focus of dialogue systems for commercial use. We give a description of the general approach to natural language generation and their neural architectures first. Then three application domains are discussed in more detail: language style transfer, dialogue response generation and controlling dialogue response generation. For each domain, a use case was implemented and the results are discussed. We investigated automatic customer support, an empathetic automatic customer support and sentiment adjustment of reviews. We show promising results for the first two use cases, but the last use case was inconclusive due to difficulties with implementation. We finish with a short discussion of the use of natural language generation in commercial applications and what can be improved in our current model architectures.\",\"keywords\":\"unpublished\",\"bibtex\":\"@online{CSThesis,\\nAuthor = {\\\\textbf{Arianne} \\\\textbf{van de Griend}},\\nTitle = {Natural language generation for commercial applications},\\nYear = {2018},\\nEprint = {RG.2.2.21953.10087},\\nEprinttype = {ResearchGate},\\nnote = {Master thesis Computing Science},\\nurl_Paper = {https://www.researchgate.net/publication/335977746_Natural_language_generation_for_commercial_applications},\\nabstract = {This master thesis gives an overview on natural language generation with the focus of dialogue systems for commercial use. \\nWe give a description of the general approach to natural language generation and their neural architectures first.\\nThen three application domains are discussed in more detail: language style transfer, dialogue response generation and controlling dialogue response generation. \\nFor each domain, a use case was implemented and the results are discussed. We investigated automatic customer support, an empathetic automatic customer support and sentiment adjustment of reviews.\\nWe show promising results for the first two use cases, but the last use case was inconclusive due to difficulties with implementation. \\nWe finish with a short discussion of the use of natural language generation in commercial applications and what can be improved in our current model architectures.},\\nkeywords = {unpublished}\\n}\\n\\n\",\"author_short\":[\"\\\\textbfvan de Griend, \\\\.\"],\"key\":\"CSThesis\",\"id\":\"CSThesis\",\"bibbaseid\":\"textbfvandegriend-naturallanguagegenerationforcommercialapplications-2018\",\"role\":\"author\",\"urls\":{\" paper\":\"https://www.researchgate.net/publication/335977746_Natural_language_generation_for_commercial_applications\"},\"keyword\":[\"unpublished\"],\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Architecture-Aware Synthesis of Phase Polynomials for NISQ Devices\",\"volume\":\"394\",\"doi\":\"10.4204/eptcs.394.8\",\"journal\":\"Electronic Proceedings in Theoretical Computer Science\",\"publisher\":\"Open Publishing Association\",\"author\":[{\"firstnames\":[\"\\\\textbfArianne\"],\"propositions\":[],\"lastnames\":[\"\\\\textbfMeijer-van de Griend\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Duncan\"],\"firstnames\":[\"Ross\"],\"suffixes\":[]}],\"year\":\"2023\",\"month\":\"November\",\"pages\":\"116-140\",\"note\":\"In Proceedings QPL 2022, arXiv:2311.08375. This paper was originally accepted as Submission 38 in QPL2020, but was not included in the proceedings because of a clerical error.\",\"url_paper\":\"https://arxiv.org/pdf/2004.06052.pdf\",\"url_link\":\"https://www.youtube.com/watch?v=uOAA0nbh9MI\",\"abstract\":\"We propose a new algorithm to synthesise quantum circuits for phase polynomials, which takes into account the qubit connectivity of the quantum computer. We focus on the architectures of currently available NISQ devices. Our algorithm generates circuits with a smaller CNOT depth than the algorithms currently used in Staq and t|ket>, while improving the runtime with respect the former.\",\"keywords\":\"published\",\"bibtex\":\"@article{2004.06052,\\n   title={Architecture-Aware Synthesis of Phase Polynomials for NISQ Devices},\\n   volume={394},\\n   DOI={10.4204/eptcs.394.8},\\n   journal={Electronic Proceedings in Theoretical Computer Science},\\n   publisher={Open Publishing Association},\\n   author={\\\\textbf{Arianne} \\\\textbf{Meijer-van de Griend} and Duncan, Ross},\\n   year={2023},\\n   month=nov, \\n   pages={116-140} ,\\n  note={In Proceedings QPL 2022, arXiv:2311.08375. This paper was originally accepted as Submission 38 in QPL2020, but was not included in the proceedings because of a clerical error.},\\n  url_Paper = {https://arxiv.org/pdf/2004.06052.pdf},\\n  url_Link = {https://www.youtube.com/watch?v=uOAA0nbh9MI},\\n  abstract = {We propose a new algorithm to synthesise quantum circuits for phase polynomials, which takes\\n  into account the qubit connectivity of the quantum computer. We focus on the architectures\\n  of currently available NISQ devices. Our algorithm generates circuits with a smaller CNOT\\n  depth than the algorithms currently used in Staq and t|ket>, while improving the runtime\\n  with respect the former.},\\nkeywords = {published}\\n}\\n\\n\",\"author_short\":[\"\\\\textbfMeijer-van de Griend, \\\\.\",\"Duncan, R.\"],\"key\":\"2004.06052\",\"id\":\"2004.06052\",\"bibbaseid\":\"textbfmeijervandegriend-duncan-architectureawaresynthesisofphasepolynomialsfornisqdevices-2023\",\"role\":\"author\",\"urls\":{\" paper\":\"https://arxiv.org/pdf/2004.06052.pdf\",\" link\":\"https://www.youtube.com/watch?v=uOAA0nbh9MI\"},\"keyword\":[\"published\"],\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"\\\\textbfAdriana\"],\"propositions\":[],\"lastnames\":[\"\\\\textbfMeijer-van de Griend\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Nurminen\"],\"firstnames\":[\"Jukka\",\"K\"],\"suffixes\":[]}],\"journal\":\"IEEE Transactions on Quantum Engineering\",\"title\":\"QuantMark: A benchmarking API for comparing VQE algorithms\",\"year\":\"2022\",\"volume\":\"\",\"number\":\"\",\"pages\":\"1-1\",\"doi\":\"10.1109/TQE.2022.3159327\",\"url_paper\":\"https://ieeexplore.ieee.org/document/9735298\",\"abstract\":\"Thanks to the rise of quantum computers, many variations of the variational quantum eigensolver (VQE) have been proposed in recent times. This is a promising development for real quantum algorithms, as the VQE is a promising algorithm that runs on current quantum hardware. However, the popular method of comparing your algorithm versus a classical baseline in a small basis set is not meaningful in the big picture. Moreover, many papers use a different molecular representation or a different quantum computer to test their algorithms such that the used baselines are different between different papers. Thus, it is almost impossible to compare the different algorithms to each other. As a solution, we have built a benchmarking framework to standardize the VQE performance metrics, such that they can be analyzed more easily. Using our framework, any researcher working on the VQE can easily test their own algorithms against previous ones on the leaderboard without the need to reproduce previous work themselves.\",\"keywords\":\"published\",\"bibtex\":\"@article{quantmark,\\n  author={\\\\textbf{Adriana} \\\\textbf{Meijer-van de Griend} and Nurminen, Jukka K},\\n  journal={IEEE Transactions on Quantum Engineering}, \\n  title={QuantMark: A benchmarking API for comparing VQE algorithms}, \\n  year={2022},\\n  volume={},\\n  number={},\\n  pages={1-1},\\n  doi={10.1109/TQE.2022.3159327},\\n  url_Paper={https://ieeexplore.ieee.org/document/9735298},\\n  abstract = {Thanks to the rise of quantum computers, many variations of the variational quantum eigensolver (VQE) have been proposed in recent times. This is a promising development for real quantum algorithms, as the VQE is a promising algorithm that runs on current quantum hardware. However, the popular method of comparing your algorithm versus a classical baseline in a small basis set is not meaningful in the big picture. Moreover, many papers use a different molecular representation or a different quantum computer to test their algorithms such that the used baselines are different between different papers. Thus, it is almost impossible to compare the different algorithms to each other. As a solution, we have built a benchmarking framework to standardize the VQE performance metrics, such that they can be analyzed more easily. Using our framework, any researcher working on the VQE can easily test their own algorithms against previous ones on the leaderboard without the need to reproduce previous work themselves.},\\nkeywords = {published}}\\n\\n\",\"author_short\":[\"\\\\textbfMeijer-van de Griend, \\\\.\",\"Nurminen, J. K\"],\"key\":\"quantmark\",\"id\":\"quantmark\",\"bibbaseid\":\"textbfmeijervandegriend-nurminen-quantmarkabenchmarkingapiforcomparingvqealgorithms-2022\",\"role\":\"author\",\"urls\":{\" paper\":\"https://ieeexplore.ieee.org/document/9735298\"},\"keyword\":[\"published\"],\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Equi\"],\"firstnames\":[\"Massimo\"],\"suffixes\":[]},{\"firstnames\":[\"\\\\textbfArianne\"],\"propositions\":[],\"lastnames\":[\"\\\\textbfMeijer-van de Griend\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Mäkinen\"],\"firstnames\":[\"Veli\"],\"suffixes\":[]}],\"title\":\"From Bit-Parallelism to Quantum String Matching for Labelled Graphs\",\"booktitle\":\"34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023)\",\"pages\":\"9:1–9:20\",\"series\":\"Leibniz International Proceedings in Informatics (LIPIcs)\",\"isbn\":\"978-3-95977-276-1\",\"issn\":\"1868-8969\",\"year\":\"2023\",\"volume\":\"259\",\"editor\":[{\"propositions\":[],\"lastnames\":[\"Bulteau\"],\"firstnames\":[\"Laurent\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Lipták\"],\"firstnames\":[\"Zsuzsanna\"],\"suffixes\":[]}],\"publisher\":\"Schloss Dagstuhl – Leibniz-Zentrum für Informatik\",\"address\":\"Dagstuhl, Germany\",\"url\":\"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2023.9\",\"urn\":\"urn:nbn:de:0030-drops-179637\",\"doi\":\"10.4230/LIPIcs.CPM.2023.9\",\"annote\":\"Keywords: Bit-parallelism, quantum computation, string matching, level DAGs\",\"keywords\":\"published\",\"bibtex\":\"@InProceedings{equi2021bit,\\n  author =\\t{Equi, Massimo and \\\\textbf{Arianne} \\\\textbf{Meijer-van de Griend} and M\\\\\\\"{a}kinen, Veli},\\n  title =\\t{{From Bit-Parallelism to Quantum String Matching for Labelled Graphs}},\\n  booktitle =\\t{34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023)},\\n  pages =\\t{9:1--9:20},\\n  series =\\t{Leibniz International Proceedings in Informatics (LIPIcs)},\\n  ISBN =\\t{978-3-95977-276-1},\\n  ISSN =\\t{1868-8969},\\n  year =\\t{2023},\\n  volume =\\t{259},\\n  editor =\\t{Bulteau, Laurent and Lipt\\\\'{a}k, Zsuzsanna},\\n  publisher =\\t{Schloss Dagstuhl -- Leibniz-Zentrum f{\\\\\\\"u}r Informatik},\\n  address =\\t{Dagstuhl, Germany},\\n  URL =\\t\\t{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2023.9},\\n  URN =\\t\\t{urn:nbn:de:0030-drops-179637},\\n  doi =\\t\\t{10.4230/LIPIcs.CPM.2023.9},\\n  annote =\\t{Keywords: Bit-parallelism, quantum computation, string matching, level DAGs},\\n    keywords = {published}\\n}\\n\\n\",\"author_short\":[\"Equi, M.\",\"\\\\textbfMeijer-van de Griend, \\\\.\",\"Mäkinen, V.\"],\"editor_short\":[\"Bulteau, L.\",\"Lipták, Z.\"],\"key\":\"equi2021bit\",\"id\":\"equi2021bit\",\"bibbaseid\":\"equi-textbfmeijervandegriend-mkinen-frombitparallelismtoquantumstringmatchingforlabelledgraphs-2023\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2023.9\"},\"keyword\":[\"published\"],\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Dynamic Qubit Routing with CNOT Circuit Synthesis for Quantum Compilation\",\"volume\":\"394\",\"doi\":\"10.4204/eptcs.394.18\",\"journal\":\"Electronic Proceedings in Theoretical Computer Science\",\"publisher\":\"Open Publishing Association\",\"author\":[{\"firstnames\":[\"\\\\textbfArianne\"],\"propositions\":[],\"lastnames\":[\"\\\\textbfMeijer-van de Griend\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Li\"],\"firstnames\":[\"Sarah\",\"Meng\"],\"suffixes\":[]}],\"year\":\"2023\",\"month\":\"November\",\"pages\":\"363-399\",\"url_paper\":\"https://arxiv.org/pdf/2205.00724.pdf\",\"abstract\":\"Many quantum computers have constraints regarding which two-qubit operations are locally allowed. To run a quantum circuit under those constraints, qubits need to be allocated to different quantum registers, and multi-qubit gates need to be routed accordingly. Recent developments have shown that Steiner-tree based compiling strategies provide a competitive tool to route CNOT gates. However, these algorithms require the qubit allocation to be decided before routing. Moreover, the allocation is fixed throughout the computation, i.e. the logical qubit will not move to a different qubit register. This is inefficient with respect to the CNOT count of the resulting circuit. In this paper, we propose the algorithm PermRowCol for routing CNOTs in a quantum circuit. It dynamically reallocates logical qubits during the computation, and thus results in fewer output CNOTs than the algorithms Steiner-Gauss[11] and RowCol [23]. Here we focus on circuits over CNOT only, but this method could be generalized to a routing and allocation strategy on Clifford+T circuits by slicing the quantum circuit into subcircuits composed of CNOTs and single-qubit gates. Additionally, PermRowCol can be used in place of Steiner-Gauss in the synthesis of phase polynomials as well as the extraction of quantum circuits from ZX-diagrams.\",\"keywords\":\"published\",\"bibtex\":\"@article{2205.00724,\\n   title={Dynamic Qubit Routing with CNOT Circuit Synthesis for Quantum Compilation},\\n   volume={394},\\n   DOI={10.4204/eptcs.394.18},\\n   journal={Electronic Proceedings in Theoretical Computer Science},\\n   publisher={Open Publishing Association},\\n   author={\\\\textbf{Arianne} \\\\textbf{Meijer-van de Griend} and Li, Sarah Meng},\\n   year={2023},\\n   month=nov, pages={363-399},\\n  url_Paper = {https://arxiv.org/pdf/2205.00724.pdf},\\n  abstract = {Many quantum computers have constraints regarding which two-qubit operations are locally allowed. To run a quantum circuit under those constraints, qubits need to be allocated to different quantum registers, and multi-qubit gates need to be routed accordingly. Recent developments have shown that Steiner-tree based compiling strategies provide a competitive tool to route CNOT gates. However, these algorithms require the qubit allocation to be decided before routing. Moreover, the allocation is fixed throughout the computation, i.e. the logical qubit will not move to a different qubit register. This is inefficient with respect to the CNOT count of the resulting circuit. In this paper, we propose the algorithm PermRowCol for routing CNOTs in a quantum circuit. It dynamically reallocates logical qubits during the computation, and thus results in fewer output CNOTs than the algorithms Steiner-Gauss[11] and RowCol [23]. Here we focus on circuits over CNOT only, but this method could be generalized to a routing and allocation strategy on Clifford+T circuits by slicing the quantum circuit into subcircuits composed of CNOTs and single-qubit gates. Additionally, PermRowCol can be used in place of Steiner-Gauss in the synthesis of phase polynomials as well as the extraction of quantum circuits from ZX-diagrams.},\\nkeywords = {published}\\n}\\n\\n\\n\",\"author_short\":[\"\\\\textbfMeijer-van de Griend, \\\\.\",\"Li, S. M.\"],\"key\":\"2205.00724\",\"id\":\"2205.00724\",\"bibbaseid\":\"textbfmeijervandegriend-li-dynamicqubitroutingwithcnotcircuitsynthesisforquantumcompilation-2023\",\"role\":\"author\",\"urls\":{\" paper\":\"https://arxiv.org/pdf/2205.00724.pdf\"},\"keyword\":[\"published\"],\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"A comparison of quantum compilers using a DAG-based or phase polynomial-based intermediate representation\",\"author\":[{\"propositions\":[],\"lastnames\":[\"\\\\textbfMeijer-van de Griend\"],\"firstnames\":[\"\\\\textbfArianne\"],\"suffixes\":[]}],\"journal\":\"Journal of Systems and Software\",\"volume\":\"221\",\"pages\":\"112224\",\"year\":\"2025\",\"publisher\":\"Elsevier\",\"keywords\":\"published\",\"bibtex\":\"@article{meijer2023towards,\\n  title={A comparison of quantum compilers using a DAG-based or phase polynomial-based intermediate representation},\\n  author={\\\\textbf{Meijer-van de Griend}, \\\\textbf{Arianne}},\\n  journal={Journal of Systems and Software},\\n  volume={221},\\n  pages={112224},\\n  year={2025},\\n  publisher={Elsevier},\\n  keywords = {published},\\n}\\n\\n\",\"author_short\":[\"\\\\textbfMeijer-van de Griend, \\\\.\"],\"key\":\"meijer2023towards\",\"id\":\"meijer2023towards\",\"bibbaseid\":\"textbfmeijervandegriend-acomparisonofquantumcompilersusingadagbasedorphasepolynomialbasedintermediaterepresentation-2025\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"published\"],\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Advances in Quantum Compilation in the NISQ Era\",\"author\":[{\"firstnames\":[\"\\\\textbfArianne\"],\"propositions\":[],\"lastnames\":[\"\\\\textbfMeijer-van de Griend\"],\"suffixes\":[]}],\"year\":\"2024\",\"publisher\":\"Helsingin yliopisto\",\"url_paper\":\"http://urn.fi/URN:ISBN:978-952-84-0077-6\",\"keywords\":\"published\",\"abstract\":\"Recent advances in the development of quantum technology have made it possible to run small quantum programs on real quantum computers. This has created a need for compiling methods specific to these quantum computers. Unlike classical computers, if a quantum computation takes too long, the qubits might decohere and lose their information, making the computation useless. Hence, well-optimized quantum programs are a necessity. Like classical computers, quantum computers have registers for qubits that are generally sparsely connected. However, classical compilation methods that rely on copying data from one register to another do not apply to quantum computers because qubits cannot be copied. This problem is called the qubit routing problem. Following classical compilation, one could solve the connectivity constraints by moving the qubits to adjacent qubit registers. However, this requires the addition of SWAP gates throughout the quantum circuit, resulting in a strictly longer program. Additionally, a SWAP gate on qubits is not cheap and requires three CNOT gates each. Instead, in this thesis, we have defined a new method for quantum compilation that is based in the quantum nature of the program to be compiled. Instead of routing the qubits directly, we generate new machine code (in the form of quantum circuits) from an intermediate representation. We call this process quantum circuit synthesis. During synthesis, we make sure that all generated gates are supported by the target quantum hardware. Additionally, if the synthesis process is optimal, the resulting quantum circuit will also be optimal, although the methods proposed in this thesis are all heuristic in nature due to the computational complexity of optimal architecture-aware synthesis. We construct the nested intermediate representation starting from sequences of CNOT circuits interleaved with single qubit gates and incrementally generalize the intermediate representation to a universal representation. In particular, we propose two algorithms for synthesizing CNOT circuits from their parity matrix representation and one algorithm for synthesizing phase polynomials (i.e. CNOT+$R_Z$ circuits). Additionally, we show that when combining these methods into the universal representation called Mixed ZX-phase polynomial, it is competitive with existing commercial quantum compilers IBM's Qiskit and Quantinuum's TKET for large circuits. This thesis additionally contains a proposal for a framework to benchmark the quality of circuits used in an algorithm called Variational Quantum Eigensolver (VQE). This framework attempts to measure how close the solution found by the VQE is to our best estimate of a real molecule (i.e. accuracy), rather than a classical simulation of the approximate molecule as given to the quantum computer (i.e. precision).\",\"bibtex\":\"@article{PhDThesis,\\n  title={Advances in Quantum Compilation in the NISQ Era},\\n  author={\\\\textbf{Arianne} \\\\textbf{Meijer-van de Griend}},\\n  year={2024},\\n  publisher={Helsingin yliopisto},\\n  url_Paper={http://urn.fi/URN:ISBN:978-952-84-0077-6},\\n  keywords = {published},\\n  abstract = {Recent advances in the development of quantum technology have made it possible to run small quantum programs on real quantum computers. This has created a need for compiling methods specific to these quantum computers. Unlike classical computers, if a quantum computation takes too long, the qubits might decohere and lose their information, making the computation useless. Hence, well-optimized quantum programs are a necessity.\\n\\nLike classical computers, quantum computers have registers for qubits that are generally sparsely connected. However, classical compilation methods that rely on copying data from one register to another do not apply to quantum computers because qubits cannot be copied. This problem is called the qubit routing problem. Following classical compilation, one could solve the connectivity constraints by moving the qubits to adjacent qubit registers. However, this requires the addition of SWAP gates throughout the quantum circuit, resulting in a strictly longer program. Additionally, a SWAP gate on qubits is not cheap and requires three CNOT gates each.\\n\\nInstead, in this thesis, we have defined a new method for quantum compilation that is based in the quantum nature of the program to be compiled. Instead of routing the qubits directly, we generate new machine code (in the form of quantum circuits) from an intermediate representation. We call this process quantum circuit synthesis. During synthesis, we make sure that all generated gates are supported by the target quantum hardware. Additionally, if the synthesis process is optimal, the resulting quantum circuit will also be optimal, although the methods proposed in this thesis are all heuristic in nature due to the computational complexity of optimal architecture-aware synthesis.\\n\\nWe construct the nested intermediate representation starting from sequences of CNOT circuits interleaved with single qubit gates and incrementally generalize the intermediate representation to a universal representation. In particular, we propose two algorithms for synthesizing CNOT circuits from their parity matrix representation and one algorithm for synthesizing phase polynomials (i.e. CNOT+$R_Z$ circuits). Additionally, we show that when combining these methods into the universal representation called Mixed ZX-phase polynomial, it is competitive with existing commercial quantum compilers IBM's Qiskit and Quantinuum's TKET for large circuits.\\n\\nThis thesis additionally contains a proposal for a framework to benchmark the quality of circuits used in an algorithm called Variational Quantum Eigensolver (VQE). This framework attempts to measure how close the solution found by the VQE is to our best estimate of a real molecule (i.e. accuracy), rather than a classical simulation of the approximate molecule as given to the quantum computer (i.e. precision).},\\n}\\n\\n\",\"author_short\":[\"\\\\textbfMeijer-van de Griend, \\\\.\"],\"key\":\"PhDThesis\",\"id\":\"PhDThesis\",\"bibbaseid\":\"textbfmeijervandegriend-advancesinquantumcompilationinthenisqera-2024\",\"role\":\"author\",\"urls\":{\" paper\":\"http://urn.fi/URN:ISBN:978-952-84-0077-6\"},\"keyword\":[\"published\"],\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Exposing the hidden layers and interplay in the quantum software stack\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Stirbu\"],\"firstnames\":[\"Vlad\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"\\\\textbfMeijer-van de Griend\"],\"firstnames\":[\"\\\\textbfArianne\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Muff\"],\"firstnames\":[\"Jake\"],\"suffixes\":[]}],\"booktitle\":\"2024 IEEE 21st International Conference on Software Architecture Companion (ICSA-C)\",\"pages\":\"24–25\",\"year\":\"2024\",\"organization\":\"IEEE\",\"keywords\":\"published\",\"bibtex\":\"@inproceedings{stirbu2024exposinghiddenlayersinterplay,\\n  title={Exposing the hidden layers and interplay in the quantum software stack},\\n  author={Stirbu, Vlad and \\\\textbf{Meijer-van de Griend}, \\\\textbf{Arianne} and Muff, Jake},\\n  booktitle={2024 IEEE 21st International Conference on Software Architecture Companion (ICSA-C)},\\n  pages={24--25},\\n  year={2024},\\n  organization={IEEE},\\n  keywords = {published},\\n}\\n\\n\",\"author_short\":[\"Stirbu, V.\",\"\\\\textbfMeijer-van de Griend, \\\\.\",\"Muff, J.\"],\"key\":\"stirbu2024exposinghiddenlayersinterplay\",\"id\":\"stirbu2024exposinghiddenlayersinterplay\",\"bibbaseid\":\"stirbu-textbfmeijervandegriend-muff-exposingthehiddenlayersandinterplayinthequantumsoftwarestack-2024\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"published\"],\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"title\":\"Architecture-Aware Synthesis of Stabilizer Circuits from Clifford Tableaus\",\"author\":[{\"firstnames\":[\"David\"],\"propositions\":[],\"lastnames\":[\"Winderl\"],\"suffixes\":[]},{\"firstnames\":[\"Qunsheng\"],\"propositions\":[],\"lastnames\":[\"Huang\"],\"suffixes\":[]},{\"firstnames\":[\"\\\\textbfArianne\"],\"propositions\":[],\"lastnames\":[\"\\\\textbfMeijer-van de Griend\"],\"suffixes\":[]},{\"firstnames\":[\"Richie\"],\"propositions\":[],\"lastnames\":[\"Yeung\"],\"suffixes\":[]}],\"year\":\"2023\",\"eprint\":\"2309.08972\",\"archiveprefix\":\"arXiv\",\"primaryclass\":\"quant-ph\",\"url\":\"https://arxiv.org/abs/2309.08972\",\"keywords\":\"submitted\",\"abstract\":\"Since quantum computing is currently in the NISQ-Era, compilation strategies to reduce the number of gates executed on specific hardware are required. In this work, we utilize the concept of synthesis of a data structure called Clifford tableaus, focusing on applying CNOTs within the respective connectivity graph of the quantum device. We hence contribute to the field of compilation or, more precisely, synthesis by reducing the number of CNOTs in the synthesized quantum circuit. Upon convergence, our method shows to outperform other state-of-the-art synthesis techniques, when executed with respect to a specific hardware. Upon executing the resulting circuits on real hardware, our synthesized circuits tend to increase the final fidelity and reduce the overall execution times.\",\"bibtex\":\"@article{winderl2023architectureawaresynthesisstabilizercircuits,\\n      title={Architecture-Aware Synthesis of Stabilizer Circuits from Clifford Tableaus}, \\n      author={David Winderl and Qunsheng Huang and \\\\textbf{Arianne} \\\\textbf{Meijer-van de Griend} and Richie Yeung},\\n      year={2023},\\n      eprint={2309.08972},\\n      archivePrefix={arXiv},\\n      primaryClass={quant-ph},\\n      url={https://arxiv.org/abs/2309.08972}, \\n      keywords = {submitted},\\n      abstract = {Since quantum computing is currently in the NISQ-Era, compilation strategies to reduce the number of gates executed on specific hardware are required. In this work, we utilize the concept of synthesis of a data structure called Clifford tableaus, focusing on applying CNOTs within the respective connectivity graph of the quantum device. We hence contribute to the field of compilation or, more precisely, synthesis by reducing the number of CNOTs in the synthesized quantum circuit. Upon convergence, our method shows to outperform other state-of-the-art synthesis techniques, when executed with respect to a specific hardware. Upon executing the resulting circuits on real hardware, our synthesized circuits tend to increase the final fidelity and reduce the overall execution times.},\\n}\\n\\n\\n\",\"author_short\":[\"Winderl, D.\",\"Huang, Q.\",\"\\\\textbfMeijer-van de Griend, \\\\.\",\"Yeung, R.\"],\"key\":\"winderl2023architectureawaresynthesisstabilizercircuits\",\"id\":\"winderl2023architectureawaresynthesisstabilizercircuits\",\"bibbaseid\":\"winderl-huang-textbfmeijervandegriend-yeung-architectureawaresynthesisofstabilizercircuitsfromcliffordtableaus-2023\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://arxiv.org/abs/2309.08972\"},\"keyword\":[\"submitted\"],\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"misc\",\"type\":\"misc\",\"keywords\":\"preprint\",\"title\":\"Technology and Performance Benchmarks of IQM's 20-Qubit Quantum Computer\",\"author\":[{\"firstnames\":[\"Leonid\"],\"propositions\":[],\"lastnames\":[\"Abdurakhimov\"],\"suffixes\":[]},{\"firstnames\":[\"Janos\"],\"propositions\":[],\"lastnames\":[\"Adam\"],\"suffixes\":[]},{\"firstnames\":[\"Hasnain\"],\"propositions\":[],\"lastnames\":[\"Ahmad\"],\"suffixes\":[]},{\"firstnames\":[\"Olli\"],\"propositions\":[],\"lastnames\":[\"Ahonen\"],\"suffixes\":[]},{\"firstnames\":[\"Manuel\"],\"propositions\":[],\"lastnames\":[\"Algaba\"],\"suffixes\":[]},{\"firstnames\":[\"Guillermo\"],\"propositions\":[],\"lastnames\":[\"Alonso\"],\"suffixes\":[]},{\"firstnames\":[\"Ville\"],\"propositions\":[],\"lastnames\":[\"Bergholm\"],\"suffixes\":[]},{\"firstnames\":[\"Rohit\"],\"propositions\":[],\"lastnames\":[\"Beriwal\"],\"suffixes\":[]},{\"firstnames\":[\"Matthias\"],\"propositions\":[],\"lastnames\":[\"Beuerle\"],\"suffixes\":[]},{\"firstnames\":[\"Clinton\"],\"propositions\":[],\"lastnames\":[\"Bockstiegel\"],\"suffixes\":[]},{\"firstnames\":[\"Alessio\"],\"propositions\":[],\"lastnames\":[\"Calzona\"],\"suffixes\":[]},{\"firstnames\":[\"Chun\",\"Fai\"],\"propositions\":[],\"lastnames\":[\"Chan\"],\"suffixes\":[]},{\"firstnames\":[\"Daniele\"],\"propositions\":[],\"lastnames\":[\"Cucurachi\"],\"suffixes\":[]},{\"firstnames\":[\"Saga\"],\"propositions\":[],\"lastnames\":[\"Dahl\"],\"suffixes\":[]},{\"firstnames\":[\"Rakhim\"],\"propositions\":[],\"lastnames\":[\"Davletkaliyev\"],\"suffixes\":[]},{\"firstnames\":[\"Olexiy\"],\"propositions\":[],\"lastnames\":[\"Fedorets\"],\"suffixes\":[]},{\"firstnames\":[\"Alejandro\",\"Gomez\"],\"propositions\":[],\"lastnames\":[\"Frieiro\"],\"suffixes\":[]},{\"firstnames\":[\"Zheming\"],\"propositions\":[],\"lastnames\":[\"Gao\"],\"suffixes\":[]},{\"firstnames\":[\"Johan\"],\"propositions\":[],\"lastnames\":[\"Guldmyr\"],\"suffixes\":[]},{\"firstnames\":[\"Andrew\"],\"propositions\":[],\"lastnames\":[\"Guthrie\"],\"suffixes\":[]},{\"firstnames\":[\"Juha\"],\"propositions\":[],\"lastnames\":[\"Hassel\"],\"suffixes\":[]},{\"firstnames\":[\"Hermanni\"],\"propositions\":[],\"lastnames\":[\"Heimonen\"],\"suffixes\":[]},{\"firstnames\":[\"Johannes\"],\"propositions\":[],\"lastnames\":[\"Heinsoo\"],\"suffixes\":[]},{\"firstnames\":[\"Tuukka\"],\"propositions\":[],\"lastnames\":[\"Hiltunen\"],\"suffixes\":[]},{\"firstnames\":[\"Keiran\"],\"propositions\":[],\"lastnames\":[\"Holland\"],\"suffixes\":[]},{\"firstnames\":[\"Juho\"],\"propositions\":[],\"lastnames\":[\"Hotari\"],\"suffixes\":[]},{\"firstnames\":[\"Hao\"],\"propositions\":[],\"lastnames\":[\"Hsu\"],\"suffixes\":[]},{\"firstnames\":[\"Antti\"],\"propositions\":[],\"lastnames\":[\"Huhtala\"],\"suffixes\":[]},{\"firstnames\":[\"Eric\"],\"propositions\":[],\"lastnames\":[\"Hyyppä\"],\"suffixes\":[]},{\"firstnames\":[\"Aleksi\"],\"propositions\":[],\"lastnames\":[\"Hämäläinen\"],\"suffixes\":[]},{\"firstnames\":[\"Joni\"],\"propositions\":[],\"lastnames\":[\"Ikonen\"],\"suffixes\":[]},{\"firstnames\":[\"Sinan\"],\"propositions\":[],\"lastnames\":[\"Inel\"],\"suffixes\":[]},{\"firstnames\":[\"David\"],\"propositions\":[],\"lastnames\":[\"Janzso\"],\"suffixes\":[]},{\"firstnames\":[\"Teemu\"],\"propositions\":[],\"lastnames\":[\"Jaakkola\"],\"suffixes\":[]},{\"firstnames\":[\"Mate\"],\"propositions\":[],\"lastnames\":[\"Jenei\"],\"suffixes\":[]},{\"firstnames\":[\"Shan\"],\"propositions\":[],\"lastnames\":[\"Jolin\"],\"suffixes\":[]},{\"firstnames\":[\"Kristinn\"],\"propositions\":[],\"lastnames\":[\"Juliusson\"],\"suffixes\":[]},{\"firstnames\":[\"Jaakko\"],\"propositions\":[],\"lastnames\":[\"Jussila\"],\"suffixes\":[]},{\"firstnames\":[\"Shabeeb\"],\"propositions\":[],\"lastnames\":[\"Khalid\"],\"suffixes\":[]},{\"firstnames\":[\"Seung-Goo\"],\"propositions\":[],\"lastnames\":[\"Kim\"],\"suffixes\":[]},{\"firstnames\":[\"Miikka\"],\"propositions\":[],\"lastnames\":[\"Koistinen\"],\"suffixes\":[]},{\"firstnames\":[\"Roope\"],\"propositions\":[],\"lastnames\":[\"Kokkoniemi\"],\"suffixes\":[]},{\"firstnames\":[\"Anton\"],\"propositions\":[],\"lastnames\":[\"Komlev\"],\"suffixes\":[]},{\"firstnames\":[\"Caspar\"],\"propositions\":[],\"lastnames\":[\"Ockeloen-Korppi\"],\"suffixes\":[]},{\"firstnames\":[\"Otto\"],\"propositions\":[],\"lastnames\":[\"Koskinen\"],\"suffixes\":[]},{\"firstnames\":[\"Janne\"],\"propositions\":[],\"lastnames\":[\"Kotilahti\"],\"suffixes\":[]},{\"firstnames\":[\"Toivo\"],\"propositions\":[],\"lastnames\":[\"Kuisma\"],\"suffixes\":[]},{\"firstnames\":[\"Vladimir\"],\"propositions\":[],\"lastnames\":[\"Kukushkin\"],\"suffixes\":[]},{\"firstnames\":[\"Kari\"],\"propositions\":[],\"lastnames\":[\"Kumpulainen\"],\"suffixes\":[]},{\"firstnames\":[\"Ilari\"],\"propositions\":[],\"lastnames\":[\"Kuronen\"],\"suffixes\":[]},{\"firstnames\":[\"Joonas\"],\"propositions\":[],\"lastnames\":[\"Kylmälä\"],\"suffixes\":[]},{\"firstnames\":[\"Niclas\"],\"propositions\":[],\"lastnames\":[\"Lamponen\"],\"suffixes\":[]},{\"firstnames\":[\"Julia\"],\"propositions\":[],\"lastnames\":[\"Lamprich\"],\"suffixes\":[]},{\"firstnames\":[\"Alessandro\"],\"propositions\":[],\"lastnames\":[\"Landra\"],\"suffixes\":[]},{\"firstnames\":[\"Martin\"],\"propositions\":[],\"lastnames\":[\"Leib\"],\"suffixes\":[]},{\"firstnames\":[\"Tianyi\"],\"propositions\":[],\"lastnames\":[\"Li\"],\"suffixes\":[]},{\"firstnames\":[\"Per\"],\"propositions\":[],\"lastnames\":[\"Liebermann\"],\"suffixes\":[]},{\"firstnames\":[\"Aleksi\"],\"propositions\":[],\"lastnames\":[\"Lintunen\"],\"suffixes\":[]},{\"firstnames\":[\"Wei\"],\"propositions\":[],\"lastnames\":[\"Liu\"],\"suffixes\":[]},{\"firstnames\":[\"Jürgen\"],\"propositions\":[],\"lastnames\":[\"Luus\"],\"suffixes\":[]},{\"firstnames\":[\"Fabian\"],\"propositions\":[],\"lastnames\":[\"Marxer\"],\"suffixes\":[]},{\"firstnames\":[\"\\\\textbfArianne\"],\"propositions\":[],\"lastnames\":[\"\\\\textbfMeijer-van de Griend\"],\"suffixes\":[]},{\"firstnames\":[\"Kunal\"],\"propositions\":[],\"lastnames\":[\"Mitra\"],\"suffixes\":[]},{\"firstnames\":[\"Jalil\",\"Khatibi\"],\"propositions\":[],\"lastnames\":[\"Moqadam\"],\"suffixes\":[]},{\"firstnames\":[\"Jakub\"],\"propositions\":[],\"lastnames\":[\"Mrożek\"],\"suffixes\":[]},{\"firstnames\":[\"Henrikki\"],\"propositions\":[],\"lastnames\":[\"Mäkynen\"],\"suffixes\":[]},{\"firstnames\":[\"Janne\"],\"propositions\":[],\"lastnames\":[\"Mäntylä\"],\"suffixes\":[]},{\"firstnames\":[\"Tiina\"],\"propositions\":[],\"lastnames\":[\"Naaranoja\"],\"suffixes\":[]},{\"firstnames\":[\"Francesco\"],\"propositions\":[],\"lastnames\":[\"Nappi\"],\"suffixes\":[]},{\"firstnames\":[\"Janne\"],\"propositions\":[],\"lastnames\":[\"Niemi\"],\"suffixes\":[]},{\"firstnames\":[\"Lucas\"],\"propositions\":[],\"lastnames\":[\"Ortega\"],\"suffixes\":[]},{\"firstnames\":[\"Mario\"],\"propositions\":[],\"lastnames\":[\"Palma\"],\"suffixes\":[]},{\"firstnames\":[\"Miha\"],\"propositions\":[],\"lastnames\":[\"Papič\"],\"suffixes\":[]},{\"firstnames\":[\"Matti\"],\"propositions\":[],\"lastnames\":[\"Partanen\"],\"suffixes\":[]},{\"firstnames\":[\"Jari\"],\"propositions\":[],\"lastnames\":[\"Penttilä\"],\"suffixes\":[]},{\"firstnames\":[\"Alexander\"],\"propositions\":[],\"lastnames\":[\"Plyushch\"],\"suffixes\":[]},{\"firstnames\":[\"Wei\"],\"propositions\":[],\"lastnames\":[\"Qiu\"],\"suffixes\":[]},{\"firstnames\":[\"Aniket\"],\"propositions\":[],\"lastnames\":[\"Rath\"],\"suffixes\":[]},{\"firstnames\":[\"Kari\"],\"propositions\":[],\"lastnames\":[\"Repo\"],\"suffixes\":[]},{\"firstnames\":[\"Tomi\"],\"propositions\":[],\"lastnames\":[\"Riipinen\"],\"suffixes\":[]},{\"firstnames\":[\"Jussi\"],\"propositions\":[],\"lastnames\":[\"Ritvas\"],\"suffixes\":[]},{\"firstnames\":[\"Pedro\",\"Figueroa\"],\"propositions\":[],\"lastnames\":[\"Romero\"],\"suffixes\":[]},{\"firstnames\":[\"Jarkko\"],\"propositions\":[],\"lastnames\":[\"Ruoho\"],\"suffixes\":[]},{\"firstnames\":[\"Jukka\"],\"propositions\":[],\"lastnames\":[\"Räbinä\"],\"suffixes\":[]},{\"firstnames\":[\"Sampo\"],\"propositions\":[],\"lastnames\":[\"Saarinen\"],\"suffixes\":[]},{\"firstnames\":[\"Indrajeet\"],\"propositions\":[],\"lastnames\":[\"Sagar\"],\"suffixes\":[]},{\"firstnames\":[\"Hayk\"],\"propositions\":[],\"lastnames\":[\"Sargsyan\"],\"suffixes\":[]},{\"firstnames\":[\"Matthew\"],\"propositions\":[],\"lastnames\":[\"Sarsby\"],\"suffixes\":[]},{\"firstnames\":[\"Niko\"],\"propositions\":[],\"lastnames\":[\"Savola\"],\"suffixes\":[]},{\"firstnames\":[\"Mykhailo\"],\"propositions\":[],\"lastnames\":[\"Savytskyi\"],\"suffixes\":[]},{\"firstnames\":[\"Ville\"],\"propositions\":[],\"lastnames\":[\"Selinmaa\"],\"suffixes\":[]},{\"firstnames\":[\"Pavel\"],\"propositions\":[],\"lastnames\":[\"Smirnov\"],\"suffixes\":[]},{\"firstnames\":[\"Marco\",\"Marín\"],\"propositions\":[],\"lastnames\":[\"Suárez\"],\"suffixes\":[]},{\"firstnames\":[\"Linus\"],\"propositions\":[],\"lastnames\":[\"Sundström\"],\"suffixes\":[]},{\"firstnames\":[\"Sandra\"],\"propositions\":[],\"lastnames\":[\"Słupińska\"],\"suffixes\":[]},{\"firstnames\":[\"Eelis\"],\"propositions\":[],\"lastnames\":[\"Takala\"],\"suffixes\":[]},{\"firstnames\":[\"Ivan\"],\"propositions\":[],\"lastnames\":[\"Takmakov\"],\"suffixes\":[]},{\"firstnames\":[\"Brian\"],\"propositions\":[],\"lastnames\":[\"Tarasinski\"],\"suffixes\":[]},{\"firstnames\":[\"Manish\"],\"propositions\":[],\"lastnames\":[\"Thapa\"],\"suffixes\":[]},{\"firstnames\":[\"Jukka\"],\"propositions\":[],\"lastnames\":[\"Tiainen\"],\"suffixes\":[]},{\"firstnames\":[\"Francesca\"],\"propositions\":[],\"lastnames\":[\"Tosto\"],\"suffixes\":[]},{\"firstnames\":[\"Jani\"],\"propositions\":[],\"lastnames\":[\"Tuorila\"],\"suffixes\":[]},{\"firstnames\":[\"Carlos\"],\"propositions\":[],\"lastnames\":[\"Valenzuela\"],\"suffixes\":[]},{\"firstnames\":[\"David\"],\"propositions\":[],\"lastnames\":[\"Vasey\"],\"suffixes\":[]},{\"firstnames\":[\"Edwin\"],\"propositions\":[],\"lastnames\":[\"Vehmaanperä\"],\"suffixes\":[]},{\"firstnames\":[\"Antti\"],\"propositions\":[],\"lastnames\":[\"Vepsäläinen\"],\"suffixes\":[]},{\"firstnames\":[\"Aapo\"],\"propositions\":[],\"lastnames\":[\"Vienamo\"],\"suffixes\":[]},{\"firstnames\":[\"Panu\"],\"propositions\":[],\"lastnames\":[\"Vesanen\"],\"suffixes\":[]},{\"firstnames\":[\"Alpo\"],\"propositions\":[],\"lastnames\":[\"Välimaa\"],\"suffixes\":[]},{\"firstnames\":[\"Jaap\"],\"propositions\":[],\"lastnames\":[\"Wesdorp\"],\"suffixes\":[]},{\"firstnames\":[\"Nicola\"],\"propositions\":[],\"lastnames\":[\"Wurz\"],\"suffixes\":[]},{\"firstnames\":[\"Elisabeth\"],\"propositions\":[],\"lastnames\":[\"Wybo\"],\"suffixes\":[]},{\"firstnames\":[\"Lily\"],\"propositions\":[],\"lastnames\":[\"Yang\"],\"suffixes\":[]},{\"firstnames\":[\"Ali\"],\"propositions\":[],\"lastnames\":[\"Yurtalan\"],\"suffixes\":[]}],\"year\":\"2024\",\"eprint\":\"2408.12433\",\"archiveprefix\":\"arXiv\",\"primaryclass\":\"quant-ph\",\"url\":\"https://arxiv.org/abs/2408.12433\",\"bibtex\":\"@misc{abdurakhimov2024technologyperformancebenchmarksiqms,\\nkeywords={preprint},\\n      title={Technology and Performance Benchmarks of IQM's 20-Qubit Quantum Computer}, \\n      author={Leonid Abdurakhimov and Janos Adam and Hasnain Ahmad and Olli Ahonen and Manuel Algaba and Guillermo Alonso and Ville Bergholm and Rohit Beriwal and Matthias Beuerle and Clinton Bockstiegel and Alessio Calzona and Chun Fai Chan and Daniele Cucurachi and Saga Dahl and Rakhim Davletkaliyev and Olexiy Fedorets and Alejandro Gomez Frieiro and Zheming Gao and Johan Guldmyr and Andrew Guthrie and Juha Hassel and Hermanni Heimonen and Johannes Heinsoo and Tuukka Hiltunen and Keiran Holland and Juho Hotari and Hao Hsu and Antti Huhtala and Eric Hyyppä and Aleksi Hämäläinen and Joni Ikonen and Sinan Inel and David Janzso and Teemu Jaakkola and Mate Jenei and Shan Jolin and Kristinn Juliusson and Jaakko Jussila and Shabeeb Khalid and Seung-Goo Kim and Miikka Koistinen and Roope Kokkoniemi and Anton Komlev and Caspar Ockeloen-Korppi and Otto Koskinen and Janne Kotilahti and Toivo Kuisma and Vladimir Kukushkin and Kari Kumpulainen and Ilari Kuronen and Joonas Kylmälä and Niclas Lamponen and Julia Lamprich and Alessandro Landra and Martin Leib and Tianyi Li and Per Liebermann and Aleksi Lintunen and Wei Liu and Jürgen Luus and Fabian Marxer and \\\\textbf{Arianne} \\\\textbf{Meijer-van de Griend} and Kunal Mitra and Jalil Khatibi Moqadam and Jakub Mrożek and Henrikki Mäkynen and Janne Mäntylä and Tiina Naaranoja and Francesco Nappi and Janne Niemi and Lucas Ortega and Mario Palma and Miha Papič and Matti Partanen and Jari Penttilä and Alexander Plyushch and Wei Qiu and Aniket Rath and Kari Repo and Tomi Riipinen and Jussi Ritvas and Pedro Figueroa Romero and Jarkko Ruoho and Jukka Räbinä and Sampo Saarinen and Indrajeet Sagar and Hayk Sargsyan and Matthew Sarsby and Niko Savola and Mykhailo Savytskyi and Ville Selinmaa and Pavel Smirnov and Marco Marín Suárez and Linus Sundström and Sandra Słupińska and Eelis Takala and Ivan Takmakov and Brian Tarasinski and Manish Thapa and Jukka Tiainen and Francesca Tosto and Jani Tuorila and Carlos Valenzuela and David Vasey and Edwin Vehmaanperä and Antti Vepsäläinen and Aapo Vienamo and Panu Vesanen and Alpo Välimaa and Jaap Wesdorp and Nicola Wurz and Elisabeth Wybo and Lily Yang and Ali Yurtalan},\\n      year={2024},\\n      eprint={2408.12433},\\n      archivePrefix={arXiv},\\n      primaryClass={quant-ph},\\n      url={https://arxiv.org/abs/2408.12433}, \\n}\\n\\n\",\"author_short\":[\"Abdurakhimov, L.\",\"Adam, J.\",\"Ahmad, H.\",\"Ahonen, O.\",\"Algaba, M.\",\"Alonso, G.\",\"Bergholm, V.\",\"Beriwal, R.\",\"Beuerle, M.\",\"Bockstiegel, C.\",\"Calzona, A.\",\"Chan, C. F.\",\"Cucurachi, D.\",\"Dahl, S.\",\"Davletkaliyev, R.\",\"Fedorets, O.\",\"Frieiro, A. G.\",\"Gao, Z.\",\"Guldmyr, J.\",\"Guthrie, A.\",\"Hassel, J.\",\"Heimonen, H.\",\"Heinsoo, J.\",\"Hiltunen, T.\",\"Holland, K.\",\"Hotari, J.\",\"Hsu, H.\",\"Huhtala, A.\",\"Hyyppä, E.\",\"Hämäläinen, A.\",\"Ikonen, J.\",\"Inel, S.\",\"Janzso, D.\",\"Jaakkola, T.\",\"Jenei, M.\",\"Jolin, S.\",\"Juliusson, K.\",\"Jussila, J.\",\"Khalid, S.\",\"Kim, S.\",\"Koistinen, M.\",\"Kokkoniemi, R.\",\"Komlev, A.\",\"Ockeloen-Korppi, C.\",\"Koskinen, O.\",\"Kotilahti, J.\",\"Kuisma, T.\",\"Kukushkin, V.\",\"Kumpulainen, K.\",\"Kuronen, I.\",\"Kylmälä, J.\",\"Lamponen, N.\",\"Lamprich, J.\",\"Landra, A.\",\"Leib, M.\",\"Li, T.\",\"Liebermann, P.\",\"Lintunen, A.\",\"Liu, W.\",\"Luus, J.\",\"Marxer, F.\",\"\\\\textbfMeijer-van de Griend, \\\\.\",\"Mitra, K.\",\"Moqadam, J. K.\",\"Mrożek, J.\",\"Mäkynen, H.\",\"Mäntylä, J.\",\"Naaranoja, T.\",\"Nappi, F.\",\"Niemi, J.\",\"Ortega, L.\",\"Palma, M.\",\"Papič, M.\",\"Partanen, M.\",\"Penttilä, J.\",\"Plyushch, A.\",\"Qiu, W.\",\"Rath, A.\",\"Repo, K.\",\"Riipinen, T.\",\"Ritvas, J.\",\"Romero, P. F.\",\"Ruoho, J.\",\"Räbinä, J.\",\"Saarinen, S.\",\"Sagar, I.\",\"Sargsyan, H.\",\"Sarsby, M.\",\"Savola, N.\",\"Savytskyi, M.\",\"Selinmaa, V.\",\"Smirnov, P.\",\"Suárez, M. M.\",\"Sundström, L.\",\"Słupińska, S.\",\"Takala, E.\",\"Takmakov, I.\",\"Tarasinski, B.\",\"Thapa, M.\",\"Tiainen, J.\",\"Tosto, F.\",\"Tuorila, J.\",\"Valenzuela, C.\",\"Vasey, D.\",\"Vehmaanperä, E.\",\"Vepsäläinen, A.\",\"Vienamo, A.\",\"Vesanen, P.\",\"Välimaa, A.\",\"Wesdorp, J.\",\"Wurz, N.\",\"Wybo, E.\",\"Yang, L.\",\"Yurtalan, A.\"],\"key\":\"abdurakhimov2024technologyperformancebenchmarksiqms\",\"id\":\"abdurakhimov2024technologyperformancebenchmarksiqms\",\"bibbaseid\":\"abdurakhimov-adam-ahmad-ahonen-algaba-alonso-bergholm-beriwal-etal-technologyandperformancebenchmarksofiqms20qubitquantumcomputer-2024\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://arxiv.org/abs/2408.12433\"},\"keyword\":[\"preprint\"],\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"title\":\"Redefining lexicographical ordering: Optimizing pauli string decompositions for quantum compiling\",\"author\":[{\"propositions\":[],\"lastnames\":[\"Huang\"],\"firstnames\":[\"Qunsheng\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Winderl\"],\"firstnames\":[\"David\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"\\\\textbfMeijer-van de Griend\"],\"firstnames\":[\"\\\\textbfArianne\"],\"suffixes\":[]},{\"propositions\":[],\"lastnames\":[\"Yeung\"],\"firstnames\":[\"Richie\"],\"suffixes\":[]}],\"booktitle\":\"2024 IEEE International Conference on Quantum Computing and Engineering (QCE)\",\"volume\":\"1\",\"pages\":\"885–896\",\"year\":\"2024\",\"organization\":\"IEEE\",\"keywords\":\"published\",\"bibtex\":\"@inproceedings{huang2024redefining,\\n  title={Redefining lexicographical ordering: Optimizing pauli string decompositions for quantum compiling},\\n  author={Huang, Qunsheng and Winderl, David and \\\\textbf{Meijer-van de Griend}, \\\\textbf{Arianne} and Yeung, Richie},\\n  booktitle={2024 IEEE International Conference on Quantum Computing and Engineering (QCE)},\\n  volume={1},\\n  pages={885--896},\\n  year={2024},\\n  organization={IEEE},\\n  keywords = {published}\\n}\\n\\n\",\"author_short\":[\"Huang, Q.\",\"Winderl, D.\",\"\\\\textbfMeijer-van de Griend, \\\\.\",\"Yeung, R.\"],\"key\":\"huang2024redefining\",\"id\":\"huang2024redefining\",\"bibbaseid\":\"huang-winderl-textbfmeijervandegriend-yeung-redefininglexicographicalorderingoptimizingpaulistringdecompositionsforquantumcompiling-2024\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"published\"],\"metadata\":{\"authorlinks\":{}},\"html\":\"\"},{\"bibtype\":\"misc\",\"type\":\"misc\",\"title\":\"A Superconducting Qubit-Resonator Quantum Processor with Effective All-to-All Connectivity\",\"author\":[{\"firstnames\":[\"Michael\"],\"propositions\":[],\"lastnames\":[\"Renger\"],\"suffixes\":[]},{\"firstnames\":[\"Jeroen\"],\"propositions\":[],\"lastnames\":[\"Verjauw\"],\"suffixes\":[]},{\"firstnames\":[\"Nicola\"],\"propositions\":[],\"lastnames\":[\"Wurz\"],\"suffixes\":[]},{\"firstnames\":[\"Amin\"],\"propositions\":[],\"lastnames\":[\"Hosseinkhani\"],\"suffixes\":[]},{\"firstnames\":[\"Caspar\"],\"propositions\":[],\"lastnames\":[\"Ockeloen-Korppi\"],\"suffixes\":[]},{\"firstnames\":[\"Wei\"],\"propositions\":[],\"lastnames\":[\"Liu\"],\"suffixes\":[]},{\"firstnames\":[\"Aniket\"],\"propositions\":[],\"lastnames\":[\"Rath\"],\"suffixes\":[]},{\"firstnames\":[\"Manish\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Thapa\"],\"suffixes\":[]},{\"firstnames\":[\"Florian\"],\"propositions\":[],\"lastnames\":[\"Vigneau\"],\"suffixes\":[]},{\"firstnames\":[\"Elisabeth\"],\"propositions\":[],\"lastnames\":[\"Wybo\"],\"suffixes\":[]},{\"firstnames\":[\"Ville\"],\"propositions\":[],\"lastnames\":[\"Bergholm\"],\"suffixes\":[]},{\"firstnames\":[\"Chun\",\"Fai\"],\"propositions\":[],\"lastnames\":[\"Chan\"],\"suffixes\":[]},{\"firstnames\":[\"Bálint\"],\"propositions\":[],\"lastnames\":[\"Csatári\"],\"suffixes\":[]},{\"firstnames\":[\"Saga\"],\"propositions\":[],\"lastnames\":[\"Dahl\"],\"suffixes\":[]},{\"firstnames\":[\"Rakhim\"],\"propositions\":[],\"lastnames\":[\"Davletkaliyev\"],\"suffixes\":[]},{\"firstnames\":[\"Rakshyakar\"],\"propositions\":[],\"lastnames\":[\"Giri\"],\"suffixes\":[]},{\"firstnames\":[\"Daria\"],\"propositions\":[],\"lastnames\":[\"Gusenkova\"],\"suffixes\":[]},{\"firstnames\":[\"Hermanni\"],\"propositions\":[],\"lastnames\":[\"Heimonen\"],\"suffixes\":[]},{\"firstnames\":[\"Tuukka\"],\"propositions\":[],\"lastnames\":[\"Hiltunen\"],\"suffixes\":[]},{\"firstnames\":[\"Hao\"],\"propositions\":[],\"lastnames\":[\"Hsu\"],\"suffixes\":[]},{\"firstnames\":[\"Eric\"],\"propositions\":[],\"lastnames\":[\"Hyyppä\"],\"suffixes\":[]},{\"firstnames\":[\"Joni\"],\"propositions\":[],\"lastnames\":[\"Ikonen\"],\"suffixes\":[]},{\"firstnames\":[\"Tyler\"],\"propositions\":[],\"lastnames\":[\"Jones\"],\"suffixes\":[]},{\"firstnames\":[\"Shabeeb\"],\"propositions\":[],\"lastnames\":[\"Khalid\"],\"suffixes\":[]},{\"firstnames\":[\"Seung-Goo\"],\"propositions\":[],\"lastnames\":[\"Kim\"],\"suffixes\":[]},{\"firstnames\":[\"Miikka\"],\"propositions\":[],\"lastnames\":[\"Koistinen\"],\"suffixes\":[]},{\"firstnames\":[\"Anton\"],\"propositions\":[],\"lastnames\":[\"Komlev\"],\"suffixes\":[]},{\"firstnames\":[\"Janne\"],\"propositions\":[],\"lastnames\":[\"Kotilahti\"],\"suffixes\":[]},{\"firstnames\":[\"Vladimir\"],\"propositions\":[],\"lastnames\":[\"Kukushkin\"],\"suffixes\":[]},{\"firstnames\":[\"Julia\"],\"propositions\":[],\"lastnames\":[\"Lamprich\"],\"suffixes\":[]},{\"firstnames\":[\"Alessandro\"],\"propositions\":[],\"lastnames\":[\"Landra\"],\"suffixes\":[]},{\"firstnames\":[\"Lan-Hsuan\"],\"propositions\":[],\"lastnames\":[\"Lee\"],\"suffixes\":[]},{\"firstnames\":[\"Tianyi\"],\"propositions\":[],\"lastnames\":[\"Li\"],\"suffixes\":[]},{\"firstnames\":[\"Per\"],\"propositions\":[],\"lastnames\":[\"Liebermann\"],\"suffixes\":[]},{\"firstnames\":[\"Sourav\"],\"propositions\":[],\"lastnames\":[\"Majumder\"],\"suffixes\":[]},{\"firstnames\":[\"Janne\"],\"propositions\":[],\"lastnames\":[\"Mäntylä\"],\"suffixes\":[]},{\"firstnames\":[\"Fabian\"],\"propositions\":[],\"lastnames\":[\"Marxer\"],\"suffixes\":[]},{\"firstnames\":[\"\\\\textbfArianne\"],\"propositions\":[],\"lastnames\":[\"\\\\textbfMeijer - van de Griend\"],\"suffixes\":[]},{\"firstnames\":[\"Vladimir\"],\"propositions\":[],\"lastnames\":[\"Milchakov\"],\"suffixes\":[]},{\"firstnames\":[\"Jakub\"],\"propositions\":[],\"lastnames\":[\"Mrożek\"],\"suffixes\":[]},{\"firstnames\":[\"Jayshankar\"],\"propositions\":[],\"lastnames\":[\"Nath\"],\"suffixes\":[]},{\"firstnames\":[\"Tuure\"],\"propositions\":[],\"lastnames\":[\"Orell\"],\"suffixes\":[]},{\"firstnames\":[\"Miha\"],\"propositions\":[],\"lastnames\":[\"Papič\"],\"suffixes\":[]},{\"firstnames\":[\"Matti\"],\"propositions\":[],\"lastnames\":[\"Partanen\"],\"suffixes\":[]},{\"firstnames\":[\"Alexander\"],\"propositions\":[],\"lastnames\":[\"Plyushch\"],\"suffixes\":[]},{\"firstnames\":[\"Stefan\"],\"propositions\":[],\"lastnames\":[\"Pogorzalek\"],\"suffixes\":[]},{\"firstnames\":[\"Jussi\"],\"propositions\":[],\"lastnames\":[\"Ritvas\"],\"suffixes\":[]},{\"firstnames\":[\"Pedro\",\"Figuero\"],\"propositions\":[],\"lastnames\":[\"Romero\"],\"suffixes\":[]},{\"firstnames\":[\"Ville\"],\"propositions\":[],\"lastnames\":[\"Sampo\"],\"suffixes\":[]},{\"firstnames\":[\"Marko\"],\"propositions\":[],\"lastnames\":[\"Seppälä\"],\"suffixes\":[]},{\"firstnames\":[\"Ville\"],\"propositions\":[],\"lastnames\":[\"Selinmaa\"],\"suffixes\":[]},{\"firstnames\":[\"Linus\"],\"propositions\":[],\"lastnames\":[\"Sundström\"],\"suffixes\":[]},{\"firstnames\":[\"Ivan\"],\"propositions\":[],\"lastnames\":[\"Takmakov\"],\"suffixes\":[]},{\"firstnames\":[\"Brian\"],\"propositions\":[],\"lastnames\":[\"Tarasinski\"],\"suffixes\":[]},{\"firstnames\":[\"Jani\"],\"propositions\":[],\"lastnames\":[\"Tuorila\"],\"suffixes\":[]},{\"firstnames\":[\"Olli\"],\"propositions\":[],\"lastnames\":[\"Tyrkkö\"],\"suffixes\":[]},{\"firstnames\":[\"Alpo\"],\"propositions\":[],\"lastnames\":[\"Välimaa\"],\"suffixes\":[]},{\"firstnames\":[\"Jaap\"],\"propositions\":[],\"lastnames\":[\"Wesdorp\"],\"suffixes\":[]},{\"firstnames\":[\"Ping\"],\"propositions\":[],\"lastnames\":[\"Yang\"],\"suffixes\":[]},{\"firstnames\":[\"Liuqi\"],\"propositions\":[],\"lastnames\":[\"Yu\"],\"suffixes\":[]},{\"firstnames\":[\"Johannes\"],\"propositions\":[],\"lastnames\":[\"Heinsoo\"],\"suffixes\":[]},{\"firstnames\":[\"Antti\"],\"propositions\":[],\"lastnames\":[\"Vepsäläinen\"],\"suffixes\":[]},{\"firstnames\":[\"William\"],\"propositions\":[],\"lastnames\":[\"Kindel\"],\"suffixes\":[]},{\"firstnames\":[\"Hsiang-Sheng\"],\"propositions\":[],\"lastnames\":[\"Ku\"],\"suffixes\":[]},{\"firstnames\":[\"Frank\"],\"propositions\":[],\"lastnames\":[\"Deppe\"],\"suffixes\":[]}],\"year\":\"2025\",\"eprint\":\"2503.10903\",\"archiveprefix\":\"arXiv\",\"primaryclass\":\"quant-ph\",\"url\":\"https://arxiv.org/abs/2503.10903\",\"keywords\":\"unpublished\",\"bibtex\":\"@misc{renger2025superconductingqubitresonatorquantumprocessor,\\n      title={A Superconducting Qubit-Resonator Quantum Processor with Effective All-to-All Connectivity}, \\n      author={Michael Renger and Jeroen Verjauw and Nicola Wurz and Amin Hosseinkhani and Caspar Ockeloen-Korppi and Wei Liu and Aniket Rath and Manish J. Thapa and Florian Vigneau and Elisabeth Wybo and Ville Bergholm and Chun Fai Chan and Bálint Csatári and Saga Dahl and Rakhim Davletkaliyev and Rakshyakar Giri and Daria Gusenkova and Hermanni Heimonen and Tuukka Hiltunen and Hao Hsu and Eric Hyyppä and Joni Ikonen and Tyler Jones and Shabeeb Khalid and Seung-Goo Kim and Miikka Koistinen and Anton Komlev and Janne Kotilahti and Vladimir Kukushkin and Julia Lamprich and Alessandro Landra and Lan-Hsuan Lee and Tianyi Li and Per Liebermann and Sourav Majumder and Janne Mäntylä and Fabian Marxer and \\\\textbf{Arianne} \\\\textbf{Meijer - van de Griend} and Vladimir Milchakov and Jakub Mrożek and Jayshankar Nath and Tuure Orell and Miha Papič and Matti Partanen and Alexander Plyushch and Stefan Pogorzalek and Jussi Ritvas and Pedro Figuero Romero and Ville Sampo and Marko Seppälä and Ville Selinmaa and Linus Sundström and Ivan Takmakov and Brian Tarasinski and Jani Tuorila and Olli Tyrkkö and Alpo Välimaa and Jaap Wesdorp and Ping Yang and Liuqi Yu and Johannes Heinsoo and Antti Vepsäläinen and William Kindel and Hsiang-Sheng Ku and Frank Deppe},\\n      year={2025},\\n      eprint={2503.10903},\\n      archivePrefix={arXiv},\\n      primaryClass={quant-ph},\\n      url={https://arxiv.org/abs/2503.10903}, \\n      keywords={unpublished}\\n}\",\"author_short\":[\"Renger, M.\",\"Verjauw, J.\",\"Wurz, N.\",\"Hosseinkhani, A.\",\"Ockeloen-Korppi, C.\",\"Liu, W.\",\"Rath, A.\",\"Thapa, M. J.\",\"Vigneau, F.\",\"Wybo, E.\",\"Bergholm, V.\",\"Chan, C. F.\",\"Csatári, B.\",\"Dahl, S.\",\"Davletkaliyev, R.\",\"Giri, R.\",\"Gusenkova, D.\",\"Heimonen, H.\",\"Hiltunen, T.\",\"Hsu, H.\",\"Hyyppä, E.\",\"Ikonen, J.\",\"Jones, T.\",\"Khalid, S.\",\"Kim, S.\",\"Koistinen, M.\",\"Komlev, A.\",\"Kotilahti, J.\",\"Kukushkin, V.\",\"Lamprich, J.\",\"Landra, A.\",\"Lee, L.\",\"Li, T.\",\"Liebermann, P.\",\"Majumder, S.\",\"Mäntylä, J.\",\"Marxer, F.\",\"\\\\textbfMeijer - van de Griend, \\\\.\",\"Milchakov, V.\",\"Mrożek, J.\",\"Nath, J.\",\"Orell, T.\",\"Papič, M.\",\"Partanen, M.\",\"Plyushch, A.\",\"Pogorzalek, S.\",\"Ritvas, J.\",\"Romero, P. F.\",\"Sampo, V.\",\"Seppälä, M.\",\"Selinmaa, V.\",\"Sundström, L.\",\"Takmakov, I.\",\"Tarasinski, B.\",\"Tuorila, J.\",\"Tyrkkö, O.\",\"Välimaa, A.\",\"Wesdorp, J.\",\"Yang, P.\",\"Yu, L.\",\"Heinsoo, J.\",\"Vepsäläinen, A.\",\"Kindel, W.\",\"Ku, H.\",\"Deppe, F.\"],\"key\":\"renger2025superconductingqubitresonatorquantumprocessor\",\"id\":\"renger2025superconductingqubitresonatorquantumprocessor\",\"bibbaseid\":\"renger-verjauw-wurz-hosseinkhani-ockeloenkorppi-liu-rath-thapa-etal-asuperconductingqubitresonatorquantumprocessorwitheffectivealltoallconnectivity-2025\",\"role\":\"author\",\"urls\":{\"Paper\":\"https://arxiv.org/abs/2503.10903\"},\"keyword\":[\"unpublished\"],\"metadata\":{\"authorlinks\":{}},\"html\":\"\"}],\n      metadata: {\"authorlinks\":{}},\n      ownerID: undefined\n    };\n  </script>\n\n  <script type=\"text/javascript\">\n  var site$;\n  if (typeof $ != 'undefined') {\n    console.log('existing jquery: storing and then restoring');\n    site$ = $;\n    $ = null;\n  }\n  </script>\n\n  <script src=\"https://ajax.googleapis.com/ajax/libs/jquery/2.2.4/jquery.min.js\">\n  </script>\n  <script type=\"text/javascript\">\n  if (site$) {\n    console.log('existing jquery: avoiding conflict and restoring');\n    bb$ = $.noConflict(true);\n    $ = site$;\n  } else {\n    bb$ = $;\n  }\n  </script>\n\n  <script src=\"//bibbase.org/js/bibbase.min.js\"\n          type=\"text/javascript\">\n  </script>\n\n  <script type=\"text/javascript\"\n          src=\"https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML\">\n  </script>\n  <script type=\"text/x-mathjax-config\">\n    MathJax.Hub.Config({tex2jax: {inlineMath: [['$','$'], ['\\\\(','\\\\)']]},\n                        skipTags: [\"body\"],\n                        processClass: \"bibbase_paper\"});\n  </script>\n\n  <style>\n  @media print {\n    .dontprint {\n        display: none !important;\n    }\n\n  .bibbase_group {\n    background-color: #E0E0E0;\n    font-style: italic;\n    font-size: larger;\n    text-shadow: 0px 0px 3px #FFFFFF;\n    border-radius: 4px 4px 4px 4px;\n    -moz-border-radius: 4px 4px 4px 4px;\n    -webkit-border-radius: 4px;\n    padding: 5px 40px 5px;\n    margin-top: 10px;\n    margin-bottom: 5px;\n    cursor: pointer;\n  }\n\n  .bibbase_paper {\n    margin-bottom: 5px;\n  }\n\n  }\n  </style>\n\n  \n  <div style=\"float: right; margin-right: 10px; margin-top: 10px; text-align: right; font-size: 12px\">\n    generated by\n    <a href=\"//bibbase.org\"\n       onclick=\"trackOutboundLink('bibbase', 'logo clicked', window.location.href, '//bibbase.org'); return false;\">\n      <img src=\"//bibbase.org/img/logo.svg\"\n           style=\"vertical-align: middle; margin-left: 3px; height: 16px;\"/\n           alt=\"bibbase.org\"\n           title=\"BibBase – The easiest way to maintain your publications page.\"\n        ></a>\n    \n  </div>\n  \n\n  <div id=\"bibbase_header\" class=\"dontprint\" style=\"\">\n\n    <ul class=\"nav nav-pills\" style=\"margin: 0px;\">\n\n      <li class=\"dropdown\" id=\"groupby_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\">\n          Group by\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li class=\"groupby year\"><a onclick=\"groupby('year')\">\n            Year</a>\n        </li>\n        <li class=\"groupby author\"><a onclick=\"groupby('author_short')\">\n            Author</a>\n        </li>\n        <li class=\"groupby type\"><a onclick=\"groupby('type')\">\n            Type</a>\n        </li>\n        <li class=\"groupby keyword\"><a onclick=\"groupby('keyword')\">\n            Keyword</a>\n        </li>\n        <li class=\"groupby downloads\"><a onclick=\"groupby('downloads')\">\n            Downloads</a>\n        </li>\n      </ul>\n      </li>\n\n\n      <li class=\"dropdown\" id=\"menu_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\" alt=\"controls\">\n          <i class=\"fa fa-reorder\" alt=\"controls\"></i>\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li>\n          <a onclick=\"toggleAll()\">\n            <i class=\"fa fa-chevron-down fa-fw\"></i> Expand/Collapse All\n          </a>\n        </li>\n        <li>\n          <a download=\"publications.bib\" href=\"data:text/bibtex;base64,@INPROCEEDINGS{10621734,
  author={\textbf{Arianne} \textbf{Meijer-van de Griend}},
  booktitle={2024 IEEE International Conference on Software Analysis, Evolution and Reengineering - Companion (SANER-C)}, 
  title={The Quantum Circuit Model is not a Practical Representation of Quantum Software}, 
  year={2024},
  volume={},
  number={},
  pages={146-148},
  keywords={Codes;Computational modeling;Debugging;Programming;Software;Hardware;Mathematical models;quantum computing;quantum circuit model;quantum software, published},
  doi={10.1109/SANER-C62648.2024.00025}}



@online{AIThesis,
Author = {\textbf{Arianne} \textbf{Meijer-van de Griend}},
Title = {Constrained quantum CNOT circuit re-synthesis using deep reinforcement learning},
Year = {2019},
Eprint = {RG.2.2.11886.77125},
Eprinttype = {ResearchGate},
note = {Master thesis Artificial Intelligence},
url_Paper = {https://www.researchgate.net/publication/335977643_Constrained_quantum_CNOT_circuit_re-synthesis_using_deep_reinforcement_learning},
abstract = {In this master thesis, we describe a novel approach to constrained CNOT circuit resynthesis as a first step towards neural constrained quantum circuit re-synthesis. We train a neural network to do constrained Gaussian elimination from a parity matrix using deep reinforcement learning. The CNOT circuit is transformed into a parity matrix from which an equivalent CNOT circuit is synthesized such that all CNOT gates adhere to the connectivity constraints provided by the quantum computer architecture. For our n-step deep Q learning approach, we have used an asynchronous dueling neural network with three different action selection policies: ϵ-greedy, softmax and a novel oracle selection policy. To train this neural network, we have proposed a novel phased training procedure that guides the training process from trivial problems to arbitrary ones while simulating. Although we were only able to successfully train an agent for trivial quantum computer connectivity constraints, the 2 and 3 qubit coupling graphs. We did show that those agents were able to perform similar to the genetic Steiner baseline and could even improve on them. We also investigated the effect of coupling graph sizes and connectivity on network performance and training time. Lastly, we show that transfer learning can result in an improved network, but it takes longer to train. This is a very promising start of a new research field that could result in a universal quantum circuit optimization and mapping algorithm that is robust to both expected and unexpected future changes in quantum computer architectures.},
keywords = {unpublished}
}



@article{1904.00633,
Author = {Kissinger, Aleks and \textbf{Arianne} \textbf{Meijer-van de Griend}},
Title = {CNOT circuit extraction for topologically-constrained quantum memories},
journal={Quantum Information and Computation},
volume={20},
number={7\&8},
pages={581--596},
year={2020},
doi={10.26421/QIC20.7-8-4},
note = {Also presented at QPL 2019, Chapman University (Orange, USA)},
url_Paper = {http://www.rintonpress.com/xxqic20/qic-20-78/0581-0596.pdf},
abstract = {Many physical implementations of quantum computers impose stringent
memory constraints in which 2-qubit operations can only be performed between
qubits which are nearest neighbours in a lattice or graph structure. Hence, before
a computation can be run on such a device, it must be mapped onto the physical
architecture. That is, logical qubits must be assigned physical locations in the
quantum memory, and the circuit must be replaced by an equivalent one containing
only operations between nearest neighbours. In this paper, we give a new technique
for quantum circuit mapping (a.k.a. routing), based on Gaussian elimination
constrained to certain optimal spanning trees called Steiner trees. We give a reference
implementation of the technique for CNOT circuits and show that it significantly outperforms general-purpose routines on CNOT circuits. We then comment on how the
technique can be extended straightforwardly to the synthesis of CNOT+Rz circuits and
as a modification to a recently-proposed circuit simplification/extraction procedure for
generic circuits based on the ZX-calculus.
},
keywords = {published}
}



@online{CSThesis,
Author = {\textbf{Arianne} \textbf{van de Griend}},
Title = {Natural language generation for commercial applications},
Year = {2018},
Eprint = {RG.2.2.21953.10087},
Eprinttype = {ResearchGate},
note = {Master thesis Computing Science},
url_Paper = {https://www.researchgate.net/publication/335977746_Natural_language_generation_for_commercial_applications},
abstract = {This master thesis gives an overview on natural language generation with the focus of dialogue systems for commercial use. 
We give a description of the general approach to natural language generation and their neural architectures first.
Then three application domains are discussed in more detail: language style transfer, dialogue response generation and controlling dialogue response generation. 
For each domain, a use case was implemented and the results are discussed. We investigated automatic customer support, an empathetic automatic customer support and sentiment adjustment of reviews.
We show promising results for the first two use cases, but the last use case was inconclusive due to difficulties with implementation. 
We finish with a short discussion of the use of natural language generation in commercial applications and what can be improved in our current model architectures.},
keywords = {unpublished}
}



@article{2004.06052,
   title={Architecture-Aware Synthesis of Phase Polynomials for NISQ Devices},
   volume={394},
   DOI={10.4204/eptcs.394.8},
   journal={Electronic Proceedings in Theoretical Computer Science},
   publisher={Open Publishing Association},
   author={\textbf{Arianne} \textbf{Meijer-van de Griend} and Duncan, Ross},
   year={2023},
   month=nov, 
   pages={116-140} ,
  note={In Proceedings QPL 2022, arXiv:2311.08375. This paper was originally accepted as Submission 38 in QPL2020, but was not included in the proceedings because of a clerical error.},
  url_Paper = {https://arxiv.org/pdf/2004.06052.pdf},
  url_Link = {https://www.youtube.com/watch?v=uOAA0nbh9MI},
  abstract = {We propose a new algorithm to synthesise quantum circuits for phase polynomials, which takes
  into account the qubit connectivity of the quantum computer. We focus on the architectures
  of currently available NISQ devices. Our algorithm generates circuits with a smaller CNOT
  depth than the algorithms currently used in Staq and t|ket>, while improving the runtime
  with respect the former.},
keywords = {published}
}



@article{quantmark,
  author={\textbf{Adriana} \textbf{Meijer-van de Griend} and Nurminen, Jukka K},
  journal={IEEE Transactions on Quantum Engineering}, 
  title={QuantMark: A benchmarking API for comparing VQE algorithms}, 
  year={2022},
  volume={},
  number={},
  pages={1-1},
  doi={10.1109/TQE.2022.3159327},
  url_Paper={https://ieeexplore.ieee.org/document/9735298},
  abstract = {Thanks to the rise of quantum computers, many variations of the variational quantum eigensolver (VQE) have been proposed in recent times. This is a promising development for real quantum algorithms, as the VQE is a promising algorithm that runs on current quantum hardware. However, the popular method of comparing your algorithm versus a classical baseline in a small basis set is not meaningful in the big picture. Moreover, many papers use a different molecular representation or a different quantum computer to test their algorithms such that the used baselines are different between different papers. Thus, it is almost impossible to compare the different algorithms to each other. As a solution, we have built a benchmarking framework to standardize the VQE performance metrics, such that they can be analyzed more easily. Using our framework, any researcher working on the VQE can easily test their own algorithms against previous ones on the leaderboard without the need to reproduce previous work themselves.},
keywords = {published}}



@InProceedings{equi2021bit,
  author =	{Equi, Massimo and \textbf{Arianne} \textbf{Meijer-van de Griend} and M\"{a}kinen, Veli},
  title =	{{From Bit-Parallelism to Quantum String Matching for Labelled Graphs}},
  booktitle =	{34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023)},
  pages =	{9:1--9:20},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-276-1},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{259},
  editor =	{Bulteau, Laurent and Lipt\'{a}k, Zsuzsanna},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2023.9},
  URN =		{urn:nbn:de:0030-drops-179637},
  doi =		{10.4230/LIPIcs.CPM.2023.9},
  annote =	{Keywords: Bit-parallelism, quantum computation, string matching, level DAGs},
    keywords = {published}
}



@article{2205.00724,
   title={Dynamic Qubit Routing with CNOT Circuit Synthesis for Quantum Compilation},
   volume={394},
   DOI={10.4204/eptcs.394.18},
   journal={Electronic Proceedings in Theoretical Computer Science},
   publisher={Open Publishing Association},
   author={\textbf{Arianne} \textbf{Meijer-van de Griend} and Li, Sarah Meng},
   year={2023},
   month=nov, pages={363-399},
  url_Paper = {https://arxiv.org/pdf/2205.00724.pdf},
  abstract = {Many quantum computers have constraints regarding which two-qubit operations are locally allowed. To run a quantum circuit under those constraints, qubits need to be allocated to different quantum registers, and multi-qubit gates need to be routed accordingly. Recent developments have shown that Steiner-tree based compiling strategies provide a competitive tool to route CNOT gates. However, these algorithms require the qubit allocation to be decided before routing. Moreover, the allocation is fixed throughout the computation, i.e. the logical qubit will not move to a different qubit register. This is inefficient with respect to the CNOT count of the resulting circuit. In this paper, we propose the algorithm PermRowCol for routing CNOTs in a quantum circuit. It dynamically reallocates logical qubits during the computation, and thus results in fewer output CNOTs than the algorithms Steiner-Gauss[11] and RowCol [23]. Here we focus on circuits over CNOT only, but this method could be generalized to a routing and allocation strategy on Clifford+T circuits by slicing the quantum circuit into subcircuits composed of CNOTs and single-qubit gates. Additionally, PermRowCol can be used in place of Steiner-Gauss in the synthesis of phase polynomials as well as the extraction of quantum circuits from ZX-diagrams.},
keywords = {published}
}




@article{meijer2023towards,
  title={A comparison of quantum compilers using a DAG-based or phase polynomial-based intermediate representation},
  author={\textbf{Meijer-van de Griend}, \textbf{Arianne}},
  journal={Journal of Systems and Software},
  volume={221},
  pages={112224},
  year={2025},
  publisher={Elsevier},
  keywords = {published},
}



@article{PhDThesis,
  title={Advances in Quantum Compilation in the NISQ Era},
  author={\textbf{Arianne} \textbf{Meijer-van de Griend}},
  year={2024},
  publisher={Helsingin yliopisto},
  url_Paper={http://urn.fi/URN:ISBN:978-952-84-0077-6},
  keywords = {published},
  abstract = {Recent advances in the development of quantum technology have made it possible to run small quantum programs on real quantum computers. This has created a need for compiling methods specific to these quantum computers. Unlike classical computers, if a quantum computation takes too long, the qubits might decohere and lose their information, making the computation useless. Hence, well-optimized quantum programs are a necessity.

Like classical computers, quantum computers have registers for qubits that are generally sparsely connected. However, classical compilation methods that rely on copying data from one register to another do not apply to quantum computers because qubits cannot be copied. This problem is called the qubit routing problem. Following classical compilation, one could solve the connectivity constraints by moving the qubits to adjacent qubit registers. However, this requires the addition of SWAP gates throughout the quantum circuit, resulting in a strictly longer program. Additionally, a SWAP gate on qubits is not cheap and requires three CNOT gates each.

Instead, in this thesis, we have defined a new method for quantum compilation that is based in the quantum nature of the program to be compiled. Instead of routing the qubits directly, we generate new machine code (in the form of quantum circuits) from an intermediate representation. We call this process quantum circuit synthesis. During synthesis, we make sure that all generated gates are supported by the target quantum hardware. Additionally, if the synthesis process is optimal, the resulting quantum circuit will also be optimal, although the methods proposed in this thesis are all heuristic in nature due to the computational complexity of optimal architecture-aware synthesis.

We construct the nested intermediate representation starting from sequences of CNOT circuits interleaved with single qubit gates and incrementally generalize the intermediate representation to a universal representation. In particular, we propose two algorithms for synthesizing CNOT circuits from their parity matrix representation and one algorithm for synthesizing phase polynomials (i.e. CNOT+$R_Z$ circuits). Additionally, we show that when combining these methods into the universal representation called Mixed ZX-phase polynomial, it is competitive with existing commercial quantum compilers IBM's Qiskit and Quantinuum's TKET for large circuits.

This thesis additionally contains a proposal for a framework to benchmark the quality of circuits used in an algorithm called Variational Quantum Eigensolver (VQE). This framework attempts to measure how close the solution found by the VQE is to our best estimate of a real molecule (i.e. accuracy), rather than a classical simulation of the approximate molecule as given to the quantum computer (i.e. precision).},
}



@inproceedings{stirbu2024exposinghiddenlayersinterplay,
  title={Exposing the hidden layers and interplay in the quantum software stack},
  author={Stirbu, Vlad and \textbf{Meijer-van de Griend}, \textbf{Arianne} and Muff, Jake},
  booktitle={2024 IEEE 21st International Conference on Software Architecture Companion (ICSA-C)},
  pages={24--25},
  year={2024},
  organization={IEEE},
  keywords = {published},
}



@article{winderl2023architectureawaresynthesisstabilizercircuits,
      title={Architecture-Aware Synthesis of Stabilizer Circuits from Clifford Tableaus}, 
      author={David Winderl and Qunsheng Huang and \textbf{Arianne} \textbf{Meijer-van de Griend} and Richie Yeung},
      year={2023},
      eprint={2309.08972},
      archivePrefix={arXiv},
      primaryClass={quant-ph},
      url={https://arxiv.org/abs/2309.08972}, 
      keywords = {submitted},
      abstract = {Since quantum computing is currently in the NISQ-Era, compilation strategies to reduce the number of gates executed on specific hardware are required. In this work, we utilize the concept of synthesis of a data structure called Clifford tableaus, focusing on applying CNOTs within the respective connectivity graph of the quantum device. We hence contribute to the field of compilation or, more precisely, synthesis by reducing the number of CNOTs in the synthesized quantum circuit. Upon convergence, our method shows to outperform other state-of-the-art synthesis techniques, when executed with respect to a specific hardware. Upon executing the resulting circuits on real hardware, our synthesized circuits tend to increase the final fidelity and reduce the overall execution times.},
}




@misc{abdurakhimov2024technologyperformancebenchmarksiqms,
keywords={preprint},
      title={Technology and Performance Benchmarks of IQM's 20-Qubit Quantum Computer}, 
      author={Leonid Abdurakhimov and Janos Adam and Hasnain Ahmad and Olli Ahonen and Manuel Algaba and Guillermo Alonso and Ville Bergholm and Rohit Beriwal and Matthias Beuerle and Clinton Bockstiegel and Alessio Calzona and Chun Fai Chan and Daniele Cucurachi and Saga Dahl and Rakhim Davletkaliyev and Olexiy Fedorets and Alejandro Gomez Frieiro and Zheming Gao and Johan Guldmyr and Andrew Guthrie and Juha Hassel and Hermanni Heimonen and Johannes Heinsoo and Tuukka Hiltunen and Keiran Holland and Juho Hotari and Hao Hsu and Antti Huhtala and Eric Hyyppä and Aleksi Hämäläinen and Joni Ikonen and Sinan Inel and David Janzso and Teemu Jaakkola and Mate Jenei and Shan Jolin and Kristinn Juliusson and Jaakko Jussila and Shabeeb Khalid and Seung-Goo Kim and Miikka Koistinen and Roope Kokkoniemi and Anton Komlev and Caspar Ockeloen-Korppi and Otto Koskinen and Janne Kotilahti and Toivo Kuisma and Vladimir Kukushkin and Kari Kumpulainen and Ilari Kuronen and Joonas Kylmälä and Niclas Lamponen and Julia Lamprich and Alessandro Landra and Martin Leib and Tianyi Li and Per Liebermann and Aleksi Lintunen and Wei Liu and Jürgen Luus and Fabian Marxer and \textbf{Arianne} \textbf{Meijer-van de Griend} and Kunal Mitra and Jalil Khatibi Moqadam and Jakub Mrożek and Henrikki Mäkynen and Janne Mäntylä and Tiina Naaranoja and Francesco Nappi and Janne Niemi and Lucas Ortega and Mario Palma and Miha Papič and Matti Partanen and Jari Penttilä and Alexander Plyushch and Wei Qiu and Aniket Rath and Kari Repo and Tomi Riipinen and Jussi Ritvas and Pedro Figueroa Romero and Jarkko Ruoho and Jukka Räbinä and Sampo Saarinen and Indrajeet Sagar and Hayk Sargsyan and Matthew Sarsby and Niko Savola and Mykhailo Savytskyi and Ville Selinmaa and Pavel Smirnov and Marco Marín Suárez and Linus Sundström and Sandra Słupińska and Eelis Takala and Ivan Takmakov and Brian Tarasinski and Manish Thapa and Jukka Tiainen and Francesca Tosto and Jani Tuorila and Carlos Valenzuela and David Vasey and Edwin Vehmaanperä and Antti Vepsäläinen and Aapo Vienamo and Panu Vesanen and Alpo Välimaa and Jaap Wesdorp and Nicola Wurz and Elisabeth Wybo and Lily Yang and Ali Yurtalan},
      year={2024},
      eprint={2408.12433},
      archivePrefix={arXiv},
      primaryClass={quant-ph},
      url={https://arxiv.org/abs/2408.12433}, 
}



@inproceedings{huang2024redefining,
  title={Redefining lexicographical ordering: Optimizing pauli string decompositions for quantum compiling},
  author={Huang, Qunsheng and Winderl, David and \textbf{Meijer-van de Griend}, \textbf{Arianne} and Yeung, Richie},
  booktitle={2024 IEEE International Conference on Quantum Computing and Engineering (QCE)},
  volume={1},
  pages={885--896},
  year={2024},
  organization={IEEE},
  keywords = {published}
}



@misc{renger2025superconductingqubitresonatorquantumprocessor,
      title={A Superconducting Qubit-Resonator Quantum Processor with Effective All-to-All Connectivity}, 
      author={Michael Renger and Jeroen Verjauw and Nicola Wurz and Amin Hosseinkhani and Caspar Ockeloen-Korppi and Wei Liu and Aniket Rath and Manish J. Thapa and Florian Vigneau and Elisabeth Wybo and Ville Bergholm and Chun Fai Chan and Bálint Csatári and Saga Dahl and Rakhim Davletkaliyev and Rakshyakar Giri and Daria Gusenkova and Hermanni Heimonen and Tuukka Hiltunen and Hao Hsu and Eric Hyyppä and Joni Ikonen and Tyler Jones and Shabeeb Khalid and Seung-Goo Kim and Miikka Koistinen and Anton Komlev and Janne Kotilahti and Vladimir Kukushkin and Julia Lamprich and Alessandro Landra and Lan-Hsuan Lee and Tianyi Li and Per Liebermann and Sourav Majumder and Janne Mäntylä and Fabian Marxer and \textbf{Arianne} \textbf{Meijer - van de Griend} and Vladimir Milchakov and Jakub Mrożek and Jayshankar Nath and Tuure Orell and Miha Papič and Matti Partanen and Alexander Plyushch and Stefan Pogorzalek and Jussi Ritvas and Pedro Figuero Romero and Ville Sampo and Marko Seppälä and Ville Selinmaa and Linus Sundström and Ivan Takmakov and Brian Tarasinski and Jani Tuorila and Olli Tyrkkö and Alpo Välimaa and Jaap Wesdorp and Ping Yang and Liuqi Yu and Johannes Heinsoo and Antti Vepsäläinen and William Kindel and Hsiang-Sheng Ku and Frank Deppe},
      year={2025},
      eprint={2503.10903},
      archivePrefix={arXiv},
      primaryClass={quant-ph},
      url={https://arxiv.org/abs/2503.10903}, 
      keywords={unpublished}
}\">\n            <i class=\"fa fa-download fa-fw\"></i> Download BibTeX\n          </a>\n        </li>\n        <li>\n          <a href=\"//bibbase.org/rss?bib=https://raw.githubusercontent.com/Aerylia/aerylia.github.io/master/publications.bib\">\n            <i class=\"fa fa-rss fa-fw\"></i> RSS Feed\n          </a>\n          </li>\n      </ul>\n      </li>\n\n      \n\n\n      \n    </ul>\n\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_embed\"\n         style=\"display: none;\">\n\n      Excellent! Next you can\n      <a href=\"/network/register?next=/network/newSiteFromTemplate%3Fbiburl=https://raw.githubusercontent.com/Aerylia/aerylia.github.io/master/publications.bib\"\n      >create a new website with this list</a>, or\n      embed it in an existing web page by copying &amp; pasting\n      any of the following snippets.\n\n      <div style=\"text-align: left; margin-top: 1em;\">\n        <strong>JavaScript</strong>\n        <span class=\"comment recommended\">(easiest)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fraw.githubusercontent.com%2FAerylia%2Faerylia.github.io%2Fmaster%2Fpublications.bib&amp;jsonp=1&amp;jsonp=1\"&gt;&lt;/script&gt;\n          </code>\n        </div>\n\n        <strong>PHP</strong>\n        <div class=\"well well-small\">\n          <code>\n            &lt;?php\n            $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fraw.githubusercontent.com%2FAerylia%2Faerylia.github.io%2Fmaster%2Fpublications.bib&amp;jsonp=1\");\n            print_r($contents);\n            ?&gt;\n          </code>\n        </div>\n\n        <strong>iFrame</strong>\n        <span class=\"comment\">(not recommended)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fraw.githubusercontent.com%2FAerylia%2Faerylia.github.io%2Fmaster%2Fpublications.bib&amp;jsonp=1\"&gt;&lt;/iframe&gt;\n          </code>\n        </div>\n\n        <p>\n          For more details see the <a href=\"//bibbase.org/help\">documention</a>.\n        </p>\n      </div>\n    </div>\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_preview\"\n         style=\"display: none;\">\n\n      This is a preview! To use this list on your own web site\n      or create a new web site from it,\n      <a href=\"/network/register?next=/network/newAccountWithFile%3FfileId=\"\n      >create a free account</a>. The file will be added\n      and you will be able to edit it in the File Manager.\n      We will show you instructions once you've created your account.\n    </div>\n\n    <div class=\"alert alert-warning bibbase_msg\" id=\"bibbase_msg_mendeley1\"\n         style=\"display: none;\">\n\n      <p>To the site owner:</p>\n\n      <p><strong>Action required!</strong> Mendeley is changing its\n        API. In order to keep using Mendeley with BibBase past April\n        14th, you need to:\n        <ol>\n          <li>renew the authorization for BibBase on Mendeley, and</li>\n          <li>update the BibBase URL\n            in your page the same way you did when you initially set up\n            this page.\n          </li>\n        </ol>\n      </p>\n\n      <p>\n        <a href=\"http://bibbase.org/cgi-bin/mendeley2/get.py\">\n          <i class=\"fa fa-angle-double-right\"></i>\n          Fix it now</a>\n      </p>\n    </div>\n\n  </div>\n\n\n  <div id=\"bibbase_body\">\n    \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2025\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2025')\"\n      onkeypress=\"toggleGroup('group_2025')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2025</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"textbfmeijervandegriend-acomparisonofquantumcompilersusingadagbasedorphasepolynomialbasedintermediaterepresentation-2025\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A comparison of quantum compilers using a DAG-based or phase polynomial-based intermediate representation.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  \\textbfMeijer-van de Griend, \\.\n</span>\n\n  \n\n</span>\n\n  <i>Journal of Systems and Software</i>, 221: 112224.  2025.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/textbfmeijervandegriend-acomparisonofquantumcompilersusingadagbasedorphasepolynomialbasedintermediaterepresentation-2025\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('textbfmeijervandegriend-acomparisonofquantumcompilersusingadagbasedorphasepolynomialbasedintermediaterepresentation-2025')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{meijer2023towards,\n  title={A comparison of quantum compilers using a DAG-based or phase polynomial-based intermediate representation},\n  author={\\textbf{Meijer-van de Griend}, \\textbf{Arianne}},\n  journal={Journal of Systems and Software},\n  volume={221},\n  pages={112224},\n  year={2025},\n  publisher={Elsevier},\n  keywords = {published},\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"renger-verjauw-wurz-hosseinkhani-ockeloenkorppi-liu-rath-thapa-etal-asuperconductingqubitresonatorquantumprocessorwitheffectivealltoallconnectivity-2025\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://arxiv.org/abs/2503.10903\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'renger-verjauw-wurz-hosseinkhani-ockeloenkorppi-liu-rath-thapa-etal-asuperconductingqubitresonatorquantumprocessorwitheffectivealltoallconnectivity-2025', 'https://arxiv.org/abs/2503.10903', event);\">\n    A Superconducting Qubit-Resonator Quantum Processor with Effective All-to-All Connectivity.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Renger, M.; Verjauw, J.; Wurz, N.; Hosseinkhani, A.; Ockeloen-Korppi, C.; Liu, W.; Rath, A.; Thapa, M. J.; Vigneau, F.; Wybo, E.; Bergholm, V.; Chan, C. F.; Csatári, B.; Dahl, S.; Davletkaliyev, R.; Giri, R.; Gusenkova, D.; Heimonen, H.; Hiltunen, T.; Hsu, H.; Hyyppä, E.; Ikonen, J.; Jones, T.; Khalid, S.; Kim, S.; Koistinen, M.; Komlev, A.; Kotilahti, J.; Kukushkin, V.; Lamprich, J.; Landra, A.; Lee, L.; Li, T.; Liebermann, P.; Majumder, S.; Mäntylä, J.; Marxer, F.; \\textbfMeijer - van de Griend, \\.; Milchakov, V.; Mrożek, J.; Nath, J.; Orell, T.; Papič, M.; Partanen, M.; Plyushch, A.; Pogorzalek, S.; Ritvas, J.; Romero, P. F.; Sampo, V.; Seppälä, M.; Selinmaa, V.; Sundström, L.; Takmakov, I.; Tarasinski, B.; Tuorila, J.; Tyrkkö, O.; Välimaa, A.; Wesdorp, J.; Yang, P.; Yu, L.; Heinsoo, J.; Vepsäläinen, A.; Kindel, W.; Ku, H.;  and Deppe, F.\n</span>\n\n  \n\n</span>\n\n   2025.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://arxiv.org/abs/2503.10903\"\n     onclick=\"log_download('renger-verjauw-wurz-hosseinkhani-ockeloenkorppi-liu-rath-thapa-etal-asuperconductingqubitresonatorquantumprocessorwitheffectivealltoallconnectivity-2025', 'https://arxiv.org/abs/2503.10903', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"A Superconducting Qubit-Resonator Quantum Processor with Effective All-to-All Connectivity [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/renger-verjauw-wurz-hosseinkhani-ockeloenkorppi-liu-rath-thapa-etal-asuperconductingqubitresonatorquantumprocessorwitheffectivealltoallconnectivity-2025\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('renger-verjauw-wurz-hosseinkhani-ockeloenkorppi-liu-rath-thapa-etal-asuperconductingqubitresonatorquantumprocessorwitheffectivealltoallconnectivity-2025')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@misc{renger2025superconductingqubitresonatorquantumprocessor,\n      title={A Superconducting Qubit-Resonator Quantum Processor with Effective All-to-All Connectivity}, \n      author={Michael Renger and Jeroen Verjauw and Nicola Wurz and Amin Hosseinkhani and Caspar Ockeloen-Korppi and Wei Liu and Aniket Rath and Manish J. Thapa and Florian Vigneau and Elisabeth Wybo and Ville Bergholm and Chun Fai Chan and Bálint Csatári and Saga Dahl and Rakhim Davletkaliyev and Rakshyakar Giri and Daria Gusenkova and Hermanni Heimonen and Tuukka Hiltunen and Hao Hsu and Eric Hyyppä and Joni Ikonen and Tyler Jones and Shabeeb Khalid and Seung-Goo Kim and Miikka Koistinen and Anton Komlev and Janne Kotilahti and Vladimir Kukushkin and Julia Lamprich and Alessandro Landra and Lan-Hsuan Lee and Tianyi Li and Per Liebermann and Sourav Majumder and Janne Mäntylä and Fabian Marxer and \\textbf{Arianne} \\textbf{Meijer - van de Griend} and Vladimir Milchakov and Jakub Mrożek and Jayshankar Nath and Tuure Orell and Miha Papič and Matti Partanen and Alexander Plyushch and Stefan Pogorzalek and Jussi Ritvas and Pedro Figuero Romero and Ville Sampo and Marko Seppälä and Ville Selinmaa and Linus Sundström and Ivan Takmakov and Brian Tarasinski and Jani Tuorila and Olli Tyrkkö and Alpo Välimaa and Jaap Wesdorp and Ping Yang and Liuqi Yu and Johannes Heinsoo and Antti Vepsäläinen and William Kindel and Hsiang-Sheng Ku and Frank Deppe},\n      year={2025},\n      eprint={2503.10903},\n      archivePrefix={arXiv},\n      primaryClass={quant-ph},\n      url={https://arxiv.org/abs/2503.10903}, \n      keywords={unpublished}\n}</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2024\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2024')\"\n      onkeypress=\"toggleGroup('group_2024')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2024</span>\n      <span class=\"bibbase_group_count\">\n        \n        (5)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"textbfmeijervandegriend-thequantumcircuitmodelisnotapracticalrepresentationofquantumsoftware-2024\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  The Quantum Circuit Model is not a Practical Representation of Quantum Software.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  \\textbfMeijer-van de Griend, \\.\n</span>\n\n  \n\n</span>\n\n  In <i>2024 IEEE International Conference on Software Analysis, Evolution and Reengineering - Companion (SANER-C)</i>, pages 146-148,  2024. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/SANER-C62648.2024.00025\"\n     onclick=\"log_download('textbfmeijervandegriend-thequantumcircuitmodelisnotapracticalrepresentationofquantumsoftware-2024', 'http://doi.org/10.1109/SANER-C62648.2024.00025', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/textbfmeijervandegriend-thequantumcircuitmodelisnotapracticalrepresentationofquantumsoftware-2024\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('textbfmeijervandegriend-thequantumcircuitmodelisnotapracticalrepresentationofquantumsoftware-2024')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@INPROCEEDINGS{10621734,\n  author={\\textbf{Arianne} \\textbf{Meijer-van de Griend}},\n  booktitle={2024 IEEE International Conference on Software Analysis, Evolution and Reengineering - Companion (SANER-C)}, \n  title={The Quantum Circuit Model is not a Practical Representation of Quantum Software}, \n  year={2024},\n  volume={},\n  number={},\n  pages={146-148},\n  keywords={Codes;Computational modeling;Debugging;Programming;Software;Hardware;Mathematical models;quantum computing;quantum circuit model;quantum software, published},\n  doi={10.1109/SANER-C62648.2024.00025}}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"textbfmeijervandegriend-advancesinquantumcompilationinthenisqera-2024\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://urn.fi/URN:ISBN:978-952-84-0077-6\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'textbfmeijervandegriend-advancesinquantumcompilationinthenisqera-2024', 'http://urn.fi/URN:ISBN:978-952-84-0077-6', event);\">\n    Advances in Quantum Compilation in the NISQ Era.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  \\textbfMeijer-van de Griend, \\.\n</span>\n\n  \n\n</span>\n\n  .  2024.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://urn.fi/URN:ISBN:978-952-84-0077-6\"\n     onclick=\"log_download('textbfmeijervandegriend-advancesinquantumcompilationinthenisqera-2024', 'http://urn.fi/URN:ISBN:978-952-84-0077-6', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Advances in Quantum Compilation in the NISQ Era [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/textbfmeijervandegriend-advancesinquantumcompilationinthenisqera-2024\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('textbfmeijervandegriend-advancesinquantumcompilationinthenisqera-2024')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{PhDThesis,\n  title={Advances in Quantum Compilation in the NISQ Era},\n  author={\\textbf{Arianne} \\textbf{Meijer-van de Griend}},\n  year={2024},\n  publisher={Helsingin yliopisto},\n  url_Paper={http://urn.fi/URN:ISBN:978-952-84-0077-6},\n  keywords = {published},\n  abstract = {Recent advances in the development of quantum technology have made it possible to run small quantum programs on real quantum computers. This has created a need for compiling methods specific to these quantum computers. Unlike classical computers, if a quantum computation takes too long, the qubits might decohere and lose their information, making the computation useless. Hence, well-optimized quantum programs are a necessity.\n\nLike classical computers, quantum computers have registers for qubits that are generally sparsely connected. However, classical compilation methods that rely on copying data from one register to another do not apply to quantum computers because qubits cannot be copied. This problem is called the qubit routing problem. Following classical compilation, one could solve the connectivity constraints by moving the qubits to adjacent qubit registers. However, this requires the addition of SWAP gates throughout the quantum circuit, resulting in a strictly longer program. Additionally, a SWAP gate on qubits is not cheap and requires three CNOT gates each.\n\nInstead, in this thesis, we have defined a new method for quantum compilation that is based in the quantum nature of the program to be compiled. Instead of routing the qubits directly, we generate new machine code (in the form of quantum circuits) from an intermediate representation. We call this process quantum circuit synthesis. During synthesis, we make sure that all generated gates are supported by the target quantum hardware. Additionally, if the synthesis process is optimal, the resulting quantum circuit will also be optimal, although the methods proposed in this thesis are all heuristic in nature due to the computational complexity of optimal architecture-aware synthesis.\n\nWe construct the nested intermediate representation starting from sequences of CNOT circuits interleaved with single qubit gates and incrementally generalize the intermediate representation to a universal representation. In particular, we propose two algorithms for synthesizing CNOT circuits from their parity matrix representation and one algorithm for synthesizing phase polynomials (i.e. CNOT+$R_Z$ circuits). Additionally, we show that when combining these methods into the universal representation called Mixed ZX-phase polynomial, it is competitive with existing commercial quantum compilers IBM&#x27;s Qiskit and Quantinuum&#x27;s TKET for large circuits.\n\nThis thesis additionally contains a proposal for a framework to benchmark the quality of circuits used in an algorithm called Variational Quantum Eigensolver (VQE). This framework attempts to measure how close the solution found by the VQE is to our best estimate of a real molecule (i.e. accuracy), rather than a classical simulation of the approximate molecule as given to the quantum computer (i.e. precision).},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Recent advances in the development of quantum technology have made it possible to run small quantum programs on real quantum computers. This has created a need for compiling methods specific to these quantum computers. Unlike classical computers, if a quantum computation takes too long, the qubits might decohere and lose their information, making the computation useless. Hence, well-optimized quantum programs are a necessity. Like classical computers, quantum computers have registers for qubits that are generally sparsely connected. However, classical compilation methods that rely on copying data from one register to another do not apply to quantum computers because qubits cannot be copied. This problem is called the qubit routing problem. Following classical compilation, one could solve the connectivity constraints by moving the qubits to adjacent qubit registers. However, this requires the addition of SWAP gates throughout the quantum circuit, resulting in a strictly longer program. Additionally, a SWAP gate on qubits is not cheap and requires three CNOT gates each. Instead, in this thesis, we have defined a new method for quantum compilation that is based in the quantum nature of the program to be compiled. Instead of routing the qubits directly, we generate new machine code (in the form of quantum circuits) from an intermediate representation. We call this process quantum circuit synthesis. During synthesis, we make sure that all generated gates are supported by the target quantum hardware. Additionally, if the synthesis process is optimal, the resulting quantum circuit will also be optimal, although the methods proposed in this thesis are all heuristic in nature due to the computational complexity of optimal architecture-aware synthesis. We construct the nested intermediate representation starting from sequences of CNOT circuits interleaved with single qubit gates and incrementally generalize the intermediate representation to a universal representation. In particular, we propose two algorithms for synthesizing CNOT circuits from their parity matrix representation and one algorithm for synthesizing phase polynomials (i.e. CNOT+$R_Z$ circuits). Additionally, we show that when combining these methods into the universal representation called Mixed ZX-phase polynomial, it is competitive with existing commercial quantum compilers IBM's Qiskit and Quantinuum's TKET for large circuits. This thesis additionally contains a proposal for a framework to benchmark the quality of circuits used in an algorithm called Variational Quantum Eigensolver (VQE). This framework attempts to measure how close the solution found by the VQE is to our best estimate of a real molecule (i.e. accuracy), rather than a classical simulation of the approximate molecule as given to the quantum computer (i.e. precision).\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"stirbu-textbfmeijervandegriend-muff-exposingthehiddenlayersandinterplayinthequantumsoftwarestack-2024\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Exposing the hidden layers and interplay in the quantum software stack.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Stirbu, V.; \\textbfMeijer-van de Griend, \\.;  and Muff, J.\n</span>\n\n  \n\n</span>\n\n  In <i>2024 IEEE 21st International Conference on Software Architecture Companion (ICSA-C)</i>, pages 24–25,  2024. IEEE\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/stirbu-textbfmeijervandegriend-muff-exposingthehiddenlayersandinterplayinthequantumsoftwarestack-2024\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('stirbu-textbfmeijervandegriend-muff-exposingthehiddenlayersandinterplayinthequantumsoftwarestack-2024')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{stirbu2024exposinghiddenlayersinterplay,\n  title={Exposing the hidden layers and interplay in the quantum software stack},\n  author={Stirbu, Vlad and \\textbf{Meijer-van de Griend}, \\textbf{Arianne} and Muff, Jake},\n  booktitle={2024 IEEE 21st International Conference on Software Architecture Companion (ICSA-C)},\n  pages={24--25},\n  year={2024},\n  organization={IEEE},\n  keywords = {published},\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"abdurakhimov-adam-ahmad-ahonen-algaba-alonso-bergholm-beriwal-etal-technologyandperformancebenchmarksofiqms20qubitquantumcomputer-2024\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://arxiv.org/abs/2408.12433\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'abdurakhimov-adam-ahmad-ahonen-algaba-alonso-bergholm-beriwal-etal-technologyandperformancebenchmarksofiqms20qubitquantumcomputer-2024', 'https://arxiv.org/abs/2408.12433', event);\">\n    Technology and Performance Benchmarks of IQM's 20-Qubit Quantum Computer.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Abdurakhimov, L.; Adam, J.; Ahmad, H.; Ahonen, O.; Algaba, M.; Alonso, G.; Bergholm, V.; Beriwal, R.; Beuerle, M.; Bockstiegel, C.; Calzona, A.; Chan, C. F.; Cucurachi, D.; Dahl, S.; Davletkaliyev, R.; Fedorets, O.; Frieiro, A. G.; Gao, Z.; Guldmyr, J.; Guthrie, A.; Hassel, J.; Heimonen, H.; Heinsoo, J.; Hiltunen, T.; Holland, K.; Hotari, J.; Hsu, H.; Huhtala, A.; Hyyppä, E.; Hämäläinen, A.; Ikonen, J.; Inel, S.; Janzso, D.; Jaakkola, T.; Jenei, M.; Jolin, S.; Juliusson, K.; Jussila, J.; Khalid, S.; Kim, S.; Koistinen, M.; Kokkoniemi, R.; Komlev, A.; Ockeloen-Korppi, C.; Koskinen, O.; Kotilahti, J.; Kuisma, T.; Kukushkin, V.; Kumpulainen, K.; Kuronen, I.; Kylmälä, J.; Lamponen, N.; Lamprich, J.; Landra, A.; Leib, M.; Li, T.; Liebermann, P.; Lintunen, A.; Liu, W.; Luus, J.; Marxer, F.; \\textbfMeijer-van de Griend, \\.; Mitra, K.; Moqadam, J. K.; Mrożek, J.; Mäkynen, H.; Mäntylä, J.; Naaranoja, T.; Nappi, F.; Niemi, J.; Ortega, L.; Palma, M.; Papič, M.; Partanen, M.; Penttilä, J.; Plyushch, A.; Qiu, W.; Rath, A.; Repo, K.; Riipinen, T.; Ritvas, J.; Romero, P. F.; Ruoho, J.; Räbinä, J.; Saarinen, S.; Sagar, I.; Sargsyan, H.; Sarsby, M.; Savola, N.; Savytskyi, M.; Selinmaa, V.; Smirnov, P.; Suárez, M. M.; Sundström, L.; Słupińska, S.; Takala, E.; Takmakov, I.; Tarasinski, B.; Thapa, M.; Tiainen, J.; Tosto, F.; Tuorila, J.; Valenzuela, C.; Vasey, D.; Vehmaanperä, E.; Vepsäläinen, A.; Vienamo, A.; Vesanen, P.; Välimaa, A.; Wesdorp, J.; Wurz, N.; Wybo, E.; Yang, L.;  and Yurtalan, A.\n</span>\n\n  \n\n</span>\n\n   2024.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://arxiv.org/abs/2408.12433\"\n     onclick=\"log_download('abdurakhimov-adam-ahmad-ahonen-algaba-alonso-bergholm-beriwal-etal-technologyandperformancebenchmarksofiqms20qubitquantumcomputer-2024', 'https://arxiv.org/abs/2408.12433', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Technology and Performance Benchmarks of IQM&#x27;s 20-Qubit Quantum Computer [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/abdurakhimov-adam-ahmad-ahonen-algaba-alonso-bergholm-beriwal-etal-technologyandperformancebenchmarksofiqms20qubitquantumcomputer-2024\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('abdurakhimov-adam-ahmad-ahonen-algaba-alonso-bergholm-beriwal-etal-technologyandperformancebenchmarksofiqms20qubitquantumcomputer-2024')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@misc{abdurakhimov2024technologyperformancebenchmarksiqms,\nkeywords={preprint},\n      title={Technology and Performance Benchmarks of IQM&#x27;s 20-Qubit Quantum Computer}, \n      author={Leonid Abdurakhimov and Janos Adam and Hasnain Ahmad and Olli Ahonen and Manuel Algaba and Guillermo Alonso and Ville Bergholm and Rohit Beriwal and Matthias Beuerle and Clinton Bockstiegel and Alessio Calzona and Chun Fai Chan and Daniele Cucurachi and Saga Dahl and Rakhim Davletkaliyev and Olexiy Fedorets and Alejandro Gomez Frieiro and Zheming Gao and Johan Guldmyr and Andrew Guthrie and Juha Hassel and Hermanni Heimonen and Johannes Heinsoo and Tuukka Hiltunen and Keiran Holland and Juho Hotari and Hao Hsu and Antti Huhtala and Eric Hyyppä and Aleksi Hämäläinen and Joni Ikonen and Sinan Inel and David Janzso and Teemu Jaakkola and Mate Jenei and Shan Jolin and Kristinn Juliusson and Jaakko Jussila and Shabeeb Khalid and Seung-Goo Kim and Miikka Koistinen and Roope Kokkoniemi and Anton Komlev and Caspar Ockeloen-Korppi and Otto Koskinen and Janne Kotilahti and Toivo Kuisma and Vladimir Kukushkin and Kari Kumpulainen and Ilari Kuronen and Joonas Kylmälä and Niclas Lamponen and Julia Lamprich and Alessandro Landra and Martin Leib and Tianyi Li and Per Liebermann and Aleksi Lintunen and Wei Liu and Jürgen Luus and Fabian Marxer and \\textbf{Arianne} \\textbf{Meijer-van de Griend} and Kunal Mitra and Jalil Khatibi Moqadam and Jakub Mrożek and Henrikki Mäkynen and Janne Mäntylä and Tiina Naaranoja and Francesco Nappi and Janne Niemi and Lucas Ortega and Mario Palma and Miha Papič and Matti Partanen and Jari Penttilä and Alexander Plyushch and Wei Qiu and Aniket Rath and Kari Repo and Tomi Riipinen and Jussi Ritvas and Pedro Figueroa Romero and Jarkko Ruoho and Jukka Räbinä and Sampo Saarinen and Indrajeet Sagar and Hayk Sargsyan and Matthew Sarsby and Niko Savola and Mykhailo Savytskyi and Ville Selinmaa and Pavel Smirnov and Marco Marín Suárez and Linus Sundström and Sandra Słupińska and Eelis Takala and Ivan Takmakov and Brian Tarasinski and Manish Thapa and Jukka Tiainen and Francesca Tosto and Jani Tuorila and Carlos Valenzuela and David Vasey and Edwin Vehmaanperä and Antti Vepsäläinen and Aapo Vienamo and Panu Vesanen and Alpo Välimaa and Jaap Wesdorp and Nicola Wurz and Elisabeth Wybo and Lily Yang and Ali Yurtalan},\n      year={2024},\n      eprint={2408.12433},\n      archivePrefix={arXiv},\n      primaryClass={quant-ph},\n      url={https://arxiv.org/abs/2408.12433}, \n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"huang-winderl-textbfmeijervandegriend-yeung-redefininglexicographicalorderingoptimizingpaulistringdecompositionsforquantumcompiling-2024\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Redefining lexicographical ordering: Optimizing pauli string decompositions for quantum compiling.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Huang, Q.; Winderl, D.; \\textbfMeijer-van de Griend, \\.;  and Yeung, R.\n</span>\n\n  \n\n</span>\n\n  In <i>2024 IEEE International Conference on Quantum Computing and Engineering (QCE)</i>, volume 1, pages 885–896,  2024. IEEE\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/huang-winderl-textbfmeijervandegriend-yeung-redefininglexicographicalorderingoptimizingpaulistringdecompositionsforquantumcompiling-2024\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('huang-winderl-textbfmeijervandegriend-yeung-redefininglexicographicalorderingoptimizingpaulistringdecompositionsforquantumcompiling-2024')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{huang2024redefining,\n  title={Redefining lexicographical ordering: Optimizing pauli string decompositions for quantum compiling},\n  author={Huang, Qunsheng and Winderl, David and \\textbf{Meijer-van de Griend}, \\textbf{Arianne} and Yeung, Richie},\n  booktitle={2024 IEEE International Conference on Quantum Computing and Engineering (QCE)},\n  volume={1},\n  pages={885--896},\n  year={2024},\n  organization={IEEE},\n  keywords = {published}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2023\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2023')\"\n      onkeypress=\"toggleGroup('group_2023')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2023</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"textbfmeijervandegriend-duncan-architectureawaresynthesisofphasepolynomialsfornisqdevices-2023\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://arxiv.org/pdf/2004.06052.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'textbfmeijervandegriend-duncan-architectureawaresynthesisofphasepolynomialsfornisqdevices-2023', 'https://arxiv.org/pdf/2004.06052.pdf', event);\">\n    Architecture-Aware Synthesis of Phase Polynomials for NISQ Devices.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  \\textbfMeijer-van de Griend, \\.;  and Duncan, R.\n</span>\n\n  \n\n</span>\n\n  <i>Electronic Proceedings in Theoretical Computer Science</i>, 394: 116-140. November 2023.\n  <span class=\"note\">In Proceedings QPL 2022, arXiv:2311.08375. This paper was originally accepted as Submission 38 in QPL2020, but was not included in the proceedings because of a clerical error.</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://arxiv.org/pdf/2004.06052.pdf\"\n     onclick=\"log_download('textbfmeijervandegriend-duncan-architectureawaresynthesisofphasepolynomialsfornisqdevices-2023', 'https://arxiv.org/pdf/2004.06052.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Architecture-Aware Synthesis of Phase Polynomials for NISQ Devices [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n  <a href=\"https://www.youtube.com/watch?v=uOAA0nbh9MI\"\n     onclick=\"log_download('textbfmeijervandegriend-duncan-architectureawaresynthesisofphasepolynomialsfornisqdevices-2023', 'https://www.youtube.com/watch?v=uOAA0nbh9MI', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Architecture-Aware Synthesis of Phase Polynomials for NISQ Devices [link]\"\n       title=\" link\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> link</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.4204/eptcs.394.8\"\n     onclick=\"log_download('textbfmeijervandegriend-duncan-architectureawaresynthesisofphasepolynomialsfornisqdevices-2023', 'http://doi.org/10.4204/eptcs.394.8', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/textbfmeijervandegriend-duncan-architectureawaresynthesisofphasepolynomialsfornisqdevices-2023\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('textbfmeijervandegriend-duncan-architectureawaresynthesisofphasepolynomialsfornisqdevices-2023')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{2004.06052,\n   title={Architecture-Aware Synthesis of Phase Polynomials for NISQ Devices},\n   volume={394},\n   DOI={10.4204/eptcs.394.8},\n   journal={Electronic Proceedings in Theoretical Computer Science},\n   publisher={Open Publishing Association},\n   author={\\textbf{Arianne} \\textbf{Meijer-van de Griend} and Duncan, Ross},\n   year={2023},\n   month=nov, \n   pages={116-140} ,\n  note={In Proceedings QPL 2022, arXiv:2311.08375. This paper was originally accepted as Submission 38 in QPL2020, but was not included in the proceedings because of a clerical error.},\n  url_Paper = {https://arxiv.org/pdf/2004.06052.pdf},\n  url_Link = {https://www.youtube.com/watch?v=uOAA0nbh9MI},\n  abstract = {We propose a new algorithm to synthesise quantum circuits for phase polynomials, which takes\n  into account the qubit connectivity of the quantum computer. We focus on the architectures\n  of currently available NISQ devices. Our algorithm generates circuits with a smaller CNOT\n  depth than the algorithms currently used in Staq and t|ket&gt;, while improving the runtime\n  with respect the former.},\nkeywords = {published}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We propose a new algorithm to synthesise quantum circuits for phase polynomials, which takes into account the qubit connectivity of the quantum computer. We focus on the architectures of currently available NISQ devices. Our algorithm generates circuits with a smaller CNOT depth than the algorithms currently used in Staq and t|ket>, while improving the runtime with respect the former.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"equi-textbfmeijervandegriend-mkinen-frombitparallelismtoquantumstringmatchingforlabelledgraphs-2023\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2023.9\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'equi-textbfmeijervandegriend-mkinen-frombitparallelismtoquantumstringmatchingforlabelledgraphs-2023', 'https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2023.9', event);\">\n    From Bit-Parallelism to Quantum String Matching for Labelled Graphs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Equi, M.; \\textbfMeijer-van de Griend, \\.;  and Mäkinen, V.\n</span>\n\n  \n\n</span>\n\n  In Bulteau, L.;  and Lipták, Z., editor(s), <i>34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023)</i>, volume 259, of <i>Leibniz International Proceedings in Informatics (LIPIcs)</i>, pages 9:1–9:20, Dagstuhl, Germany,  2023. Schloss Dagstuhl – Leibniz-Zentrum für Informatik\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2023.9\"\n     onclick=\"log_download('equi-textbfmeijervandegriend-mkinen-frombitparallelismtoquantumstringmatchingforlabelledgraphs-2023', 'https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2023.9', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"From Bit-Parallelism to Quantum String Matching for Labelled Graphs [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.4230/LIPIcs.CPM.2023.9\"\n     onclick=\"log_download('equi-textbfmeijervandegriend-mkinen-frombitparallelismtoquantumstringmatchingforlabelledgraphs-2023', 'http://doi.org/10.4230/LIPIcs.CPM.2023.9', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/equi-textbfmeijervandegriend-mkinen-frombitparallelismtoquantumstringmatchingforlabelledgraphs-2023\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('equi-textbfmeijervandegriend-mkinen-frombitparallelismtoquantumstringmatchingforlabelledgraphs-2023')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{equi2021bit,\n  author =\t{Equi, Massimo and \\textbf{Arianne} \\textbf{Meijer-van de Griend} and M\\&quot;{a}kinen, Veli},\n  title =\t{{From Bit-Parallelism to Quantum String Matching for Labelled Graphs}},\n  booktitle =\t{34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023)},\n  pages =\t{9:1--9:20},\n  series =\t{Leibniz International Proceedings in Informatics (LIPIcs)},\n  ISBN =\t{978-3-95977-276-1},\n  ISSN =\t{1868-8969},\n  year =\t{2023},\n  volume =\t{259},\n  editor =\t{Bulteau, Laurent and Lipt\\&#x27;{a}k, Zsuzsanna},\n  publisher =\t{Schloss Dagstuhl -- Leibniz-Zentrum f{\\&quot;u}r Informatik},\n  address =\t{Dagstuhl, Germany},\n  URL =\t\t{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2023.9},\n  URN =\t\t{urn:nbn:de:0030-drops-179637},\n  doi =\t\t{10.4230/LIPIcs.CPM.2023.9},\n  annote =\t{Keywords: Bit-parallelism, quantum computation, string matching, level DAGs},\n    keywords = {published}\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"textbfmeijervandegriend-li-dynamicqubitroutingwithcnotcircuitsynthesisforquantumcompilation-2023\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://arxiv.org/pdf/2205.00724.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'textbfmeijervandegriend-li-dynamicqubitroutingwithcnotcircuitsynthesisforquantumcompilation-2023', 'https://arxiv.org/pdf/2205.00724.pdf', event);\">\n    Dynamic Qubit Routing with CNOT Circuit Synthesis for Quantum Compilation.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  \\textbfMeijer-van de Griend, \\.;  and Li, S. M.\n</span>\n\n  \n\n</span>\n\n  <i>Electronic Proceedings in Theoretical Computer Science</i>, 394: 363-399. November 2023.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://arxiv.org/pdf/2205.00724.pdf\"\n     onclick=\"log_download('textbfmeijervandegriend-li-dynamicqubitroutingwithcnotcircuitsynthesisforquantumcompilation-2023', 'https://arxiv.org/pdf/2205.00724.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Dynamic Qubit Routing with CNOT Circuit Synthesis for Quantum Compilation [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.4204/eptcs.394.18\"\n     onclick=\"log_download('textbfmeijervandegriend-li-dynamicqubitroutingwithcnotcircuitsynthesisforquantumcompilation-2023', 'http://doi.org/10.4204/eptcs.394.18', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/textbfmeijervandegriend-li-dynamicqubitroutingwithcnotcircuitsynthesisforquantumcompilation-2023\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('textbfmeijervandegriend-li-dynamicqubitroutingwithcnotcircuitsynthesisforquantumcompilation-2023')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{2205.00724,\n   title={Dynamic Qubit Routing with CNOT Circuit Synthesis for Quantum Compilation},\n   volume={394},\n   DOI={10.4204/eptcs.394.18},\n   journal={Electronic Proceedings in Theoretical Computer Science},\n   publisher={Open Publishing Association},\n   author={\\textbf{Arianne} \\textbf{Meijer-van de Griend} and Li, Sarah Meng},\n   year={2023},\n   month=nov, pages={363-399},\n  url_Paper = {https://arxiv.org/pdf/2205.00724.pdf},\n  abstract = {Many quantum computers have constraints regarding which two-qubit operations are locally allowed. To run a quantum circuit under those constraints, qubits need to be allocated to different quantum registers, and multi-qubit gates need to be routed accordingly. Recent developments have shown that Steiner-tree based compiling strategies provide a competitive tool to route CNOT gates. However, these algorithms require the qubit allocation to be decided before routing. Moreover, the allocation is fixed throughout the computation, i.e. the logical qubit will not move to a different qubit register. This is inefficient with respect to the CNOT count of the resulting circuit. In this paper, we propose the algorithm PermRowCol for routing CNOTs in a quantum circuit. It dynamically reallocates logical qubits during the computation, and thus results in fewer output CNOTs than the algorithms Steiner-Gauss[11] and RowCol [23]. Here we focus on circuits over CNOT only, but this method could be generalized to a routing and allocation strategy on Clifford+T circuits by slicing the quantum circuit into subcircuits composed of CNOTs and single-qubit gates. Additionally, PermRowCol can be used in place of Steiner-Gauss in the synthesis of phase polynomials as well as the extraction of quantum circuits from ZX-diagrams.},\nkeywords = {published}\n}\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Many quantum computers have constraints regarding which two-qubit operations are locally allowed. To run a quantum circuit under those constraints, qubits need to be allocated to different quantum registers, and multi-qubit gates need to be routed accordingly. Recent developments have shown that Steiner-tree based compiling strategies provide a competitive tool to route CNOT gates. However, these algorithms require the qubit allocation to be decided before routing. Moreover, the allocation is fixed throughout the computation, i.e. the logical qubit will not move to a different qubit register. This is inefficient with respect to the CNOT count of the resulting circuit. In this paper, we propose the algorithm PermRowCol for routing CNOTs in a quantum circuit. It dynamically reallocates logical qubits during the computation, and thus results in fewer output CNOTs than the algorithms Steiner-Gauss[11] and RowCol [23]. Here we focus on circuits over CNOT only, but this method could be generalized to a routing and allocation strategy on Clifford+T circuits by slicing the quantum circuit into subcircuits composed of CNOTs and single-qubit gates. Additionally, PermRowCol can be used in place of Steiner-Gauss in the synthesis of phase polynomials as well as the extraction of quantum circuits from ZX-diagrams.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"winderl-huang-textbfmeijervandegriend-yeung-architectureawaresynthesisofstabilizercircuitsfromcliffordtableaus-2023\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://arxiv.org/abs/2309.08972\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'winderl-huang-textbfmeijervandegriend-yeung-architectureawaresynthesisofstabilizercircuitsfromcliffordtableaus-2023', 'https://arxiv.org/abs/2309.08972', event);\">\n    Architecture-Aware Synthesis of Stabilizer Circuits from Clifford Tableaus.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Winderl, D.; Huang, Q.; \\textbfMeijer-van de Griend, \\.;  and Yeung, R.\n</span>\n\n  \n\n</span>\n\n  .  2023.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://arxiv.org/abs/2309.08972\"\n     onclick=\"log_download('winderl-huang-textbfmeijervandegriend-yeung-architectureawaresynthesisofstabilizercircuitsfromcliffordtableaus-2023', 'https://arxiv.org/abs/2309.08972', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Architecture-Aware Synthesis of Stabilizer Circuits from Clifford Tableaus [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/winderl-huang-textbfmeijervandegriend-yeung-architectureawaresynthesisofstabilizercircuitsfromcliffordtableaus-2023\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('winderl-huang-textbfmeijervandegriend-yeung-architectureawaresynthesisofstabilizercircuitsfromcliffordtableaus-2023')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{winderl2023architectureawaresynthesisstabilizercircuits,\n      title={Architecture-Aware Synthesis of Stabilizer Circuits from Clifford Tableaus}, \n      author={David Winderl and Qunsheng Huang and \\textbf{Arianne} \\textbf{Meijer-van de Griend} and Richie Yeung},\n      year={2023},\n      eprint={2309.08972},\n      archivePrefix={arXiv},\n      primaryClass={quant-ph},\n      url={https://arxiv.org/abs/2309.08972}, \n      keywords = {submitted},\n      abstract = {Since quantum computing is currently in the NISQ-Era, compilation strategies to reduce the number of gates executed on specific hardware are required. In this work, we utilize the concept of synthesis of a data structure called Clifford tableaus, focusing on applying CNOTs within the respective connectivity graph of the quantum device. We hence contribute to the field of compilation or, more precisely, synthesis by reducing the number of CNOTs in the synthesized quantum circuit. Upon convergence, our method shows to outperform other state-of-the-art synthesis techniques, when executed with respect to a specific hardware. Upon executing the resulting circuits on real hardware, our synthesized circuits tend to increase the final fidelity and reduce the overall execution times.},\n}\n\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Since quantum computing is currently in the NISQ-Era, compilation strategies to reduce the number of gates executed on specific hardware are required. In this work, we utilize the concept of synthesis of a data structure called Clifford tableaus, focusing on applying CNOTs within the respective connectivity graph of the quantum device. We hence contribute to the field of compilation or, more precisely, synthesis by reducing the number of CNOTs in the synthesized quantum circuit. Upon convergence, our method shows to outperform other state-of-the-art synthesis techniques, when executed with respect to a specific hardware. Upon executing the resulting circuits on real hardware, our synthesized circuits tend to increase the final fidelity and reduce the overall execution times.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2022\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2022')\"\n      onkeypress=\"toggleGroup('group_2022')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2022</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"textbfmeijervandegriend-nurminen-quantmarkabenchmarkingapiforcomparingvqealgorithms-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://ieeexplore.ieee.org/document/9735298\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'textbfmeijervandegriend-nurminen-quantmarkabenchmarkingapiforcomparingvqealgorithms-2022', 'https://ieeexplore.ieee.org/document/9735298', event);\">\n    QuantMark: A benchmarking API for comparing VQE algorithms.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  \\textbfMeijer-van de Griend, \\.;  and Nurminen, J. K\n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Quantum Engineering</i>,1-1.  2022.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://ieeexplore.ieee.org/document/9735298\"\n     onclick=\"log_download('textbfmeijervandegriend-nurminen-quantmarkabenchmarkingapiforcomparingvqealgorithms-2022', 'https://ieeexplore.ieee.org/document/9735298', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"QuantMark: A benchmarking API for comparing VQE algorithms [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/TQE.2022.3159327\"\n     onclick=\"log_download('textbfmeijervandegriend-nurminen-quantmarkabenchmarkingapiforcomparingvqealgorithms-2022', 'http://doi.org/10.1109/TQE.2022.3159327', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/textbfmeijervandegriend-nurminen-quantmarkabenchmarkingapiforcomparingvqealgorithms-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('textbfmeijervandegriend-nurminen-quantmarkabenchmarkingapiforcomparingvqealgorithms-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{quantmark,\n  author={\\textbf{Adriana} \\textbf{Meijer-van de Griend} and Nurminen, Jukka K},\n  journal={IEEE Transactions on Quantum Engineering}, \n  title={QuantMark: A benchmarking API for comparing VQE algorithms}, \n  year={2022},\n  volume={},\n  number={},\n  pages={1-1},\n  doi={10.1109/TQE.2022.3159327},\n  url_Paper={https://ieeexplore.ieee.org/document/9735298},\n  abstract = {Thanks to the rise of quantum computers, many variations of the variational quantum eigensolver (VQE) have been proposed in recent times. This is a promising development for real quantum algorithms, as the VQE is a promising algorithm that runs on current quantum hardware. However, the popular method of comparing your algorithm versus a classical baseline in a small basis set is not meaningful in the big picture. Moreover, many papers use a different molecular representation or a different quantum computer to test their algorithms such that the used baselines are different between different papers. Thus, it is almost impossible to compare the different algorithms to each other. As a solution, we have built a benchmarking framework to standardize the VQE performance metrics, such that they can be analyzed more easily. Using our framework, any researcher working on the VQE can easily test their own algorithms against previous ones on the leaderboard without the need to reproduce previous work themselves.},\nkeywords = {published}}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Thanks to the rise of quantum computers, many variations of the variational quantum eigensolver (VQE) have been proposed in recent times. This is a promising development for real quantum algorithms, as the VQE is a promising algorithm that runs on current quantum hardware. However, the popular method of comparing your algorithm versus a classical baseline in a small basis set is not meaningful in the big picture. Moreover, many papers use a different molecular representation or a different quantum computer to test their algorithms such that the used baselines are different between different papers. Thus, it is almost impossible to compare the different algorithms to each other. As a solution, we have built a benchmarking framework to standardize the VQE performance metrics, such that they can be analyzed more easily. Using our framework, any researcher working on the VQE can easily test their own algorithms against previous ones on the leaderboard without the need to reproduce previous work themselves.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2020\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2020')\"\n      onkeypress=\"toggleGroup('group_2020')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2020</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"kissinger-textbfmeijervandegriend-cnotcircuitextractionfortopologicallyconstrainedquantummemories-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.rintonpress.com/xxqic20/qic-20-78/0581-0596.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'kissinger-textbfmeijervandegriend-cnotcircuitextractionfortopologicallyconstrainedquantummemories-2020', 'http://www.rintonpress.com/xxqic20/qic-20-78/0581-0596.pdf', event);\">\n    CNOT circuit extraction for topologically-constrained quantum memories.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Kissinger, A.;  and \\textbfMeijer-van de Griend, \\.\n</span>\n\n  \n\n</span>\n\n  <i>Quantum Information and Computation</i>, 20(7&8): 581–596.  2020.\n  <span class=\"note\">Also presented at QPL 2019, Chapman University (Orange, USA)</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.rintonpress.com/xxqic20/qic-20-78/0581-0596.pdf\"\n     onclick=\"log_download('kissinger-textbfmeijervandegriend-cnotcircuitextractionfortopologicallyconstrainedquantummemories-2020', 'http://www.rintonpress.com/xxqic20/qic-20-78/0581-0596.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"CNOT circuit extraction for topologically-constrained quantum memories [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.26421/QIC20.7-8-4\"\n     onclick=\"log_download('kissinger-textbfmeijervandegriend-cnotcircuitextractionfortopologicallyconstrainedquantummemories-2020', 'http://doi.org/10.26421/QIC20.7-8-4', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/kissinger-textbfmeijervandegriend-cnotcircuitextractionfortopologicallyconstrainedquantummemories-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('kissinger-textbfmeijervandegriend-cnotcircuitextractionfortopologicallyconstrainedquantummemories-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{1904.00633,\nAuthor = {Kissinger, Aleks and \\textbf{Arianne} \\textbf{Meijer-van de Griend}},\nTitle = {CNOT circuit extraction for topologically-constrained quantum memories},\njournal={Quantum Information and Computation},\nvolume={20},\nnumber={7\\&amp;8},\npages={581--596},\nyear={2020},\ndoi={10.26421/QIC20.7-8-4},\nnote = {Also presented at QPL 2019, Chapman University (Orange, USA)},\nurl_Paper = {http://www.rintonpress.com/xxqic20/qic-20-78/0581-0596.pdf},\nabstract = {Many physical implementations of quantum computers impose stringent\nmemory constraints in which 2-qubit operations can only be performed between\nqubits which are nearest neighbours in a lattice or graph structure. Hence, before\na computation can be run on such a device, it must be mapped onto the physical\narchitecture. That is, logical qubits must be assigned physical locations in the\nquantum memory, and the circuit must be replaced by an equivalent one containing\nonly operations between nearest neighbours. In this paper, we give a new technique\nfor quantum circuit mapping (a.k.a. routing), based on Gaussian elimination\nconstrained to certain optimal spanning trees called Steiner trees. We give a reference\nimplementation of the technique for CNOT circuits and show that it significantly outperforms general-purpose routines on CNOT circuits. We then comment on how the\ntechnique can be extended straightforwardly to the synthesis of CNOT+Rz circuits and\nas a modification to a recently-proposed circuit simplification/extraction procedure for\ngeneric circuits based on the ZX-calculus.\n},\nkeywords = {published}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Many physical implementations of quantum computers impose stringent memory constraints in which 2-qubit operations can only be performed between qubits which are nearest neighbours in a lattice or graph structure. Hence, before a computation can be run on such a device, it must be mapped onto the physical architecture. That is, logical qubits must be assigned physical locations in the quantum memory, and the circuit must be replaced by an equivalent one containing only operations between nearest neighbours. In this paper, we give a new technique for quantum circuit mapping (a.k.a. routing), based on Gaussian elimination constrained to certain optimal spanning trees called Steiner trees. We give a reference implementation of the technique for CNOT circuits and show that it significantly outperforms general-purpose routines on CNOT circuits. We then comment on how the technique can be extended straightforwardly to the synthesis of CNOT+Rz circuits and as a modification to a recently-proposed circuit simplification/extraction procedure for generic circuits based on the ZX-calculus. \n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2019\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2019')\"\n      onkeypress=\"toggleGroup('group_2019')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2019</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"textbfmeijervandegriend-constrainedquantumcnotcircuitresynthesisusingdeepreinforcementlearning-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.researchgate.net/publication/335977643_Constrained_quantum_CNOT_circuit_re-synthesis_using_deep_reinforcement_learning\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'textbfmeijervandegriend-constrainedquantumcnotcircuitresynthesisusingdeepreinforcementlearning-2019', 'https://www.researchgate.net/publication/335977643_Constrained_quantum_CNOT_circuit_re-synthesis_using_deep_reinforcement_learning', event);\">\n    Constrained quantum CNOT circuit re-synthesis using deep reinforcement learning.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  \\textbfMeijer-van de Griend, \\.\n</span>\n\n  \n\n</span>\n\n   2019.<!-- NOTE FROM BIBBASE: This entry has an invalid bibtex entry type: online. Therefore, we don't know how to render it properly. Please consider fixing this. -->\n  <span class=\"note\">Master thesis Artificial Intelligence</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.researchgate.net/publication/335977643_Constrained_quantum_CNOT_circuit_re-synthesis_using_deep_reinforcement_learning\"\n     onclick=\"log_download('textbfmeijervandegriend-constrainedquantumcnotcircuitresynthesisusingdeepreinforcementlearning-2019', 'https://www.researchgate.net/publication/335977643_Constrained_quantum_CNOT_circuit_re-synthesis_using_deep_reinforcement_learning', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Constrained quantum CNOT circuit re-synthesis using deep reinforcement learning [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/textbfmeijervandegriend-constrainedquantumcnotcircuitresynthesisusingdeepreinforcementlearning-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('textbfmeijervandegriend-constrainedquantumcnotcircuitresynthesisusingdeepreinforcementlearning-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@online{AIThesis,\nAuthor = {\\textbf{Arianne} \\textbf{Meijer-van de Griend}},\nTitle = {Constrained quantum CNOT circuit re-synthesis using deep reinforcement learning},\nYear = {2019},\nEprint = {RG.2.2.11886.77125},\nEprinttype = {ResearchGate},\nnote = {Master thesis Artificial Intelligence},\nurl_Paper = {https://www.researchgate.net/publication/335977643_Constrained_quantum_CNOT_circuit_re-synthesis_using_deep_reinforcement_learning},\nabstract = {In this master thesis, we describe a novel approach to constrained CNOT circuit resynthesis as a first step towards neural constrained quantum circuit re-synthesis. We train a neural network to do constrained Gaussian elimination from a parity matrix using deep reinforcement learning. The CNOT circuit is transformed into a parity matrix from which an equivalent CNOT circuit is synthesized such that all CNOT gates adhere to the connectivity constraints provided by the quantum computer architecture. For our n-step deep Q learning approach, we have used an asynchronous dueling neural network with three different action selection policies: ϵ-greedy, softmax and a novel oracle selection policy. To train this neural network, we have proposed a novel phased training procedure that guides the training process from trivial problems to arbitrary ones while simulating. Although we were only able to successfully train an agent for trivial quantum computer connectivity constraints, the 2 and 3 qubit coupling graphs. We did show that those agents were able to perform similar to the genetic Steiner baseline and could even improve on them. We also investigated the effect of coupling graph sizes and connectivity on network performance and training time. Lastly, we show that transfer learning can result in an improved network, but it takes longer to train. This is a very promising start of a new research field that could result in a universal quantum circuit optimization and mapping algorithm that is robust to both expected and unexpected future changes in quantum computer architectures.},\nkeywords = {unpublished}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this master thesis, we describe a novel approach to constrained CNOT circuit resynthesis as a first step towards neural constrained quantum circuit re-synthesis. We train a neural network to do constrained Gaussian elimination from a parity matrix using deep reinforcement learning. The CNOT circuit is transformed into a parity matrix from which an equivalent CNOT circuit is synthesized such that all CNOT gates adhere to the connectivity constraints provided by the quantum computer architecture. For our n-step deep Q learning approach, we have used an asynchronous dueling neural network with three different action selection policies: ϵ-greedy, softmax and a novel oracle selection policy. To train this neural network, we have proposed a novel phased training procedure that guides the training process from trivial problems to arbitrary ones while simulating. Although we were only able to successfully train an agent for trivial quantum computer connectivity constraints, the 2 and 3 qubit coupling graphs. We did show that those agents were able to perform similar to the genetic Steiner baseline and could even improve on them. We also investigated the effect of coupling graph sizes and connectivity on network performance and training time. Lastly, we show that transfer learning can result in an improved network, but it takes longer to train. This is a very promising start of a new research field that could result in a universal quantum circuit optimization and mapping algorithm that is robust to both expected and unexpected future changes in quantum computer architectures.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2018\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2018')\"\n      onkeypress=\"toggleGroup('group_2018')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2018</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"textbfvandegriend-naturallanguagegenerationforcommercialapplications-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://www.researchgate.net/publication/335977746_Natural_language_generation_for_commercial_applications\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'textbfvandegriend-naturallanguagegenerationforcommercialapplications-2018', 'https://www.researchgate.net/publication/335977746_Natural_language_generation_for_commercial_applications', event);\">\n    Natural language generation for commercial applications.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  \\textbfvan de Griend, \\.\n</span>\n\n  \n\n</span>\n\n   2018.<!-- NOTE FROM BIBBASE: This entry has an invalid bibtex entry type: online. Therefore, we don't know how to render it properly. Please consider fixing this. -->\n  <span class=\"note\">Master thesis Computing Science</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://www.researchgate.net/publication/335977746_Natural_language_generation_for_commercial_applications\"\n     onclick=\"log_download('textbfvandegriend-naturallanguagegenerationforcommercialapplications-2018', 'https://www.researchgate.net/publication/335977746_Natural_language_generation_for_commercial_applications', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Natural language generation for commercial applications [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/textbfvandegriend-naturallanguagegenerationforcommercialapplications-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('textbfvandegriend-naturallanguagegenerationforcommercialapplications-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@online{CSThesis,\nAuthor = {\\textbf{Arianne} \\textbf{van de Griend}},\nTitle = {Natural language generation for commercial applications},\nYear = {2018},\nEprint = {RG.2.2.21953.10087},\nEprinttype = {ResearchGate},\nnote = {Master thesis Computing Science},\nurl_Paper = {https://www.researchgate.net/publication/335977746_Natural_language_generation_for_commercial_applications},\nabstract = {This master thesis gives an overview on natural language generation with the focus of dialogue systems for commercial use. \nWe give a description of the general approach to natural language generation and their neural architectures first.\nThen three application domains are discussed in more detail: language style transfer, dialogue response generation and controlling dialogue response generation. \nFor each domain, a use case was implemented and the results are discussed. We investigated automatic customer support, an empathetic automatic customer support and sentiment adjustment of reviews.\nWe show promising results for the first two use cases, but the last use case was inconclusive due to difficulties with implementation. \nWe finish with a short discussion of the use of natural language generation in commercial applications and what can be improved in our current model architectures.},\nkeywords = {unpublished}\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This master thesis gives an overview on natural language generation with the focus of dialogue systems for commercial use. We give a description of the general approach to natural language generation and their neural architectures first. Then three application domains are discussed in more detail: language style transfer, dialogue response generation and controlling dialogue response generation. For each domain, a use case was implemented and the results are discussed. We investigated automatic customer support, an empathetic automatic customer support and sentiment adjustment of reviews. We show promising results for the first two use cases, but the last use case was inconclusive due to difficulties with implementation. We finish with a short discussion of the use of natural language generation in commercial applications and what can be improved in our current model architectures.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n  </div>\n\n\n  <!-- Modal -->\n\n  <!-- <iframe id=\"bibbase_network_frame\" -->\n  <!--         src=\"//bibbase.org/network/control\" -->\n  <!--         style=\"display: none;\"> -->\n  <!-- </iframe> -->\n\n</div>\n"}; document.write(bibbase_data.data);