{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:46:01Z","timestamp":1780994761864,"version":"3.54.1"},"reference-count":98,"publisher":"Association for Computing Machinery (ACM)","issue":"OOPSLA1","license":[{"start":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T00:00:00Z","timestamp":1714348800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2024,4,29]]},"abstract":"<jats:p>Quantum algorithms for tasks such as factorization, search, and simulation rely on control flow such as branching and iteration that depends on the value of data in superposition. High-level programming abstractions for control flow, such as switches, loops, higher-order functions, and continuations, are ubiquitous in classical languages. By contrast, many quantum languages do not provide high-level abstractions for control flow in superposition, and instead require the use of hardware-level logic gates to implement such control flow.<\/jats:p>\n          <jats:p>The reason for this gap is that whereas a classical computer supports control flow abstractions using a program counter that can depend on data, the typical architecture of a quantum computer does not analogously provide a program counter that can depend on data in superposition. As a result, the complete set of control flow abstractions that can be correctly realized on a quantum computer has not yet been established.<\/jats:p>\n          <jats:p>In this work, we provide a complete characterization of the properties of control flow abstractions that are correctly realizable on a quantum computer. First, we prove that even on a quantum computer whose program counter exists in superposition, one cannot correctly realize control flow in quantum algorithms by lifting the classical conditional jump instruction to work in superposition. This theorem denies the ability to directly lift general abstractions for control flow such as the \u03bb-calculus from classical to quantum programming.<\/jats:p>\n          <jats:p>In response, we present the necessary and sufficient conditions for control flow to be correctly realizable on a quantum computer. We introduce the quantum control machine, an instruction set architecture featuring a conditional jump that is restricted to satisfy these conditions. We show how this design enables a developer to correctly express control flow in quantum algorithms using a program counter in place of logic gates.<\/jats:p>","DOI":"10.1145\/3649811","type":"journal-article","created":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T17:53:50Z","timestamp":1714413230000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Quantum Control Machine: The Limits of Control Flow in Quantum Programming"],"prefix":"10.1145","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4918-4467","authenticated-orcid":false,"given":"Charles","family":"Yuan","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-3121-2537","authenticated-orcid":false,"given":"Agnes","family":"Villanyi","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6928-0456","authenticated-orcid":false,"given":"Michael","family":"Carbin","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,4,29]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.79.2586"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.83.5162"},{"key":"e_1_2_2_3_1","volume-title":"Quantum Walks on Graphs. In ACM Symposium on Theory of Computing. https:\/\/doi.org\/10","author":"Aharonov Dorit","year":"2001","unstructured":"Dorit Aharonov, Andris Ambainis, Julia Kempe, and Umesh Vazirani. 2001. Quantum Walks on Graphs. In ACM Symposium on Theory of Computing. https:\/\/doi.org\/10.1145\/380752.380758 10.1145\/380752.380758"},{"key":"e_1_2_2_4_1","volume-title":"IEEE Symposium on Logic in Computer Science. https:\/\/doi.org\/10","author":"Altenkirch Thorsten","year":"2005","unstructured":"Thorsten Altenkirch and J. Grattage. 2005. A Functional Quantum Programming Language. In IEEE Symposium on Logic in Computer Science. https:\/\/doi.org\/10.1109\/LICS.2005.1 10.1109\/LICS.2005.1"},{"key":"e_1_2_2_5_1","volume-title":"IEEE Symposium on Foundations of Computer Science. https:\/\/doi.org\/10","author":"Ambainis Andris","year":"2004","unstructured":"Andris Ambainis. 2004. Quantum walk algorithm for element distinctness. In IEEE Symposium on Foundations of Computer Science. https:\/\/doi.org\/10.1109\/FOCS.2004.54 10.1109\/FOCS.2004.54"},{"key":"e_1_2_2_6_1","volume-title":"One-Dimensional Quantum Walks. In ACM Symposium on Theory of Computing. https:\/\/doi.org\/10","author":"Ambainis Andris","year":"2001","unstructured":"Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin Vishwanath, and John Watrous. 2001. One-Dimensional Quantum Walks. In ACM Symposium on Theory of Computing. https:\/\/doi.org\/10.1145\/380752.380757 10.1145\/380752.380757"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/080712167"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2017.04.001"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630"},{"key":"e_1_2_2_12_1","volume-title":"International Conference on Compiler Construction. https:\/\/doi.org\/10","author":"Axelsen Holger Bock","year":"2011","unstructured":"Holger Bock Axelsen. 2011. Clean Translation of an Imperative Reversible Programming Language. In International Conference on Compiler Construction. https:\/\/doi.org\/10.1007\/978-3-642-19861-8_9 10.1007\/978-3-642-19861-8_9"},{"key":"e_1_2_2_13_1","volume-title":"Reversible Machine Code and Its Abstract Processor Architecture. In International Conference on Computer Science: Theory and Applications. https:\/\/doi.org\/10","author":"Axelsen Holger Bock","year":"2007","unstructured":"Holger Bock Axelsen, Robert Gl\u00fcck, and Tetsuo Yokoyama. 2007. Reversible Machine Code and Its Abstract Processor Architecture. In International Conference on Computer Science: Theory and Applications. https:\/\/doi.org\/10.1007\/978-3-540-74510-5_9 10.1007\/978-3-540-74510-5_9"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.8.041015"},{"key":"e_1_2_2_15_1","volume-title":"ACM SIGPLAN Symposium on Principles of Programming Languages. https:\/\/doi.org\/10","author":"Barthe Gilles","year":"2019","unstructured":"Gilles Barthe, Sandrine Blazy, Benjamin Gr\u00e9goire, R\u00e9mi Hutin, Vincent Laporte, David Pichardie, and Alix Trieu. 2019. Formal Verification of a Constant-Time Preserving C Compiler. In ACM SIGPLAN Symposium on Principles of Programming Languages. https:\/\/doi.org\/10.1145\/3371075 10.1145\/3371075"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysicsPhysiqueFizika.1.195"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.176.0525"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796300921"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2019-12-02-208"},{"key":"e_1_2_2_20_1","volume-title":"Silq: A High-Level Quantum Language with Safe Uncomputation and Intuitive Semantics. In ACM SIGPLAN Conference on Programming Language Design and Implementation. https:\/\/doi.org\/10","author":"Bichsel Benjamin","year":"2020","unstructured":"Benjamin Bichsel, Maximilian Baader, Timon Gehr, and Martin Vechev. 2020. Silq: A High-Level Quantum Language with Safe Uncomputation and Intuitive Semantics. In ACM SIGPLAN Conference on Programming Language Design and Implementation. https:\/\/doi.org\/10.1145\/3385412.3386007 10.1145\/3385412.3386007"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1049\/el:20020949"},{"key":"e_1_2_2_22_1","volume-title":"Proceedings of the National Academy of Sciences, 115","author":"Childs Andrew M.","year":"2018","unstructured":"Andrew M. Childs, Dmitri Maslov, Yunseong Nam, Neil J. Ross, and Yuan Su. 2018. Toward the first quantum simulation with quantum speedup. Proceedings of the National Academy of Sciences, 115, 38 (2018), Sep, https:\/\/doi.org\/10.1073\/pnas.1801723115 10.1073\/pnas.1801723115"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","unstructured":"Andrew M. Childs Ben W. Reichardt Robert Spalek and Shengyu Zhang. 2007. Every NAND formula of size N can be evaluated in time N^1\/2+o(1) on a quantum computer. https:\/\/doi.org\/10.48550\/ARXIV.QUANT-PH\/0703015 arxiv:0703015.","DOI":"10.48550\/ARXIV.QUANT-PH"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.26421\/qic12.11-12"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.88.022318"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3039167"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","unstructured":"Alonzo Church. 1941. The Calculi of Lambda Conversion. https:\/\/doi.org\/10.1515\/9781400881932 10.1515\/9781400881932","DOI":"10.1515\/9781400881932"},{"key":"e_1_2_2_28_1","volume-title":"Full Abstraction for the Quantum Lambda-Calculus. In ACM SIGPLAN Symposium on Principles of Programming Languages. https:\/\/doi.org\/10","author":"Clairambault Pierre","year":"2019","unstructured":"Pierre Clairambault and Marc de Visme. 2019. Full Abstraction for the Quantum Lambda-Calculus. In ACM SIGPLAN Symposium on Principles of Programming Languages. https:\/\/doi.org\/10.1145\/3371131 10.1145\/3371131"},{"key":"e_1_2_2_29_1","volume-title":"Game Semantics for Quantum Programming. In ACM SIGPLAN Symposium on Principles of Programming Languages. https:\/\/doi.org\/10","author":"Clairambault Pierre","year":"2019","unstructured":"Pierre Clairambault, Marc De Visme, and Glynn Winskel. 2019. Game Semantics for Quantum Programming. In ACM SIGPLAN Symposium on Principles of Programming Languages. https:\/\/doi.org\/10.1145\/3290345 10.1145\/3290345"},{"key":"e_1_2_2_30_1","volume-title":"Proceedings of the Royal Society A, 400","author":"Deutsch David","year":"1985","unstructured":"David Deutsch. 1985. Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society A, 400, 1818 (1985), https:\/\/doi.org\/10.1098\/rspa.1985.0070 10.1098\/rspa.1985.0070"},{"key":"e_1_2_2_31_1","volume-title":"On Reversible Combinatory Logic. In International Workshop on Developments in Computational Models. https:\/\/doi.org\/10","author":"Pierro Alessandra Di","year":"2006","unstructured":"Alessandra Di Pierro, Chris Hankin, and Herbert Wiklicky. 2006. On Reversible Combinatory Logic. In International Workshop on Developments in Computational Models. https:\/\/doi.org\/10.1016\/j.entcs.2005.09.018 10.1016\/j.entcs.2005.09.018"},{"key":"e_1_2_2_32_1","volume-title":"Realizability in the Unitary Sphere. In ACM\/IEEE Symposium on Logic in Computer Science. https:\/\/doi.org\/10","author":"D\u00edaz-Caro Alejandro","year":"2019","unstructured":"Alejandro D\u00edaz-Caro, Mauricio Guillermo, Alexandre Miquel, and Beno\u00eet Valiron. 2019. Realizability in the Unitary Sphere. In ACM\/IEEE Symposium on Logic in Computer Science. https:\/\/doi.org\/10.1109\/LICS.2019.8785834 10.1109\/LICS.2019.8785834"},{"key":"e_1_2_2_33_1","unstructured":"Thomas G. Draper. 2000. Addition on a Quantum Computer. arxiv:quant-ph\/0008033."},{"key":"e_1_2_2_34_1","volume-title":"Reversibility for Efficient Computing. Ph. D. Dissertation","author":"Frank Michael","unstructured":"Michael Frank. 1999. Reversibility for Efficient Computing. Ph. D. Dissertation. Massachusetts Institute of Technology. https:\/\/doi.org\/1721.1\/9464"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.100.160501"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"e_1_2_2_37_1","volume-title":"Quipper: A Scalable Quantum Programming Language. In ACM SIGPLAN Conference on Programming Language Design and Implementation. https:\/\/doi.org\/10","author":"Green Alexander S.","year":"2013","unstructured":"Alexander S. Green, Peter LeFanu Lumsdaine, Neil J. Ross, Peter Selinger, and Beno\u00eet Valiron. 2013. Quipper: A Scalable Quantum Programming Language. In ACM SIGPLAN Conference on Programming Language Design and Implementation. https:\/\/doi.org\/10.1145\/2491956.2462177 10.1145\/2491956.2462177"},{"key":"e_1_2_2_38_1","volume-title":"ACM Symposium on Theory of Computing. https:\/\/doi.org\/10","author":"Grover Lov K.","year":"1996","unstructured":"Lov K. Grover. 1996. A Fast Quantum Mechanical Algorithm for Database Search. In ACM Symposium on Theory of Computing. https:\/\/doi.org\/10.1145\/237814.237866 10.1145\/237814.237866"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.103.150502"},{"key":"e_1_2_2_40_1","volume-title":"Games for Logic and Programming Languages Workshop. https:\/\/doi.org\/10","author":"Hasuo Ichiro","year":"2017","unstructured":"Ichiro Hasuo and Naohiko Hoshino. 2017. Semantics of higher-order quantum computation via geometry of interaction. In Games for Logic and Programming Languages Workshop. https:\/\/doi.org\/10.1016\/j.apal.2016.10.010 10.1016\/j.apal.2016.10.010"},{"key":"e_1_2_2_41_1","volume-title":"ACM SIGPLAN Symposium on Principles of Programming Languages. https:\/\/doi.org\/10","author":"Hietala Kesha","year":"2021","unstructured":"Kesha Hietala, Robert Rand, Shih-Han Hung, Xiaodi Wu, and Michael Hicks. 2021. A Verified Optimizer for Quantum circuits. In ACM SIGPLAN Symposium on Principles of Programming Languages. https:\/\/doi.org\/10.1145\/3434318 10.1145\/3434318"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.07.015"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","unstructured":"Peter Hines. 2011. Can a Quantum Computer Run the von Neumann Architecture? In New Structures for Physics. https:\/\/doi.org\/10.1007\/978-3-642-12821-9_14 10.1007\/978-3-642-12821-9_14","DOI":"10.1007\/978-3-642-12821-9_14"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.3923\/itj.2009.208.213"},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.QUANT-PH"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","unstructured":"A. Yu. Kitaev. 1995. Quantum measurements and the Abelian Stabilizer Problem. https:\/\/doi.org\/10.48550\/arXiv.quant-ph\/9511026 arxiv:quant-ph\/9511026.","DOI":"10.48550\/arXiv.quant-ph"},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1070\/RM1997V052N06ABEH002155"},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2001.08838"},{"key":"e_1_2_2_49_1","first-page":"340","volume-title":"Quantum CPOs. Electronic Proceedings in Theoretical Computer Science","author":"Kornell Andre","year":"2021","unstructured":"Andre Kornell, Bert Lindenhovius, and Michael Mislove. 2021. Quantum CPOs. Electronic Proceedings in Theoretical Computer Science, 340 (2021), Sep, https:\/\/doi.org\/10.4204\/eptcs.340.9 10.4204\/eptcs.340.9"},{"key":"e_1_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.79.052322"},{"key":"e_1_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.53.0183"},{"key":"e_1_2_2_52_1","volume-title":"Projection-Based Runtime Assertions for Testing and Debugging Quantum Programs. In ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications. https:\/\/doi.org\/10","author":"Li Gushu","year":"2020","unstructured":"Gushu Li, Li Zhou, Nengkun Yu, Yufei Ding, Mingsheng Ying, and Yuan Xie. 2020. Projection-Based Runtime Assertions for Testing and Debugging Quantum Programs. In ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications. https:\/\/doi.org\/10.1145\/3428218 10.1145\/3428218"},{"key":"e_1_2_2_53_1","doi-asserted-by":"publisher","unstructured":"Noah Linden and Sandu Popescu. 1998. The Halting Problem for Quantum Computers. https:\/\/doi.org\/10.48550\/ARXIV.QUANT-PH\/9806054 arxiv:9806054.","DOI":"10.48550\/ARXIV.QUANT-PH"},{"key":"e_1_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms10138"},{"key":"e_1_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2019-07-12-163"},{"key":"e_1_2_2_56_1","doi-asserted-by":"publisher","unstructured":"Guang Hao Low Vadym Kliuchnikov and Luke Schaeffer. 2018. Trading T-gates for dirty qubits in state preparation and unitary synthesis. https:\/\/doi.org\/10.48550\/arXiv.1812.00954 arxiv:1812.00954.","DOI":"10.48550\/arXiv.1812.00954"},{"key":"e_1_2_2_57_1","doi-asserted-by":"publisher","unstructured":"Octavio Malherbe Philip Scott and Peter Selinger. 2013. Presheaf Models of Quantum Computation: An Outline. In Computation Logic Games and Quantum Foundations. The Many Facets of Samson Abramsky. https:\/\/doi.org\/10.1007\/978-3-642-38164-5_13 10.1007\/978-3-642-38164-5_13","DOI":"10.1007\/978-3-642-38164-5_13"},{"key":"e_1_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/tqe.2020.2965803"},{"key":"e_1_2_2_59_1","doi-asserted-by":"publisher","unstructured":"Florian Meier Marcus Huber Paul Erker and Jake Xuereb. 2024. Autonomous Quantum Processing Unit: What does it take to construct a self-contained model for quantum computation? https:\/\/doi.org\/10.48550\/arXiv.2402.00111 arxiv:2402.00111.","DOI":"10.48550\/arXiv.2402.00111"},{"key":"e_1_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.78.1823"},{"key":"e_1_2_2_61_1","volume-title":"ACM Symposium on Theory of Computing. https:\/\/doi.org\/10","author":"Naor Moni","year":"2001","unstructured":"Moni Naor and Vanessa Teague. 2001. Anti-persistence: History independent data structures. In ACM Symposium on Theory of Computing. https:\/\/doi.org\/10.1145\/380752.380844 10.1145\/380752.380844"},{"key":"e_1_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.79.321"},{"key":"e_1_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511976667"},{"key":"e_1_2_2_64_1","volume-title":"ACM SIGPLAN Symposium on Principles of Programming Languages. https:\/\/doi.org\/10","author":"Pagani Michele","year":"2014","unstructured":"Michele Pagani, Peter Selinger, and Beno\u00eet Valiron. 2014. Applying Quantitative Semantics to Higher-Order Quantum Computing. In ACM SIGPLAN Symposium on Principles of Programming Languages. https:\/\/doi.org\/10.1145\/2535838.2535879 10.1145\/2535838.2535879"},{"key":"e_1_2_2_65_1","doi-asserted-by":"publisher","unstructured":"Abhinandan Pal and Anubhab Ghosh. 2022. Qiwi: A Beginner Friendly Quantum Language. In Companion Proceedings of the ACM SIGPLAN International Conference on Systems Programming Languages and Applications: Software for Humanity. https:\/\/doi.org\/10.1145\/3563768.3563959 10.1145\/3563768.3563959","DOI":"10.1145\/3563768.3563959"},{"key":"e_1_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.102.032608"},{"key":"e_1_2_2_67_1","doi-asserted-by":"publisher","unstructured":"A. Pati and S. Braunstein. 2000. Impossibility of deleting an unknown quantum state. Nature 404 (2000) https:\/\/doi.org\/10.1038\/404130b0 10.1038\/404130b0","DOI":"10.1038\/404130b0"},{"key":"e_1_2_2_68_1","volume-title":"QWIRE: A Core Language for Quantum Circuits. In ACM SIGPLAN Symposium on Principles of Programming Languages. https:\/\/doi.org\/10","author":"Paykin Jennifer","year":"2017","unstructured":"Jennifer Paykin, Robert Rand, and Steve Zdancewic. 2017. QWIRE: A Core Language for Quantum Circuits. In ACM SIGPLAN Symposium on Principles of Programming Languages. https:\/\/doi.org\/10.1145\/3009837.3009894 10.1145\/3009837.3009894"},{"key":"e_1_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/322123.322138"},{"key":"e_1_2_2_70_1","volume-title":"Shor\u2019s Discrete Logarithm Quantum Algorithm for Elliptic Curves. Quantum Information and Computation, 3, 4","author":"Proos John","year":"2003","unstructured":"John Proos and Christof Zalka. 2003. Shor\u2019s Discrete Logarithm Quantum Algorithm for Elliptic Curves. Quantum Information and Computation, 3, 4 (2003), Jul."},{"key":"e_1_2_2_71_1","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.2573505"},{"key":"e_1_2_2_72_1","volume-title":"Classical Control and Quantum Circuits in Enriched Category Theory. In Conference on the Mathematical Foundations of Programming Semantics. https:\/\/doi.org\/10","author":"Rennela Mathys","year":"2018","unstructured":"Mathys Rennela and Sam Staton. 2018. Classical Control and Quantum Circuits in Enriched Category Theory. In Conference on the Mathematical Foundations of Programming Semantics. https:\/\/doi.org\/10.1016\/j.entcs.2018.03.027 10.1016\/j.entcs.2018.03.027"},{"key":"e_1_2_2_73_1","first-page":"236","volume-title":"Electronic Proceedings in Theoretical Computer Science","author":"Rennela Mathys","year":"2017","unstructured":"Mathys Rennela, Sam Staton, and Robert Furber. 2017. Infinite-Dimensionality in Quantum Foundations: W*-algebras as Presheaves over Matrix Algebras. Electronic Proceedings in Theoretical Computer Science, 236 (2017), Jan, https:\/\/doi.org\/10.4204\/eptcs.236.11 10.4204\/eptcs.236.11"},{"key":"e_1_2_2_74_1","doi-asserted-by":"publisher","unstructured":"Rich Rines and Isaac Chuang. 2018. High Performance Quantum Modular Multipliers. https:\/\/doi.org\/10.48550\/arXiv.1801.01081 arxiv:1801.01081.","DOI":"10.48550\/arXiv.1801.01081"},{"key":"e_1_2_2_75_1","volume-title":"International Conference on Foundations of Software Science and Computation Structures. https:\/\/doi.org\/10","author":"Sabry Amr","year":"2018","unstructured":"Amr Sabry, Beno\u00eet Valiron, and Juliana Kaizer Vizzotto. 2018. From Symmetric Pattern-Matching to Quantum Control. In International Conference on Foundations of Software Science and Computation Structures. https:\/\/doi.org\/10.1007\/978-3-319-89366-2_19 10.1007\/978-3-319-89366-2_19"},{"key":"e_1_2_2_76_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129504004256"},{"key":"e_1_2_2_77_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19835-9_34"},{"key":"e_1_2_2_78_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.67.052307"},{"key":"e_1_2_2_79_1","doi-asserted-by":"publisher","DOI":"10.26421\/QIC3.1-7"},{"key":"e_1_2_2_80_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"e_1_2_2_81_1","volume-title":"Cartesian Hoare Logic for Verifying K-Safety Properties. In ACM SIGPLAN Conference on Programming Language Design and Implementation. https:\/\/doi.org\/10","author":"Sousa Marcelo","year":"2016","unstructured":"Marcelo Sousa and Isil Dillig. 2016. Cartesian Hoare Logic for Verifying K-Safety Properties. In ACM SIGPLAN Conference on Programming Language Design and Implementation. https:\/\/doi.org\/10.1145\/2908080.2908092 10.1145\/2908080.2908092"},{"key":"e_1_2_2_82_1","volume-title":"Real World Domain Specific Languages Workshop. https:\/\/doi.org\/10","author":"Svore Krysta","year":"2018","unstructured":"Krysta Svore, Martin Roetteler, Alan Geller, Matthias Troyer, John Azariah, Christopher Granade, Bettina Heim, Vadym Kliuchnikov, Mariia Mykhailova, and Andres Paz. 2018. Q#: Enabling Scalable Quantum Computing and Development with a High-level DSL. In Real World Domain Specific Languages Workshop. https:\/\/doi.org\/10.1145\/3183895.3183901 10.1145\/3183895.3183901"},{"key":"e_1_2_2_83_1","volume-title":"Conference on Reversible Computation. https:\/\/doi.org\/10","author":"Thomsen Michael Kirkedal","year":"2012","unstructured":"Michael Kirkedal Thomsen, Holger Bock Axelsen, and Robert Gl\u00fcck. 2012. A Reversible Processor Architecture and Its Reversible Logic Design. In Conference on Reversible Computation. https:\/\/doi.org\/10.1007\/978-3-642-29517-1_3 10.1007\/978-3-642-29517-1_3"},{"key":"e_1_2_2_84_1","volume-title":"Quantum Relational Hoare Logic. In ACM SIGPLAN Symposium on Principles of Programming Languages. https:\/\/doi.org\/10","author":"Unruh Dominique","year":"2019","unstructured":"Dominique Unruh. 2019. Quantum Relational Hoare Logic. In ACM SIGPLAN Symposium on Principles of Programming Languages. https:\/\/doi.org\/10.1145\/3290346 10.1145\/3290346"},{"key":"e_1_2_2_85_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703432165"},{"key":"e_1_2_2_86_1","volume-title":"Power-Driven Microarchitecture Workshop.","author":"Vieri Carlin","year":"1998","unstructured":"Carlin Vieri, M. Ammer, Michael Frank, Norman Margolus, and Tom Knight. 1998. A Fully Reversible Asymptotically Zero Energy Microprocessor. In Power-Driven Microarchitecture Workshop."},{"key":"e_1_2_2_87_1","volume-title":"Qunity: A Unified Language for Quantum and Classical Computing. In ACM SIGPLAN Symposium on Principles of Programming Languages. https:\/\/doi.org\/10","author":"Voichick Finn","year":"2023","unstructured":"Finn Voichick, Liyi Li, Robert Rand, and Michael Hicks. 2023. Qunity: A Unified Language for Quantum and Classical Computing. In ACM SIGPLAN Symposium on Principles of Programming Languages. https:\/\/doi.org\/10.1145\/3571225 10.1145\/3571225"},{"key":"e_1_2_2_88_1","doi-asserted-by":"publisher","DOI":"10.1088\/1572-9494"},{"key":"e_1_2_2_89_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.109.050505"},{"key":"e_1_2_2_90_1","doi-asserted-by":"publisher","unstructured":"W. Wootters and W. Zurek. 1982. A single quantum cannot be cloned. Nature 299 (1982) https:\/\/doi.org\/10.1038\/299802a0 10.1038\/299802a0","DOI":"10.1038\/299802a0"},{"key":"e_1_2_2_91_1","doi-asserted-by":"publisher","unstructured":"Mingsheng Ying. 2014. Quantum Recursion and Second Quantisation. https:\/\/doi.org\/10.48550\/ARXIV.1405.4443 arxiv:1405.4443.","DOI":"10.48550\/ARXIV.1405.4443"},{"key":"e_1_2_2_92_1","doi-asserted-by":"publisher","unstructured":"Mingsheng Ying and Yuan Feng. 2010. Quantum Loop Programs. Acta Informatica https:\/\/doi.org\/10.1007\/s00236-010-0117-4 10.1007\/s00236-010-0117-4","DOI":"10.1007\/s00236-010-0117-4"},{"key":"e_1_2_2_93_1","doi-asserted-by":"publisher","unstructured":"Mingsheng Ying Nengkun Yu and Yuan Feng. 2012. Defining Quantum Control Flow. https:\/\/doi.org\/10.48550\/ARXIV.1209.4379 arxiv:1209.4379.","DOI":"10.48550\/ARXIV.1209.4379"},{"key":"e_1_2_2_94_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_22"},{"key":"e_1_2_2_95_1","volume-title":"Quantum Abstract Interpretation. In ACM SIGPLAN Conference on Programming Language Design and Implementation. https:\/\/doi.org\/10","author":"Yu Nengkun","year":"2021","unstructured":"Nengkun Yu and Jens Palsberg. 2021. Quantum Abstract Interpretation. In ACM SIGPLAN Conference on Programming Language Design and Implementation. https:\/\/doi.org\/10.1145\/3410291 10.1145\/3410291"},{"key":"e_1_2_2_96_1","volume-title":"Tower: Data Structures in Quantum Superposition. In ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications. https:\/\/doi.org\/10","author":"Yuan Charles","year":"2022","unstructured":"Charles Yuan and Michael Carbin. 2022. Tower: Data Structures in Quantum Superposition. In ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications. https:\/\/doi.org\/10.1145\/3563297 10.1145\/3563297"},{"key":"e_1_2_2_97_1","volume-title":"Twist: Sound Reasoning for Purity and Entanglement in Quantum Programs. In ACM SIGPLAN Symposium on Principles of Programming Languages. https:\/\/doi.org\/10","author":"Yuan Charles","year":"2022","unstructured":"Charles Yuan, Christopher McNally, and Michael Carbin. 2022. Twist: Sound Reasoning for Purity and Entanglement in Quantum Programs. In ACM SIGPLAN Symposium on Principles of Programming Languages. https:\/\/doi.org\/10.1145\/3498691 10.1145\/3498691"},{"key":"e_1_2_2_98_1","doi-asserted-by":"publisher","unstructured":"Charles Yuan Agnes Villanyi and Michael Carbin. 2024. Quantum Control Machine: The Limits of Control Flow in Quantum Programming. https:\/\/doi.org\/10.5281\/zenodo.10452601 10.5281\/zenodo.10452601","DOI":"10.5281\/zenodo.10452601"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649811","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3649811","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:54:06Z","timestamp":1750287246000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649811"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,29]]},"references-count":98,"journal-issue":{"issue":"OOPSLA1","published-print":{"date-parts":[[2024,4,29]]}},"alternative-id":["10.1145\/3649811"],"URL":"https:\/\/doi.org\/10.1145\/3649811","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,29]]},"assertion":[{"value":"2024-04-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}