{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T20:07:47Z","timestamp":1783714067214,"version":"3.55.0"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T00:00:00Z","timestamp":1656547200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Transactions on Quantum Computing"],"published-print":{"date-parts":[[2022,9,30]]},"abstract":"<jats:p>\n            We propose an IR for quantum computing that directly exposes quantum and classical data dependencies for the purpose of optimization. The\n            <jats:italic>\n              <jats:bold>Quantum Intermediate Representation for Optimization<\/jats:bold>\n            <\/jats:italic>\n            <jats:bold>(QIRO)<\/jats:bold>\n            consists of two dialects, one input dialect and one that is specifically tailored to enable quantum-classical co-optimization. While the first employs a perhaps more intuitive memory-semantics (quantum operations act on qubits via side-effects), the latter uses value-semantics (operations consume and produce states) to integrate quantum dataflow in the IR\u2019s\n            <jats:bold>Static Single Assignment (SSA)<\/jats:bold>\n            graph. Crucially, this allows for a host of optimizations that leverage dataflow analysis. We discuss how to map existing quantum programming languages to the input dialect and how to lower the resulting IR to the optimization dialect. We present a prototype implementation based on MLIR that includes several quantum-specific optimization passes. Our benchmarks show that significant improvements in resource requirements are possible even through static optimization. In contrast to circuit optimization at run time, this is achieved while incurring only a small constant overhead in compilation time, making this a compelling approach for quantum program optimization at application scale.\n          <\/jats:p>","DOI":"10.1145\/3491247","type":"journal-article","created":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T20:54:09Z","timestamp":1645649649000},"page":"1-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["QIRO: A Static Single Assignment-based Quantum Program Representation for Optimization"],"prefix":"10.1145","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0975-6448","authenticated-orcid":false,"given":"David","family":"Ittah","sequence":"first","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4297-7878","authenticated-orcid":false,"given":"Thomas","family":"H\u00e4ner","sequence":"additional","affiliation":[{"name":"Microsoft Quantum, Redmond, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7076-5864","authenticated-orcid":false,"given":"Vadym","family":"Kliuchnikov","sequence":"additional","affiliation":[{"name":"Microsoft Quantum, Redmond, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Torsten","family":"Hoefler","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,6,30]]},"reference":[{"key":"e_1_3_4_2_2","volume-title":"Compilers: Principles, Techniques, and Tools","author":"Aho Alfred V.","year":"2006","unstructured":"Alfred V. Aho, Monica S. Lam, Ravi Sethi, and Jeffrey D. Ullman. 2006. Compilers: Principles, Techniques, and Tools (2nd Edition). Addison-Wesley, USA."},{"key":"e_1_3_4_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2014.2341953"},{"key":"e_1_3_4_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/tcad.2013.2244643"},{"key":"e_1_3_4_5_2","doi-asserted-by":"publisher","DOI":"10.5555\/2011517.2011525"},{"key":"e_1_3_4_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3386007"},{"key":"e_1_3_4_7_2","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.4062499"},{"key":"e_1_3_4_8_2","unstructured":"Thomas G. Draper. 2000. Addition on a quantum computer. (2000). arxiv:quant-ph\/0008033."},{"key":"e_1_3_4_9_2","doi-asserted-by":"publisher","DOI":"10.1063\/1.4927100"},{"key":"e_1_3_4_10_2","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.2573505"},{"key":"e_1_3_4_11_2","unstructured":"Alan Geller. 2020. Introducing Quantum Intermediate Representation (QIR). (Sep. 2020). https:\/\/devblogs.microsoft.com\/qsharp\/introducing-quantum-intermediate-representation-qir."},{"key":"e_1_3_4_12_2","unstructured":"Craig Gidney and Martin Eker\u00e5. 2019. How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits. (2019). arXiv:quant-ph\/1905.09749."},{"key":"e_1_3_4_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462177"},{"key":"e_1_3_4_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/3428201"},{"key":"e_1_3_4_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-44223-1_23"},{"key":"e_1_3_4_16_2","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/aaa5cc"},{"key":"e_1_3_4_17_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.93.032318"},{"key":"e_1_3_4_18_2","volume-title":"Scaffold: Quantum Programming Language","author":"JavadiAbhari Ali","year":"2012","unstructured":"Ali JavadiAbhari, Arvin Faruque, Mohammad Javad Dousti, Lukas Svec, Oana Catu, Amlan Chakrabati, Chen-Fu Chiang, Seth Vanderwilt, John Black, Fred Chong, Margaret Martonosi, Martin Suchara, Ken Brown, Massoud Pedram, and Todd Brun. 2012. Scaffold: Quantum Programming Language. Technical Report. Princeton University. https:\/\/www.cs.princeton.edu\/research\/techreps\/TR-934-12."},{"key":"e_1_3_4_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/2597917.2597939"},{"key":"e_1_3_4_20_2","doi-asserted-by":"publisher","DOI":"10.22331\/q-2019-03-11-129"},{"key":"e_1_3_4_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2004.1281665"},{"key":"e_1_3_4_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/CGO51591.2021.9370308"},{"key":"e_1_3_4_23_2","doi-asserted-by":"crossref","unstructured":"Alexander McCaskey and Thien Nguyen. 2021. A MLIR Dialect for Quantum Assembly Languages. (2021). arxiv:quant-ph\/2101.11365.","DOI":"10.1109\/QCE52317.2021.00043"},{"key":"e_1_3_4_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/3428198"},{"key":"e_1_3_4_25_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41534-018-0072-4"},{"key":"e_1_3_4_26_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511976667"},{"key":"e_1_3_4_27_2","doi-asserted-by":"publisher","DOI":"10.5555\/2685179.2685181"},{"key":"e_1_3_4_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009894"},{"key":"e_1_3_4_29_2","doi-asserted-by":"publisher","DOI":"10.22331\/q-2018-08-06-79"},{"key":"e_1_3_4_30_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1619152114"},{"key":"e_1_3_4_31_2","unstructured":"Robert S. Smith Michael J. Curtis and William J. Zeng. 2016. A Practical Quantum Instruction Set Architecture. (2016). arXiv:quant-ph\/1608.03355."},{"key":"e_1_3_4_32_2","doi-asserted-by":"publisher","DOI":"10.22331\/q-2018-01-31-49"},{"key":"e_1_3_4_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/3183895.3183901"},{"key":"e_1_3_4_34_2","doi-asserted-by":"crossref","unstructured":"Vera von Burg Guang Hao Low Thomas H\u00e4ner Damian S. Steiger Markus Reiher Martin Roetteler and Matthias Troyer. 2020. Quantum computing enhanced computational catalysis. (2020). arXiv:quant-ph\/2007.14460.","DOI":"10.1103\/PhysRevResearch.3.033055"}],"container-title":["ACM Transactions on Quantum Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3491247","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3491247","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:09:19Z","timestamp":1750183759000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3491247"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,30]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,9,30]]}},"alternative-id":["10.1145\/3491247"],"URL":"https:\/\/doi.org\/10.1145\/3491247","relation":{},"ISSN":["2643-6809","2643-6817"],"issn-type":[{"value":"2643-6809","type":"print"},{"value":"2643-6817","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,30]]},"assertion":[{"value":"2021-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-06-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}