{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T15:34:48Z","timestamp":1772724888543,"version":"3.50.1"},"reference-count":79,"publisher":"Association for Computing Machinery (ACM)","issue":"PLDI","license":[{"start":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T00:00:00Z","timestamp":1718841600000},"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,6,20]]},"abstract":"<jats:p>\n            Numerous quantum algorithms require the use of quantum error correction to overcome the intrinsic unreliability of physical qubits. However, quantum error correction imposes a unique performance bottleneck, known as\n            <jats:inline-formula>\n              <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" overflow=\"scroll\">\n                <mml:mi>T<\/mml:mi>\n              <\/mml:math>\n            <\/jats:inline-formula>\n            -complexity, that can make an implementation of an algorithm as a quantum program run more slowly than on idealized hardware. In this work, we identify that programming abstractions for control flow, such as the quantum if-statement, can introduce polynomial increases in the\n            <jats:inline-formula>\n              <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" overflow=\"scroll\">\n                <mml:mi>T<\/mml:mi>\n              <\/mml:math>\n            <\/jats:inline-formula>\n            -complexity of a program. If not mitigated, this slowdown can diminish the computational advantage of a quantum algorithm.\n          <\/jats:p>\n          <jats:p>\n            To enable reasoning about the costs of control flow, we present a cost model that a developer can use to accurately analyze the\n            <jats:inline-formula>\n              <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" overflow=\"scroll\">\n                <mml:mi>T<\/mml:mi>\n              <\/mml:math>\n            <\/jats:inline-formula>\n            -complexity of a program under quantum error correction and pinpoint the sources of slowdown. To enable the mitigation of these costs, we present a set of program-level optimizations that a developer can use to rewrite a program to reduce its\n            <jats:inline-formula>\n              <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" overflow=\"scroll\">\n                <mml:mi>T<\/mml:mi>\n              <\/mml:math>\n            <\/jats:inline-formula>\n            -complexity, predict the\n            <jats:inline-formula>\n              <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" overflow=\"scroll\">\n                <mml:mi>T<\/mml:mi>\n              <\/mml:math>\n            <\/jats:inline-formula>\n            -complexity of the optimized program using the cost model, and then compile it to an efficient circuit via a straightforward strategy.\n          <\/jats:p>\n          <jats:p>\n            We implement the program-level optimizations in Spire, an extension of the Tower quantum compiler. Using a set of 11 benchmark programs that use control flow, we empirically show that the cost model is accurate, and that Spire's optimizations recover programs that are asymptotically efficient, meaning their runtime\n            <jats:inline-formula>\n              <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" overflow=\"scroll\">\n                <mml:mi>T<\/mml:mi>\n              <\/mml:math>\n            <\/jats:inline-formula>\n            -complexity under error correction is equal to their time complexity on idealized hardware.\n          <\/jats:p>\n          <jats:p>\n            Our results show that optimizing a program before it is compiled to a circuit can yield better results than compiling the program to an inefficient circuit and then invoking a quantum circuit optimizer found in prior work. For our benchmarks, only 2 of 8 tested quantum circuit optimizers recover circuits with asymptotically efficient\n            <jats:inline-formula>\n              <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" overflow=\"scroll\">\n                <mml:mi>T<\/mml:mi>\n              <\/mml:math>\n            <\/jats:inline-formula>\n            -complexity. Compared to these 2 optimizers, Spire uses\n            <jats:inline-formula>\n              <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" overflow=\"scroll\">\n                <mml:mn>54<\/mml:mn>\n                <mml:mo>\u00d7<\/mml:mo>\n                <mml:mo>\u2212<\/mml:mo>\n                <mml:mn>2400<\/mml:mn>\n                <mml:mo>\u00d7<\/mml:mo>\n              <\/mml:math>\n            <\/jats:inline-formula>\n            less compile time.\n          <\/jats:p>","DOI":"10.1145\/3656397","type":"journal-article","created":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T16:27:20Z","timestamp":1718900840000},"page":"492-517","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["The T-Complexity Costs of Error Correction for Control Flow in Quantum Computation"],"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":[{"role":"author","vocabulary":"crossref"}]},{"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":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,20]]},"reference":[{"key":"e_1_3_2_2_1","doi-asserted-by":"publisher","unstructured":"Scott Aaronson Nai-Hui Chia Han-Hsuan Lin Chunhao Wang and Ruizhe Zhang. 2020. On the Quantum Complexity of Closest Pair and Related Problems. In Computational Complexity. https:\/\/doi.org\/10.4230\/LIPIcs.CCC.2020.16 10.4230\/LIPIcs.CCC.2020.16","DOI":"10.4230\/LIPIcs.CCC.2020.16"},{"key":"e_1_3_2_3_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.79.2586"},{"key":"e_1_3_2_4_1","doi-asserted-by":"publisher","unstructured":"Thorsten Altenkirch and J. Grattage. 2005. A Functional Quantum Programming Language. In ACM\/IEEE Symposium on Logic in Computer Science. https:\/\/doi.org\/10.1109\/LICS.2005.1 10.1109\/LICS.2005.1","DOI":"10.1109\/LICS.2005.1"},{"key":"e_1_3_2_5_1","doi-asserted-by":"publisher","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","DOI":"10.1109\/FOCS.2004.54"},{"key":"e_1_3_2_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/080712167"},{"key":"e_1_3_2_7_1","unstructured":"Matthew Amy. 2024. Feynman: Quantum circuit analysis toolkit. https:\/\/github.com\/meamy\/feynman."},{"key":"e_1_3_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2014.2341953"},{"key":"e_1_3_2_9_1","doi-asserted-by":"publisher","unstructured":"Martin Avanzini Georg Moser Romain Pechoux Simon Perdrix and Vladimir Zamdzhiev. 2022. Quantum Expectation Transformers for Cost Analysis. In ACM\/IEEE Symposium on Logic in Computer Science. https:\/\/doi.org\/10.1145\/3531130.3533332 10.1145\/3531130.3533332","DOI":"10.1145\/3531130.3533332"},{"key":"e_1_3_2_10_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.8.041015"},{"key":"e_1_3_2_11_1","doi-asserted-by":"publisher","unstructured":"Ryan Babbush Jarrod R. McClean Michael Newman Craig Gidney Sergio Boixo and Hartmut Neven. 2021. Focus beyond Quadratic Speedups for Error-Corrected Quantum Advantage. PRX Quantum 2 (Mar 2021). Issue 1. https:\/\/doi.org\/10.1103\/PRXQuantum.2.010103 10.1103\/PRXQuantum.2.010103","DOI":"10.1103\/PRXQuantum.2.010103"},{"key":"e_1_3_2_12_1","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.52.3457"},{"key":"e_1_3_2_13_1","doi-asserted-by":"publisher","unstructured":"J. S. Bell. 1964. On the Einstein Podolsky Rosen paradox. Physics 1 (Nov 1964). Issue 3. https:\/\/doi.org\/10.1103\/PhysicsPhysiqueFizika.1.195 10.1103\/PhysicsPhysiqueFizika.1.195","DOI":"10.1103\/PhysicsPhysiqueFizika.1.195"},{"key":"e_1_3_2_14_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.176.0525"},{"key":"e_1_3_2_15_1","doi-asserted-by":"publisher","unstructured":"Charles H. Bennett and Gilles Brassard. 2014. Quantum cryptography: Public key distribution and coin tossing. Theoretical Computer Science 560 (2014). https:\/\/doi.org\/10.1016\/j.tcs.2014.05.025 10.1016\/j.tcs.2014.05.025","DOI":"10.1016\/j.tcs.2014.05.025"},{"key":"e_1_3_2_16_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.70.1895"},{"key":"e_1_3_2_17_1","doi-asserted-by":"publisher","unstructured":"Daniel J. Bernstein Stacey Jeffery Tanja Lange and Alexander Meurer. 2013. Quantum Algorithms for the Subset-Sum Problem. In Post-Quantum Cryptography. https:\/\/doi.org\/10.1007\/978-3-642-38616-9_2 10.1007\/978-3-642-38616-9_2","DOI":"10.1007\/978-3-642-38616-9_2"},{"key":"e_1_3_2_18_1","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ab8963"},{"key":"e_1_3_2_19_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature23474"},{"key":"e_1_3_2_20_1","doi-asserted-by":"publisher","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","DOI":"10.1145\/3385412.3386007"},{"key":"e_1_3_2_21_1","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/305\/05215"},{"key":"e_1_3_2_22_1","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.71.022316"},{"key":"e_1_3_2_23_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2021-11-16-580"},{"key":"e_1_3_2_24_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1801723115"},{"key":"e_1_3_2_25_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 N1\/2+o1 on a quantum computer. https:\/\/doi.org\/10.48550\/ARXIV.QUANT-PH\/0703015 10.48550\/ARXIV.QUANT-PH\/0703015 arXiv:0703015 [quant-ph]","DOI":"10.48550\/ARXIV.QUANT-PH\/0703015"},{"key":"e_1_3_2_26_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.100.032328"},{"key":"e_1_3_2_27_1","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.102.110502"},{"key":"e_1_3_2_28_1","unstructured":"Edward Farhi Jeffrey Goldstone and Sam Gutmann. 2014. A Quantum Approximate Optimization Algorithm. arXiv:1411.4028 [quant-ph]"},{"key":"e_1_3_2_29_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.86.032324"},{"key":"e_1_3_2_30_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2021-04-15-433"},{"key":"e_1_3_2_31_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2019-04-30-135"},{"key":"e_1_3_2_32_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-022-05434-1"},{"key":"e_1_3_2_33_1","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.57.127"},{"key":"e_1_3_2_34_1","doi-asserted-by":"publisher","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","DOI":"10.1145\/2491956.2462177"},{"key":"e_1_3_2_35_1","doi-asserted-by":"publisher","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","DOI":"10.1145\/237814.237866"},{"key":"e_1_3_2_36_1","doi-asserted-by":"publisher","unstructured":"Julian Hans and Sven Groppe. 2022. Silq2Qiskit \u2013 Developing a Quantum Language Source-to-Source Translator. In International Conference on Computer Science and Software Engineering. https:\/\/doi.org\/10.1145\/3569966.3570114 10.1145\/3569966.3570114","DOI":"10.1145\/3569966.3570114"},{"key":"e_1_3_2_37_1","doi-asserted-by":"publisher","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","DOI":"10.1145\/3434318"},{"key":"e_1_3_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3571725"},{"key":"e_1_3_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3491247"},{"key":"e_1_3_2_40_1","doi-asserted-by":"publisher","unstructured":"Ali JavadiAbhari Shruti Patil Daniel Kudrow Jeff Heckey Alexey Lvov Frederic T. Chong and Margaret Martonosi. 2014. ScaffCC: A Framework for Compilation and Analysis of Quantum Computing Programs. In ACM Conference on Computing Frontiers. https:\/\/doi.org\/10.1145\/2597917.2597939 10.1145\/2597917.2597939","DOI":"10.1145\/2597917.2597939"},{"key":"e_1_3_2_41_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.8.021047"},{"key":"e_1_3_2_42_1","doi-asserted-by":"publisher","unstructured":"Aleks Kissinger and John van de Wetering. 2020. PyZX: Large Scale Automated Diagrammatic Reasoning. In International Conference on Quantum Physics and Logic. https:\/\/doi.org\/10.4204\/eptcs.318.14 10.4204\/eptcs.318.14","DOI":"10.4204\/eptcs.318.14"},{"key":"e_1_3_2_43_1","doi-asserted-by":"publisher","DOI":"10.1103\/prxquantum.2.030305"},{"key":"e_1_3_2_44_1","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/abae7d"},{"key":"e_1_3_2_45_1","doi-asserted-by":"publisher","unstructured":"Junyi Liu Li Zhou Gilles Barthe and Mingsheng Ying. 2022. Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs. In ACM\/IEEE Symposium on Logic in Computer Science. https:\/\/doi.org\/10.1145\/3531130.3533327 10.1145\/3531130.3533327","DOI":"10.1145\/3531130.3533327"},{"key":"e_1_3_2_46_1","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms10138"},{"key":"e_1_3_2_47_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 10.48550\/arXiv.1812.00954 arXiv:1812.00954 [quant-ph]","DOI":"10.48550\/arXiv.1812.00954"},{"key":"e_1_3_2_48_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.93.022311"},{"key":"e_1_3_2_49_1","doi-asserted-by":"publisher","DOI":"10.26421\/QIC16.13-14-2"},{"key":"e_1_3_2_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.847911"},{"key":"e_1_3_2_51_1","unstructured":"Michele Mosca. 2016. Specification of the .qc file format. https:\/\/circuits.qsoft.iqc.uwaterloo.ca\/about\/spec\/."},{"key":"e_1_3_2_52_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41534-018-0072-4"},{"key":"e_1_3_2_53_1","doi-asserted-by":"publisher","DOI":"10.26421\/QIC18.11-12-3"},{"key":"e_1_3_2_54_1","doi-asserted-by":"publisher","unstructured":"Michael A. Nielsen and Isaac L. Chuang. 2010. Quantum Computation and Quantum Information: 10th Anniversary Edition. https:\/\/doi.org\/10.1017\/CBO9780511976667 10.1017\/CBO9780511976667","DOI":"10.1017\/CBO9780511976667"},{"key":"e_1_3_2_55_1","doi-asserted-by":"publisher","unstructured":"Federico Olmedo and Alejandro D\u00edaz-Caro. 2019. Runtime Analysis of Quantum Programs: A Formal Approach. https:\/\/doi.org\/10.48550\/arXiv.1911.11247 10.48550\/arXiv.1911.11247 arXiv:1911.11247 [cs.LO]","DOI":"10.48550\/arXiv.1911.11247"},{"key":"e_1_3_2_56_1","doi-asserted-by":"publisher","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","DOI":"10.1145\/3009837.3009894"},{"key":"e_1_3_2_57_1","doi-asserted-by":"publisher","DOI":"10.26421\/QIC3.4-3"},{"key":"e_1_3_2_58_1","doi-asserted-by":"publisher","unstructured":"Qiskit Developers. 2021. Qiskit: An Open-source Framework for Quantum Computing. https:\/\/doi.org\/10.5281\/zenodo.2573505 10.5281\/zenodo.2573505","DOI":"10.5281\/zenodo.2573505"},{"key":"e_1_3_2_59_1","unstructured":"QuiZX Developers. 2022. QuiZX: a quick Rust port of PyZX. https:\/\/github.com\/Quantomatic\/quizx."},{"key":"e_1_3_2_60_1","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.98.022321"},{"key":"e_1_3_2_61_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1619152114"},{"key":"e_1_3_2_62_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 10.48550\/arXiv.1801.01081 arXiv:1801.01081 [quant-ph]","DOI":"10.48550\/arXiv.1801.01081"},{"key":"e_1_3_2_63_1","doi-asserted-by":"publisher","DOI":"10.1103\/prxquantum.1.020312"},{"key":"e_1_3_2_64_1","unstructured":"Raphael Seidel Sebastian Bock Nikolay Tcholtchev and Manfred Hauswirth. 2022. Qrisp: A Framework for Compilable High-Level Programming of Gate-Based Quantum Computers. In International Workshop on Programming Languages for Quantum Computing."},{"key":"e_1_3_2_65_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129504004256"},{"key":"e_1_3_2_66_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.87.042302"},{"key":"e_1_3_2_67_1","doi-asserted-by":"publisher","DOI":"10.26421\/QIC3.1-7"},{"key":"e_1_3_2_68_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"e_1_3_2_69_1","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ab8e92"},{"key":"e_1_3_2_70_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2018-01-31-49"},{"key":"e_1_3_2_71_1","doi-asserted-by":"publisher","unstructured":"Martin Suchara John Kubiatowicz Arvin Faruque Frederic T. Chong Ching-Yi Lai and Gerardo Paz. 2013. QuRE: The Quantum Resource Estimator toolbox. In IEEE International Conference on Computer Design. https:\/\/doi.org\/10.1109\/ICCD.2013.6657074 10.1109\/ICCD.2013.6657074","DOI":"10.1109\/ICCD.2013.6657074"},{"key":"e_1_3_2_72_1","doi-asserted-by":"publisher","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","DOI":"10.1145\/3183895.3183901"},{"key":"e_1_3_2_73_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.117.210505"},{"key":"e_1_3_2_74_1","doi-asserted-by":"publisher","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","DOI":"10.1145\/3571225"},{"key":"e_1_3_2_75_1","doi-asserted-by":"publisher","unstructured":"Amanda Xu Abtin Molavi Lauren Pick Swamit Tannu and Aws Albarghouthi. 2023. Synthesizing Quantum-Circuit Optimizers. In ACM SIGPLAN Conference on Programming Language Design and Implementation. https:\/\/doi.org\/10.1145\/3591254 10.1145\/3591254","DOI":"10.1145\/3591254"},{"key":"e_1_3_2_76_1","doi-asserted-by":"publisher","unstructured":"Mingkuan Xu Zikun Li Oded Padon Sina Lin Jessica Pointing Auguste Hirth Henry Ma Jens Palsberg Alex Aiken Umut A. Acar and Zhihao Jia. 2022. Quartz: Superoptimization of Quantum Circuits. In ACM SIGPLAN Conference on Programming Language Design and Implementation. https:\/\/doi.org\/10.1145\/3519939.3523433 10.1145\/3519939.3523433","DOI":"10.1145\/3519939.3523433"},{"key":"e_1_3_2_77_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 10.48550\/ARXIV.1209.4379 arXiv:1209.4379 [quant-ph]","DOI":"10.48550\/ARXIV.1209.4379"},{"key":"e_1_3_2_78_1","doi-asserted-by":"publisher","unstructured":"Charles Yuan and Michael Carbin. 2022. Tower: Data Structures in Quantum Superposition. In ACM SIGPLAN Conference on Object-Oriented Programming Systems Languages and Applications. https:\/\/doi.org\/10.1145\/3563297 10.1145\/3563297","DOI":"10.1145\/3563297"},{"key":"e_1_3_2_79_1","doi-asserted-by":"publisher","unstructured":"Charles Yuan and Michael Carbin. 2024. The T-Complexity Costs of Error Correction for Control Flow in Quantum Computation. https:\/\/doi.org\/10.5281\/zenodo.10729070 10.5281\/zenodo.10729070","DOI":"10.5281\/zenodo.10729070"},{"key":"e_1_3_2_80_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2161917"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3656397","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3656397","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T20:39:29Z","timestamp":1751661569000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3656397"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,20]]},"references-count":79,"journal-issue":{"issue":"PLDI","published-print":{"date-parts":[[2024,6,20]]}},"alternative-id":["10.1145\/3656397"],"URL":"https:\/\/doi.org\/10.1145\/3656397","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,20]]},"assertion":[{"value":"2024-06-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}