{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T01:44:32Z","timestamp":1787017472781,"version":"build-2736575974"},"reference-count":55,"publisher":"Association for Computing Machinery (ACM)","issue":"PLDI","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2025,6,10]]},"abstract":"\n Many quantum algorithms instantiate and use ancillas, spare qubits that serve as temporary storage in a quantum circuit. In particular, many recently developed high-level and modular quantum programming languages (QPLs) use ancilla qubits to implement various programming constructs. These are lowered to circuits with nested\/cascading compute-uncompute gate sequences that use ancilla qubits to track internal state. We present SPARE, a rewrite-based quantum circuit optimizer that restructures these compute-uncompute gate sequences, leveraging the ancilla qubit state information to optimize the circuit. In this work, we prove the correctness of SPARE\u2019s rewrites and link SPARE\u2019s gate-level transforms to language-level program rewrites, which may be performed on the input language. We evaluate SPARE on QPL-generated quantum circuits against Unqomp and Spire, two optimizing compilers for QPLs. SPARE achieves a reduction of up to\n \n \n 27.3<\/mml:mn>\n %<\/mml:mi>\n <\/mml:math>\n <\/jats:inline-formula>\n in qubit count,\n \n \n 56.7<\/mml:mn>\n %<\/mml:mi>\n <\/mml:math>\n <\/jats:inline-formula>\n in 2 -qubit gates,\n \n \n 68.2<\/mml:mn>\n %<\/mml:mi>\n <\/mml:math>\n <\/jats:inline-formula>\n in 1-qubit gates and\n \n \n 73.9<\/mml:mn>\n %<\/mml:mi>\n <\/mml:math>\n <\/jats:inline-formula>\n in depth against Unqomp, and up to\n \n \n 17.8<\/mml:mn>\n %<\/mml:mi>\n <\/mml:math>\n <\/jats:inline-formula>\n in qubits,\n \n \n 67.3<\/mml:mn>\n %<\/mml:mi>\n <\/mml:math>\n <\/jats:inline-formula>\n in 2-qubit gates,\n \n \n 61.4<\/mml:mn>\n %<\/mml:mi>\n <\/mml:math>\n <\/jats:inline-formula>\n in 1-qubit gates and\n \n \n 59.9<\/mml:mn>\n %<\/mml:mi>\n <\/mml:math>\n <\/jats:inline-formula>\n in depth against Spire. We also evaluate SPARE against the Quartz, Feynman, and PyZX circuit optimizers: SPARE achieves up to a\n \n \n 70.0<\/mml:mn>\n %<\/mml:mi>\n <\/mml:math>\n <\/jats:inline-formula>\n reduction in two-qubit gates, up to a\n \n \n 53.6<\/mml:mn>\n %<\/mml:mi>\n <\/mml:math>\n <\/jats:inline-formula>\n reduction in 1-qubit gates, and up to a\n \n \n 56.7<\/mml:mn>\n %<\/mml:mi>\n <\/mml:math>\n <\/jats:inline-formula>\n reduction in depth compared to the best result from all the gate-level optimizers.\n <\/jats:p>","DOI":"10.1145\/3729253","type":"journal-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T16:02:27Z","timestamp":1749830547000},"page":"176-200","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimizing Ancilla-Based Quantum Circuits with SPARE"],"prefix":"10.1145","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5809-7031","authenticated-orcid":false,"given":"Ritvik","family":"Sharma","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3444-1544","authenticated-orcid":false,"given":"Sara","family":"Achour","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,6,13]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","unstructured":"T. Altenkirch and J. Grattage. 2005. A functional quantum programming language. In 20th Annual IEEE Symposium on Logic in Computer Science (LICS\u2019 05). 249-258. doi:10.1109\/LICS.2005.1","DOI":"10.1109\/LICS.2005.1"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","unstructured":"Matthew Amy Dmitri Maslov and Michele Mosca. 2014. Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 33 10 (2014) 1476-1489. doi:10.1109\/TCAD.2014.2341953","DOI":"10.1109\/TCAD.2014.2341953"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","unstructured":"Ryan Babbush Craig Gidney Dominic W. Berry Nathan Wiebe Jarrod McClean Alexandru Paler Austin Fowler and Hartmut Neven. 2018. Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity. Phys. Rev. X 8 (Oct 2018) 041015. Issue 4. doi:10.1103\/PhysRevX.8.041015","DOI":"10.1103\/PhysRevX.8.041015"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","unstructured":"Adriano Barenco Charles H. Bennett Richard Cleve David P. DiVincenzo Norman Margolus Peter Shor Tycho Sleator John A. Smolin and Harald Weinfurter. 1995. Elementary gates for quantum computation. Phys. Rev. A 52 (Nov 1995) 3457-3467. Issue 5. doi:10.1103\/PhysRevA.52.3457","DOI":"10.1103\/PhysRevA.52.3457"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","unstructured":"Charles H. Bennett Gilles Brassard Claude Cr\u00e9peau Richard Jozsa Asher Peres and William K. Wootters. 1993. Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. Phys. Rev. Lett. 70 (Mar 1993) 1895-1899. Issue 13. doi:10.1103\/PhysRevLett.70.1895","DOI":"10.1103\/PhysRevLett.70.1895"},{"key":"e_1_3_2_7_2","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. (2020) 286-300. doi:10.1145\/3385412.3386007","DOI":"10.1145\/3385412.3386007"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","unstructured":"Kostas Blekos Dean Brand Andrea Ceschini Chiao-Hui Chou Rui-Hao Li Komal Pandya and Alessandro Summer. 2024. A review on Quantum Approximate Optimization Algorithm and its variants. Physics Reports 1068 (2024) 1-66. doi:10.1016\/j.physrep.2024.03.002 A review on Quantum Approximate Optimization Algorithm and its variants.","DOI":"10.1016\/j.physrep.2024.03.002"},{"key":"e_1_3_2_9_2","unstructured":"Qiskit Community. 2024. Qiskit: Quantum SDK - X Gate Implementation. https:\/\/github.com\/Qiskit\/qiskit\/blob\/stable\/1.4\/qiskit\/circuit\/library\/standard_gates\/x.py#L483-L495. Accessed: 23 Mar. 2025."},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","unstructured":"Alexandre A. A. de Almeida Gerhard W. Dueck and Alexandre C. R. da Silva. 2019. CNOT Gate Mappings to Clifford+T Circuits in IBM Architectures. In 2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL). 7-12. doi:10.1109\/ISMVL.2019.00010","DOI":"10.1109\/ISMVL.2019.00010"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","unstructured":"Yongshan Ding Xin-Chuan Wu Adam Holmes Ash Wiseth Diana Franklin Margaret Martonosi and Frederic T.Chong. 2020. SQUARE: strategic quantum ancilla reuse for modular quantum programs via cost-effective uncomputation. In Proceedings of the ACM\/IEEE 47th Annual International Symposium on Computer Architecture (Virtual Event) (ISCA '20). IEEE Press 570-583. doi:10.1109\/ISCA45697.2020.00054","DOI":"10.1109\/ISCA45697.2020.00054"},{"key":"e_1_3_2_12_2","unstructured":"ETH-SRI. 2023. Unqomp: Uncomputation-Aware Quantum Compilation. https:\/\/github.com\/eth-sri\/Unqomp. Accessed: 2025-03-31."},{"key":"e_1_3_2_13_2","unstructured":"Craig Gidney. 2015. Constructing Large Controlled Nots. https:\/\/algassert.com\/circuits\/2015\/06\/05\/Constructing-Large-Controlled-Nots.html."},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","unstructured":"Google Quantum AI. 2023. Suppressing quantum errors by scaling a surface code logical qubit. Nature 614 (2023) 676-681. doi:10.1038\/s41586-022-05434-1","DOI":"10.1038\/s41586-022-05434-1"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","unstructured":"Daniel Gottesman. 1998. Theory of fault-tolerant quantum computation. Phys. Rev. A 57 (Jan 1998) 127-137. Issue 1. doi:10.1103\/PhysRevA.57.127","DOI":"10.1103\/PhysRevA.57.127"},{"key":"e_1_3_2_16_2","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 Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation (Seattle Washington USA) (PLDI '13). Association for Computing Machinery New York NY USA 333-342. doi:10.1145\/2491956.2462177","DOI":"10.1145\/2491956.2462177"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","unstructured":"Lov K. Grover. 1996. A fast quantum mechanical algorithm for database search. In Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing (Philadelphia Pennsylvania USA) (STOC '96). Association for Computing Machinery New York NY USA 212-219. doi:10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","unstructured":"Kesha Hietala Robert Rand Shih-Han Hung Xiaodi Wu and Michael Hicks. 2021. A verified optimizer for Quantum circuits. Proc. ACM Program. Lang. 5 POPL Article 37 (Jan. 2021) 29 pages. doi:10.1145\/3434318","DOI":"10.1145\/3434318"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","unstructured":"Keli Huang and Jens Palsberg. 2024. Compiling Conditional Quantum Gates without Using Helper Qubits. Proc. ACM Program. Lang. 8 PLDI Article 206 (June 2024) 22 pages. doi:10.1145\/3656436","DOI":"10.1145\/3656436"},{"key":"e_1_3_2_20_2","unstructured":"IBM. 2018. Quantum devices and simulators. https:\/\/www.research.ibm.com\/bm-q\/technology\/devices\/."},{"key":"e_1_3_2_21_2","unstructured":"IBM Quantum Team. [n. d.]. Qiskit Documentation: RCCXGate. https:\/\/docs.quantum.ibm.com\/api\/qiskit\/qiskit.circuit.library.RCCXGate. Accessed: 2024-11-14."},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","unstructured":"Ali Javadi-Abhari Matthew Treinish Kevin Krsulich Christopher J.Wood Jake Lishman Julien Gacon Simon Martiel Paul D. Nation Lev S. Bishop Andrew W. Cross Blake R. Johnson and Jay M. Gambetta. 2024. Quantum computing with Qiskit. doi:10.48550\/arXiv.2405.08810 arXiv:2405.08810 [quant-ph]","DOI":"10.48550\/arXiv.2405.08810"},{"key":"e_1_3_2_23_2","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 ofquantum computing programs. In Proceedings of the 11th ACM Conference on Computing Frontiers (Cagliari Italy) (CF '14). Association for Computing Machinery New York NY USA Article 1 10 pages. doi:10.1145\/2597917.2597939","DOI":"10.1145\/2597917.2597939"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","unstructured":"Isaac H. Kim Ye-Hua Liu Sam Pallister William Pol Sam Roberts and Eunseok Lee. 2022. Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules. Phys. Rev. Res. 4 (Apr 2022) 023019. Issue 2. doi:10.1103\/PhysRevResearch.4.023019","DOI":"10.1103\/PhysRevResearch.4.023019"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","unstructured":"Aleks Kissinger and John Wetering. 2020. PyZX: Large Scale Automated Diagrammatic Reasoning. Electronic Proceedings in Theoretical Computer Science 318 (04 2020) 230-242. doi:10.4204\/EPTCS.318.14","DOI":"10.4204\/EPTCS.318.14"},{"key":"e_1_3_2_26_2","unstructured":"Alexei Y. Kitaev. 1995. Quantum measurements and the Abelian Stabilizer Problem. Electron. Colloquium Comput. Complex. TR96 (1995). https:\/\/api.semanticscholar.org\/CorpusID:17023060"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","unstructured":"Hochang Lee KyungChul Jeong Daewan Han and Panjin Kim. 2024. An Algorithm for Reversible Logic Circuit Synthesis Based on Tensor Decomposition. ACM Transactions on Quantum Computing 5 3 Article 15 (July 2024) 28 pages. doi:10.1145\/3673242","DOI":"10.1145\/3673242"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","unstructured":"Muyuan Li Daniel Miller and Kenneth R. Brown. 2018. Direct measurement of Bacon-Shor code stabilizers. Phys. Rev. A 98 (Nov 2018) 050301. Issue 5. doi:10.1103\/PhysRevA.98.050301","DOI":"10.1103\/PhysRevA.98.050301"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","unstructured":"Zikun Li Jinjun Peng Yixuan Mei Sina Lin Yi Wu Oded Padon and Zhihao Jia. 2024. Quarl: A Learning-Based Quantum Circuit Optimizer. Proc. ACM Program. Lang. 8 OOPSLA1 Article 114 (April 2024) 28 pages. doi:10.1145\/3649831","DOI":"10.1145\/3649831"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","unstructured":"Norbert M. Linke Dmitri Maslov Martin Roetteler Shantanu Debnath Caroline Figgatt Kevin A. Landsman Kenneth Wright and Christopher Monroe. 2017. Experimental comparison of two quantum computing architectures. Proceedings of the National Academy of Sciences of the United States of America (March 2017). doi:10.1073\/pnas.1618020114","DOI":"10.1073\/pnas.1618020114"},{"key":"e_1_3_2_31_2","doi-asserted-by":"crossref","unstructured":"Daniel Litinski. 2018. A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery. Quantum (2018). https:\/\/api.semanticscholar.org\/CorpusID:53386026","DOI":"10.22331\/q-2019-03-05-128"},{"key":"e_1_3_2_32_2","unstructured":"Daniel Litinski. 2023. How to compute a 256-bit elliptic curve private key with only 50 million Toffoli gates. https:\/\/api.semanticscholar.org\/CorpusID:259164752"},{"key":"e_1_3_2_33_2","unstructured":"David Maslov. 2021. Quantum CIrcuit Benchmarks. https:\/\/reversiblebenchmarks.github.io\/."},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","unstructured":"D. Maslov G.W. Dueck and D.M. Miller. 2005. Toffoli network synthesis with templates. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 24 6 (2005) 807-817. doi:10.1109\/TCAD.2005.847911","DOI":"10.1109\/TCAD.2005.847911"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","unstructured":"D. Maslov G.W. Dueck and D.M. Miller. 2005. Toffoli network synthesis with templates. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 24 6 (2005) 807-817. doi:10.1109\/TCAD.2005.847911","DOI":"10.1109\/TCAD.2005.847911"},{"key":"e_1_3_2_36_2","unstructured":"Meamy. 2024. Feynman. https:\/\/github.com\/meamy\/feynman. Accessed: 2024-11-14."},{"key":"e_1_3_2_37_2","unstructured":"Yunseong Nam Neil J. Ross Yuan Su Andrew M. Childs and Dmitri Maslov. 2018. Automated optimization of large quantum circuits with continuous parameters. npj Quantum Information 5 (May 2018)."},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","unstructured":"Michael A. Nielsen and Isaac L.Chuang. 2010. Quantum Computation and Quantum Information 10th Anniversary Edition. Cambridge University Press Cambridge. doi:10.1017\/CBO9780511976667","DOI":"10.1017\/CBO9780511976667"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","unstructured":"Anouk Paradis Benjamin Bichsel Samuel Steffen and Martin Vechev. 2021. Unqomp: synthesizing uncomputation in Quantum circuits. (2021) 222-236. doi:10.1145\/3453483.3454040","DOI":"10.1145\/3453483.3454040"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","unstructured":"Anouk Paradis Benjamin Bichsel and Martin Vechev. 2024. Reqomp: Space-constrained Uncomputation for Quantum Circuits. Quantum 8 (Feb. 2024) 1258. doi:10.22331\/q-2024-02-19-1258","DOI":"10.22331\/q-2024-02-19-1258"},{"key":"e_1_3_2_41_2","unstructured":"QuiZX Contributors. 2025. QuiZX: A Scalable ZX-calculus Based Quantum Circuit Optimizer. https:\/\/github.com\/zxcalc\/quizx. Accessed: 2025-03-25."},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","unstructured":"Sara Achour Ritvik Sharma. 2025. Spare Compiler. doi:10.5281\/zenodo.15307149","DOI":"10.5281\/zenodo.15307149"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","unstructured":"Ritvik Sharma and Sara Achour. 2024. Compilation of Qubit Circuits to Optimized Qutrit Circuits. Proc. ACM Program. Lang. 8 PLDI Article 158 (June 2024) 24 pages. doi:10.1145\/3656388","DOI":"10.1145\/3656388"},{"key":"e_1_3_2_44_2","doi-asserted-by":"crossref","unstructured":"Vivek V. Shende and Igor L.Markov. 2009. On the CNOT-cost of TOFFOLI gates. Quantum Info. Comput. 9 5 (May 2009) 461-486.","DOI":"10.26421\/QIC8.5-6-8"},{"key":"e_1_3_2_45_2","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-134. doi:10.1109\/SFCS.1994.365700","DOI":"10.1109\/SFCS.1994.365700"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","unstructured":"Peter W. Shor. 1997. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms.on a Quantum Computer. SIAM f. Comput. 26 5 (1997) 1484-1509. doi:10.1137\/S0097539795293172 arXiv: https:\/\/doi.org\/10.1137\/S0097539795293172 10.1137\/S0097539795293172","DOI":"10.1137\/S0097539795293172"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","unstructured":"Seyon Sivarajah Silas Dilkes Alexander Cowtan Will Simmons Alec Edgington and Ross Duncan. 2020. t|ket|: a retargetable compiler for NISQ devices. Quantum Science and Technology 6 1 (nov 2020) 014003. doi:10.1088\/2058-9565\/ab8e92","DOI":"10.1088\/2058-9565\/ab8e92"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","unstructured":"Damian S. Steiger Thomas H\u00e4ner and Matthias Troyer. 2018. ProjectQ: an open source software framework for quantum computing. Quantum 2 (Jan. 2018) 49. doi:10.22331\/q-2018-01-31-49","DOI":"10.22331\/q-2018-01-31-49"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","unstructured":"Krysta Svore Alan Geller Matthias Troyer John Azariah Christopher Granade Bettina Heim Vadym Kliuchnikov Mariia Mykhailova Andres Paz and Martin Roetteler. 2018. Q#: Enabling Scalable Quantum Computing and Development with a High-level DSL. In Proceedings of the Real World Domain Specific Languages Workshop 2018 (Vienna Austria) (RWDSL2018). Association for Computing Machinery New York NY USA Article 7 10 pages. doi:10.1145\/3183895.3183901","DOI":"10.1145\/3183895.3183901"},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","unstructured":"Maika Takita A. D. C\u00f3rcoles Easwar Magesan Baleegh Abdo Markus Brink Andrew Cross Jerry M. Chow and Jay M. Gambetta. 2016. Demonstration of Weight-Four Parity Measurements in the Surface Code Architecture. Phys. Rev. Lett. 117 (Nov 2016) 210505. Issue 21. doi:10.1103\/PhysRevLett.117.210505","DOI":"10.1103\/PhysRevLett.117.210505"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","unstructured":"Hristo Venev Timon Gehr Dimitar Dimitrov and Martin Vechev. 2024. Modular Synthesis of Efficient Quantum Uncomputation. Proc. ACM Program. Lang. 8 OOPSLA2 Article 345 (Oct. 2024) 28 pages. doi:10.1145\/3689785","DOI":"10.1145\/3689785"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","unstructured":"Finn Voichick Liyi Li Robert Rand and Michael Hicks. 2023. Qunity: A Unified Language for Quantum and Classical Computing. Proc. ACM Program. Lang. 7 POPL Article 32 (Jan. 2023) 31 pages. doi:10.1145\/3571225","DOI":"10.1145\/3571225"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","unstructured":"Amanda Xu Abtin Molavi Lauren Pick Swamit Tannu and Aws Albarghouthi. 2023. Synthesizing Quantum-Circuit Optimizers. Proc. ACM Program. Lang. 7 PLDI Article 140 (June 2023) 25 pages. doi:10.1145\/3591254","DOI":"10.1145\/3591254"},{"key":"e_1_3_2_54_2","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 Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation (San Diego CA USA) (PLDI 2022). Association for Computing Machinery New York NY USA 625-640. doi:10.1145\/3519939.3523433","DOI":"10.1145\/3519939.3523433"},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","unstructured":"Charles Yuan and Michael Carbin. 2022. Tower: data structures in Quantum superposition. Proc. ACM Program. Lang. 6 OOPSLA2 Article 134 (Oct. 2022) 30 pages. doi:10.1145\/3563297","DOI":"10.1145\/3563297"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","unstructured":"Charles Yuan and Michael Carbin. 2024. The T-Complexity Costs of Error Correction for Control Flow in Quantum Computation. Proc. ACM Program. Lang. 8 PLDI (June 2024). doi:10.1145\/3656397","DOI":"10.1145\/3656397"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3729253","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T10:03:28Z","timestamp":1784196208000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3729253"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,10]]},"references-count":55,"journal-issue":{"issue":"PLDI","published-print":{"date-parts":[[2025,6,10]]}},"alternative-id":["10.1145\/3729253"],"URL":"https:\/\/doi.org\/10.1145\/3729253","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,10]]},"assertion":[{"value":"2024-11-15","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-03-06","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-06-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}