{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T10:09:59Z","timestamp":1784196599256,"version":"3.55.0"},"reference-count":105,"publisher":"Association for Computing Machinery (ACM)","issue":"ICFP","license":[{"start":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T00:00:00Z","timestamp":1754352000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["OSI 2435255"],"award-info":[{"award-number":["OSI 2435255"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2025,8,5]]},"abstract":"<jats:p>\n                    In physics and chemistry, quantum systems are typically modeled using energy constraints formulated as Hamiltonians. Investigations into such systems often focus on the evolution of the Hamiltonians under various initial conditions, an approach summarized as\n                    <jats:italic toggle=\"yes\">Adiabatic Quantum Computing<\/jats:italic>\n                    (\n                    <jats:italic toggle=\"yes\">AQC<\/jats:italic>\n                    ). Although this perspective may initially seem foreign to functional programmers, we demonstrate that conventional functional programming abstractions\u2014specifically, the\n                    <jats:styled-content style=\"color:#CC4747\">\n                      <jats:monospace>Traversable<\/jats:monospace>\n                    <\/jats:styled-content>\n                    and\n                    <jats:styled-content style=\"color:#CC4747\">\n                      <jats:monospace>Monad<\/jats:monospace>\n                    <\/jats:styled-content>\n                    type classes\u2014naturally capture the essence of\n                    <jats:italic toggle=\"yes\">AQC<\/jats:italic>\n                    . To illustrate this connection, we introduce\n                    <jats:sc>EnQ<\/jats:sc>\n                    , a functional programming library designed to express diverse optimization problems as energy constraint computations (\n                    <jats:italic toggle=\"yes\">ECC<\/jats:italic>\n                    ). The library comprises three core components: generating the solution space, associating energy costs with potential solutions, and searching for optimal or near-optimal solutions. Because\n                    <jats:sc>EnQ<\/jats:sc>\n                    is implemented using standard Haskell, it can be executed directly through conventional classical Haskell compilers. More interestingly, we develop and implement a process to compile\n                    <jats:sc>EnQ<\/jats:sc>\n                    programs into circuits executable on quantum hardware. We validate\n                    <jats:sc>EnQ<\/jats:sc>\n                    \u2019s effectiveness through a number of case studies, demonstrating its capacity to express and solve classical optimization problems on quantum hardware, including search problems, type inference, number partitioning, clique finding, and graph coloring.\n                  <\/jats:p>","DOI":"10.1145\/3747521","type":"journal-article","created":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T16:56:02Z","timestamp":1754412962000},"page":"479-509","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Haskell Adiabatic DSL: Solving Classical Optimization Problems on Quantum Hardware"],"prefix":"10.1145","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8184-0244","authenticated-orcid":false,"given":"Liyi","family":"Li","sequence":"first","affiliation":[{"name":"Iowa State University, Ames, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-1193-330X","authenticated-orcid":false,"given":"David","family":"Young","sequence":"additional","affiliation":[{"name":"University of Kansas, Lawrence, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-0197-3362","authenticated-orcid":false,"given":"James Bryan","family":"Graves","sequence":"additional","affiliation":[{"name":"Indiana University, Bloomington, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9464-8024","authenticated-orcid":false,"given":"Chandeepa","family":"Dissanayake","sequence":"additional","affiliation":[{"name":"Iowa State University, Ames, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1025-7331","authenticated-orcid":false,"given":"Amr","family":"Sabry","sequence":"additional","affiliation":[{"name":"Indiana University, Bloomington, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,8,5]]},"reference":[{"key":"e_1_3_2_2_1","unstructured":"2023. Bloqade.jl: Package for the quantum computation and quantum simulation based on the neutral-atom architecture. https:\/\/github.com\/QuEraComputing\/Bloqade.jl\/"},{"key":"e_1_3_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3373376.3378449"},{"key":"e_1_3_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2980983.2908116"},{"key":"e_1_3_2_5_1","doi-asserted-by":"publisher","unstructured":"D. Aharonov W. van Dam J. Kempe Z. Landau S. Lloyd and O. Regev. 2004. Adiabatic quantum computation is equivalent to standard quantum computation. In 45th Annual IEEE Symposium on Foundations of Computer Science. 42\u201351. doi:10.1109\/FOCS.2004.8","DOI":"10.1109\/FOCS.2004.8"},{"key":"e_1_3_2_6_1","doi-asserted-by":"publisher","DOI":"10.1103\/revmodphys.90.015002"},{"key":"e_1_3_2_7_1","doi-asserted-by":"publisher","unstructured":"Gadi Aleksandrowicz Thomas Alexander Panagiotis Barkoutsos Luciano Bello Yael Ben-Haim David Bucher Francisco Jose Cabrera-Hern\u00e1ndez Jorge Carballo-Franquis Adrian Chen Chun-Fu Chen Jerry M. Chow Antonio D. C\u00f3rcoles-Gonzales Abigail J. Cross Andrew Cross Juan Cruz-Benito Chris Culver Salvador De La Puente Gonz\u00e1lez Enrique De La Torre Delton Ding Eugene Dumitrescu Ivan Duran Pieter Eendebak Mark Everitt Ismael Faro Sertage Albert Frisch Andreas Fuhrer Jay Gambetta Borja Godoy Gago Juan Gomez-Mosquera Donny Greenberg Ikko Hamamura Vojtech Havlicek Joe Hellmers \u0141ukasz Herok Hiroshi Horii Shaohan Hu Takashi Imamichi Toshinari Itoko Ali Javadi-Abhari Naoki Kanazawa Anton Karazeev Kevin Krsulich Peng Liu Yang Luh Yunho Maeng Manoel Marques Francisco Jose Mart\u00edn-Fern\u00e1ndez Douglas T. McClure David McKay Srujan Meesala Antonio Mezzacapo Nikolaj Moll Diego Moreda Rodr\u00edguez Giacomo Nannicini Paul Nation Pauline Ollitrault Lee James O\u2019Riordan Hanhee Paik Jes\u00fas P\u00e9rez Anna Phan Marco Pistoia Viktor Prutyanov Max Reuter Julia Rice Abd\u00f3n Rodr\u00edguez Davila Raymond Harry Putra Rudy Mingi Ryu Ninad Sathaye Chris Schnabel Eddie Schoute Kanav Setia Yunong Shi Adenilton Silva Yukio Siraichi Seyon Sivarajah John A. Smolin Mathias Soeken Hitomi Takahashi Ivano Tavernelli Charles Taylor Pete Taylour Kenso Trabing Matthew Treinish Wes Turner Desiree Vogt-Lee Christophe Vuillot Jonathan A. Wildstrom Jessica Wilson Erick Winston Christopher Wood Stephen Wood Stefan W\u00f6rner Ismail Yunus Akhalwaya and Christa Zoufal. 2019. Qiskit: An open-source framework for quantum computing. doi:10.5281\/zenodo.2562110.","DOI":"10.5281\/zenodo.2562110"},{"key":"e_1_3_2_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<457::AID-RSA14>3.0.CO;2-W"},{"key":"e_1_3_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63390-9_1"},{"key":"e_1_3_2_10_1","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/15\/10\/028"},{"key":"e_1_3_2_11_1","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.86.1082"},{"key":"e_1_3_2_12_1","doi-asserted-by":"publisher","DOI":"10.1080\/00018730310001642086"},{"key":"e_1_3_2_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2011517.2011525"},{"key":"e_1_3_2_14_1","doi-asserted-by":"publisher","DOI":"10.4249\/SCHOLARPEDIA.7902"},{"key":"e_1_3_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3386007"},{"key":"e_1_3_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02115753"},{"key":"e_1_3_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00341-9"},{"key":"e_1_3_2_18_1","doi-asserted-by":"publisher","unstructured":"Sergey Bravyi Andrew W. Cross Jay M. Gambetta Dmitri Maslov Patrick Rall and Theodore J. Yoder. 2024. High-threshold and low-overhead fault-tolerant quantum memory. arXiv:2308.07915 [quant-ph]. doi:10.48550\/arXiv.2308.07915","DOI":"10.48550\/arXiv.2308.07915"},{"key":"e_1_3_2_19_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.284.5415.779"},{"key":"e_1_3_2_20_1","doi-asserted-by":"publisher","DOI":"10.1021\/acs.chemrev.8b00803"},{"key":"e_1_3_2_21_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevB.24.4062"},{"key":"e_1_3_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-72019-3_6"},{"issue":"3","key":"e_1_3_2_23_1","first-page":"181","article-title":"Finding cliques by quantum adiabatic evolution","volume":"2","author":"Childs Andrew M.","year":"2002","unstructured":"Andrew M. Childs, Edward Farhi, Jeffrey Goldstone, and Sam Gutmann. 2002. Finding cliques by quantum adiabatic evolution. Quantum Info. Comput. 2, 3 (apr 2002), 181\u2013191.","journal-title":"Quantum Info. Comput."},{"key":"e_1_3_2_24_1","unstructured":"Vicky Choi. 2010. Adiabatic Quantum Algorithms for the NP-Complete Maximum-Weight Independent Set Exact Cover and 3SAT Problems. arXiv:1004.2226 [quant-ph] https:\/\/arxiv.org\/abs\/1004.2226"},{"key":"e_1_3_2_25_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.1637578"},{"key":"e_1_3_2_26_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/13\/4\/043016"},{"key":"e_1_3_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3505636"},{"key":"e_1_3_2_28_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-022-04940-6"},{"key":"e_1_3_2_29_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.80.1061"},{"key":"e_1_3_2_30_1","doi-asserted-by":"publisher","unstructured":"Cirq Developers. 2023. Cirq. doi:10.5281\/zenodo.10247207","DOI":"10.5281\/zenodo.10247207"},{"key":"e_1_3_2_31_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100021162"},{"key":"e_1_3_2_32_1","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1927.0039"},{"key":"e_1_3_2_33_1","unstructured":"Weijie Du and James P. Vary. 2023. Multi-nucleon structure and dynamics via quantum computing. arXiv:2304.04838 [nucl-th]."},{"key":"e_1_3_2_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.biosystems.2019.104012"},{"key":"e_1_3_2_35_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41592-020-01004-3"},{"key":"e_1_3_2_36_1","doi-asserted-by":"publisher","DOI":"10.1021\/acs.jctc.3c01043"},{"key":"e_1_3_2_37_1","doi-asserted-by":"publisher","unstructured":"Andrew Fagan and Ross Duncan. 2018. Optimising Clifford circuits with Quantomatic.. In Proceedings of the 15th International Conference on Quantum Physics and Logic QPL 2018 Halifax Nova Scotia 3-7 June 2018. doi:10.4204\/EPTCS.287.5","DOI":"10.4204\/EPTCS.287.5"},{"key":"e_1_3_2_38_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1057726"},{"key":"e_1_3_2_39_1","unstructured":"Edward Farhi Jeffrey Goldstone Sam Gutmann and Michael Sipser. 2000. Quantum Computation by Adiabatic Evolution.. arXiv:quant-ph\/0001106."},{"key":"e_1_3_2_40_1","doi-asserted-by":"publisher","DOI":"10.1038\/s43588-021-00024-z"},{"key":"e_1_3_2_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/0009-2614(94)00117-0"},{"key":"e_1_3_2_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01344458"},{"key":"e_1_3_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3571204"},{"key":"e_1_3_2_44_1","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/19\/9\/033"},{"key":"e_1_3_2_45_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-023-43785-z"},{"key":"e_1_3_2_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2005.1"},{"key":"e_1_3_2_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2011.01.015"},{"key":"e_1_3_2_48_1","unstructured":"Jonathan James Grattage. 2006. A functional quantum programming language.. Ph.D. Dissertation. University of Nottingham. http:\/\/eprints.nottingham.ac.uk\/10250\/"},{"key":"e_1_3_2_49_1","doi-asserted-by":"publisher","unstructured":"Alexander Green Peter LeFanu Lumsdaine Neil J. Ross Peter Selinger and Beno\u00eet Valiron. 2013. Quipper: A scalable quantum programming language.. In Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2013) 333\u2013342. doi:10.1145\/2491956.2462177","DOI":"10.1145\/2491956.2462177"},{"key":"e_1_3_2_50_1","doi-asserted-by":"publisher","DOI":"10.5555\/3179553.3179560"},{"key":"e_1_3_2_51_1","doi-asserted-by":"publisher","unstructured":"Kesha Hietala Robert Rand Shih-Han Hung Liyi Li and Michael Hicks. 2021. Proving Quantum Programs Correct. In Proceedings of the Conference on Interative Theorem Proving (ITP). doi:10.4230\/LIPIcs.ITP.2021.21.","DOI":"10.4230\/LIPIcs.ITP.2021.21"},{"key":"e_1_3_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3604630"},{"key":"e_1_3_2_53_1","unstructured":"D-Wave Quantum Systems Inc. 2025. D-Wave Quantum Systems Inc. https:\/\/www.dwavesys.com\/."},{"key":"e_1_3_2_54_1","unstructured":"Quantinuum Inc. 2025. InQuanto: Quantum Computational Chemistry. https:\/\/www.quantinuum.com\/products-solutions\/inquanto."},{"key":"e_1_3_2_55_1","unstructured":"David Ittah Thomas H\u00e4ner Vadym Kliuchnikov and Torsten Hoefler. 2021. Enabling Dataflow Optimization for Quantum Programs. arXiv e-prints Article arXiv:2101.11030 (Jan. 2021) arXiv:2101.11030 pages. arXiv:2101.11030 [quant-ph]."},{"key":"e_1_3_2_56_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2014.12.001"},{"key":"e_1_3_2_57_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cpc.2012.02.021"},{"key":"e_1_3_2_58_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cpc.2013.07.022"},{"key":"e_1_3_2_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01331938"},{"key":"e_1_3_2_60_1","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.77.062329"},{"key":"e_1_3_2_61_1","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.58.5355"},{"key":"e_1_3_2_62_1","doi-asserted-by":"publisher","unstructured":"Richard M. Karp. 1972. Reducibility among Combinatorial Problems. Springer US Boston MA 85\u2013103. doi:10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_3_2_63_1","unstructured":"Andrew D. King Alberto Nocera Marek M. Rams Jacek Dziarmaga Roeland Wiersema William Bernoudy Jack Raymond Nitin Kaushal Niclas Heinsdorf Richard Harris Kelly Boothby Fabio Altomare Andrew J. Berkley Martin Boschnak Kevin Chern Holly Christiani Samantha Cibere Jake Connor Martin H. Dehn Rahul Deshpande Sara Ejtemaee Pau Farr\u00e9 Kelsey Hamer Emile Hoskinson Shuiyuan Huang Mark W. Johnson Samuel Kortas Eric Ladizinsky Tony Lai Trevor Lanting Ryan Li Allison J. R. MacDonald Gaelen Marsden Catherine C. McGeoch Reza Molavi Richard Neufeld Mana Norouzpour Travis Oh Joel Pasvolsky Patrick Poitras Gabriel Poulin-Lamarre Thomas Prescott Mauricio Reis Chris Rich Mohammad Samani Benjamin Sheldan Anatoly Smirnov Edward Sterpka Berta Trullas Clavera Nicholas Tsai Mark Volkmann Alexander Whiticar Jed D. Whittaker Warren Wilkinson Jason Yao T. J. Yi Anders W. Sandvik Gonzalo Alvarez Roger G. Melko Juan Carrasquilla Marcel Franz and Mohammad H. Amin. 2024. Computational supremacy in quantum simulation. arXiv:2403.00910 [quant-ph]."},{"key":"e_1_3_2_64_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-014-9734-0"},{"key":"e_1_3_2_65_1","doi-asserted-by":"publisher","DOI":"10.3390\/e23050597"},{"key":"e_1_3_2_66_1","doi-asserted-by":"publisher","DOI":"10.1038\/nchem.483"},{"key":"e_1_3_2_67_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevB.67.245316"},{"key":"e_1_3_2_68_1","doi-asserted-by":"publisher","unstructured":"Liyi Li Finn Voichick Kesha Hietala Yuxiang Peng Xiaodi Wu and Michael Hicks. 2022. Verified Compilation of Quantum Oracles. In OOPSLA 2022. doi:10.48550\/ARXIV.2112.06700","DOI":"10.48550\/ARXIV.2112.06700"},{"key":"e_1_3_2_69_1","doi-asserted-by":"publisher","unstructured":"Liyi Li David Young James Bryan Graves Chandeepa Dissanayake and Amr Sabry. 2025. A Haskell Adiabatic DSL: Solving Classical Optimization Problems on Quantum Hardware. doi:10.5281\/zenodo.16227782","DOI":"10.5281\/zenodo.16227782"},{"key":"e_1_3_2_70_1","unstructured":"Liyi Li Mingwei Zhu Rance Cleaveland Alexander Nicolellis Yi Lee Le Chang and Xiaodi Wu. 2024. Qafny: A Quantum-Program Verifier. In ECOOP 2024."},{"key":"e_1_3_2_71_1","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ab8c2c"},{"key":"e_1_3_2_72_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-25543-5_12"},{"key":"e_1_3_2_73_1","doi-asserted-by":"publisher","DOI":"10.3389\/fphy.2014.00005"},{"key":"e_1_3_2_74_1","doi-asserted-by":"publisher","DOI":"10.3389\/fphy.2014.00005"},{"key":"e_1_3_2_75_1","doi-asserted-by":"publisher","DOI":"10.5555\/2230996.2230997"},{"key":"e_1_3_2_76_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.92.015003"},{"key":"e_1_3_2_77_1","doi-asserted-by":"crossref","unstructured":"Jarrod R. McClean Kevin J. Sung Ian D. Kivlichan Yudong Cao Chengyu Dai E. Schuyler Fried Craig Gidney Brendan Gimby Pranav Gokhale Thomas H\u00e4ner Tarini Hardikar Vojt\u011bch Havl\u00ed\u010dek Oscar Higgott Cupjin Huang Josh Izaac Zhang Jiang Xinle Liu Sam McArdle Matthew Neeley Thomas O\u2019Brien Bryan O\u2019Gorman Isil Ozfidan Maxwell D. Radin Jhonathan Romero Nicholas Rubin Nicolas P. D. Sawaya Kanav Setia Sukin Sim Damian S. Steiger Mark Steudtner Qiming Sun Wei Sun Daochen Wang Fang Zhang and Ryan Babbush. 2019. OpenFermion: The Electronic Structure Package for Quantum Computers. arXiv:1710.07629 [quant-ph] https:\/\/arxiv.org\/abs\/1710.07629","DOI":"10.1088\/2058-9565\/ab8ebc"},{"key":"e_1_3_2_78_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41534-018-0072-4"},{"key":"e_1_3_2_79_1","doi-asserted-by":"publisher","DOI":"10.5555\/1972505"},{"key":"e_1_3_2_80_1","doi-asserted-by":"publisher","DOI":"10.1002\/wcms.1481"},{"key":"e_1_3_2_81_1","doi-asserted-by":"publisher","DOI":"10.1145\/3632923"},{"key":"e_1_3_2_82_1","unstructured":"Robert Rand. 2018. Formally verified quantum programming. Ph.D. Dissertation. University of Pennsylvania."},{"key":"e_1_3_2_83_1","doi-asserted-by":"crossref","unstructured":"Robert Rand Jennifer Paykin Dong-Ho Lee and S. Zdancewic. 2018. ReQWIRE: Reasoning about Reversible Quantum Circuits. In QPL.","DOI":"10.4204\/EPTCS.287.17"},{"key":"e_1_3_2_84_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevB.39.11828"},{"key":"e_1_3_2_85_1","unstructured":"M. Reed and B. Simon. 1975. Methods of Modern Mathematical Physics. 2. Fourier Analysis Self-adjointness.."},{"key":"e_1_3_2_86_1","unstructured":"Rigetti Computing. 2019. The @rigetti optimizing Quil compiler. https:\/\/github.com\/rigetti\/quilc"},{"key":"e_1_3_2_87_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-89366-2_19"},{"key":"e_1_3_2_88_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.nuclphysb.2021.115601"},{"key":"e_1_3_2_89_1","doi-asserted-by":"publisher","unstructured":"Peter Selinger and Benot Valiron. 2013. Quantum Lambda Calculus. Semantic Techniques in Quantum Computation (01 2013). doi:10.1017\/CBO9781139193313.005","DOI":"10.1017\/CBO9781139193313.005"},{"key":"e_1_3_2_90_1","unstructured":"Yunong Shi Xupeng Li Runzhou Tao Ali Javadi-Abhari Andrew W. Cross Frederic T. Chong and Ronghui Gu. 2019. Contract-based verification of a realistic quantum compiler. arXiv e-prints (Aug 2019). arXiv:1908.08963 [quant-ph]."},{"key":"e_1_3_2_91_1","doi-asserted-by":"publisher","unstructured":"P.W. Shor. 1994. Algorithms for quantum computation: discrete logarithms and factoring. In Proceedings 35th Annual Symposium on Foundations of Computer Science. 124\u2013134. doi:10.1109\/SFCS.1994.365700","DOI":"10.1109\/SFCS.1994.365700"},{"key":"e_1_3_2_92_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2022-01-24-629"},{"key":"e_1_3_2_93_1","doi-asserted-by":"crossref","unstructured":"Robert S. Smith Eric C. Peterson Mark G. Skilbeck and Erik J. Davis. 2020. An Open-Source Industrial-Strength Optimizing Compiler for Quantum Programs. arXiv:2003.13961 [quant-ph].","DOI":"10.1088\/2058-9565\/ab9acb"},{"key":"e_1_3_2_94_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2018-01-31-49"},{"key":"e_1_3_2_95_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183895.3183901"},{"key":"e_1_3_2_96_1","doi-asserted-by":"publisher","DOI":"10.1137\/s0097539703432165"},{"key":"e_1_3_2_97_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40922-6_5"},{"key":"e_1_3_2_98_1","doi-asserted-by":"publisher","DOI":"10.1145\/3571225"},{"key":"e_1_3_2_99_1","unstructured":"Quanlong Wang. 2023. Completeness of the ZX-calculus. arXiv:2209.14894 [quant-ph]."},{"key":"e_1_3_2_100_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.54.235"},{"key":"e_1_3_2_101_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.67.2076"},{"key":"e_1_3_2_102_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519939.3523433"},{"key":"e_1_3_2_103_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049706.2049708"},{"key":"e_1_3_2_104_1","volume-title":"Foundations of Quantum Programming.","author":"Ying Mingsheng","year":"2016","unstructured":"Mingsheng Ying. 2016. Foundations of Quantum Programming. Elsevier Science, Cambridge, MA. xii + 357 pages."},{"key":"e_1_3_2_105_1","doi-asserted-by":"publisher","DOI":"10.1088\/1674-1056\/abd761"},{"key":"e_1_3_2_106_1","doi-asserted-by":"publisher","DOI":"10.1145\/3571222"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3747521","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3747521","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T10:00:58Z","timestamp":1784196058000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3747521"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,5]]},"references-count":105,"journal-issue":{"issue":"ICFP","published-print":{"date-parts":[[2025,8,5]]}},"alternative-id":["10.1145\/3747521"],"URL":"https:\/\/doi.org\/10.1145\/3747521","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,5]]},"assertion":[{"value":"2025-02-27","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-06-27","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-08-05","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}