{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:45:56Z","timestamp":1780994756104,"version":"3.54.1"},"reference-count":30,"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\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["OMA-2016245"],"award-info":[{"award-number":["OMA-2016245"]}],"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":[[2024,6,20]]},"abstract":"<jats:p>We present a compilation scheme for conditional quantumgates. Our scheme compiles amulti-qubit conditional to a linear number of two-qubit conditionals. This can be done straightforwardly with helper qubits, but we show how to do it without using helper qubits and with much fewer gates than in previous work. Specifically, our scheme requires 1\/3 as many gates as the previous best scheme without using helper qubits, which is essential for practical use. Our experiments show that several quantum-circuit optimizers have little impact on the compiled code from the previous best scheme, confirming the need for our new scheme. Our experiments with Grover\u2019s algorithm and quantum walk also show that our scheme has a major impact on the reliability of the compiled code.<\/jats:p>","DOI":"10.1145\/3656436","type":"journal-article","created":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T16:27:20Z","timestamp":1718900840000},"page":"1463-1484","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Compiling Conditional Quantum Gates without Using Helper Qubits"],"prefix":"10.1145","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-9104-0621","authenticated-orcid":false,"given":"Keli","family":"Huang","sequence":"first","affiliation":[{"name":"University of California at Los Angeles, Los Angeles, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4747-365X","authenticated-orcid":false,"given":"Jens","family":"Palsberg","sequence":"additional","affiliation":[{"name":"University of California at Los Angeles, Los Angeles, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,6,20]]},"reference":[{"key":"e_1_3_2_2_1","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/aad8ca"},{"key":"e_1_3_2_3_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.52.3457"},{"key":"e_1_3_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/QCE57702.2023.00100"},{"key":"e_1_3_2_5_1","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/305\/05215"},{"key":"e_1_3_2_6_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.13.041057"},{"key":"e_1_3_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA45697.2020.00054"},{"key":"e_1_3_2_8_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.86.032324"},{"key":"e_1_3_2_9_1","unstructured":"Craig Gidney. 2015. Using Quantum Gates instead of Ancilla Bits. algassert.com. https:\/\/algassert.com\/circuits\/2015\/06\/22\/Using-Quantum-Gates-instead-of-Ancilla-Bits.html"},{"key":"e_1_3_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/QCE52317.2021.00045"},{"key":"e_1_3_2_11_1","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. 212\u2013219. https:\/\/doi.org\/10.1145\/237814.237866 10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"key":"e_1_3_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3434318"},{"key":"e_1_3_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3582016.3582030"},{"key":"e_1_3_2_14_1","unstructured":"IBM Quantum Platform. 2023. IBM Mumbai. IBM Quantum Computing. https:\/\/quantum-computing.ibm.com\/services\/resources?system=ibmq_mumbai"},{"key":"e_1_3_2_15_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.93.032318"},{"key":"e_1_3_2_16_1","doi-asserted-by":"publisher","unstructured":"Aleks Kissinger and John van de Wetering. 2019. Pyzx: Large scale automated diagrammatic reasoning. arXiv preprint arXiv:1904.04735. https:\/\/doi.org\/10.48550\/arXiv.1904.04735 10.48550\/arXiv.1904.04735","DOI":"10.48550\/arXiv.1904.04735"},{"key":"e_1_3_2_17_1","doi-asserted-by":"publisher","unstructured":"Zikun Li Jinjun Peng Yixuan Mei Sina Lin Yi Wu Oded Padon and Zhihao Jia. 2023. Quarl: A learning-based quantum circuit optimizer. arXiv preprint arXiv:2307.10120. https:\/\/doi.org\/10.48550\/arXiv.2307.10120 10.48550\/arXiv.2307.10120","DOI":"10.48550\/arXiv.2307.10120"},{"key":"e_1_3_2_18_1","volume-title":"Quantum Computation and Quantum Information","author":"Nielsen Michael A.","year":"2000","unstructured":"Michael A. Nielsen and Isaac L. Chuang. 2000. Quantum Computation and Quantum Information. Cambridge University Press."},{"key":"e_1_3_2_19_1","doi-asserted-by":"publisher","unstructured":"Anouk Paradis Benjamin Bichsel Samuel Steffen and Martin Vechev. 2021. Unqomp: synthesizing uncomputation in Quantum circuits. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation 222\u2013236. https:\/\/doi.org\/10.1145\/3453483.3454040 10.1145\/3453483.3454040","DOI":"10.1145\/3453483.3454040"},{"key":"e_1_3_2_20_1","unstructured":"IBM Qiskit. 2023. Summary of Quantum Operations. Qiskit Tutorials. https:\/\/qiskit.org\/documentation\/tutorials\/circuits\/3_summary_of_quantum_operations.html. Accessed Nov 12 2023"},{"key":"e_1_3_2_21_1","unstructured":"Qiskit contributors. 2023. Grover\u2019s algorithm tutorials. Qiskit Tutorials. https:\/\/qiskit.org\/ecosystem\/algorithms\/tutorials\/06_grover.html"},{"key":"e_1_3_2_22_1","doi-asserted-by":"publisher","unstructured":"Qiskit contributors. 2023. 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_23_1","unstructured":"Qiskit contributors. 2023. Statevector method in Qiskit. https:\/\/docs.quantum.ibm.com\/api\/qiskit\/qiskit.quantum_info.Statevector"},{"key":"e_1_3_2_24_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.87.062318"},{"key":"e_1_3_2_25_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.0803.2316"},{"key":"e_1_3_2_26_1","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ab8e92"},{"key":"e_1_3_2_27_1","doi-asserted-by":"publisher","unstructured":"Bochen Tan and Jason Cong. 2020. Optimal layout synthesis for quantum computing. In Proceedings of the 39th International Conference on Computer-Aided Design. 1\u20139. https:\/\/doi.org\/10.1145\/3400302.3415620 10.1145\/3400302.3415620","DOI":"10.1145\/3400302.3415620"},{"key":"e_1_3_2_28_1","doi-asserted-by":"publisher","unstructured":"Siwei Tan Congliang Lang Liang Xiang Shudi Wang Xinghui Jia Ziqi Tan Tingting Li Jieming Yin Yongheng Shang Andre Python. 2023. QuCT: A Framework for Analyzing Quantum Circuit by Extracting Contextual and Topological Features. In Proceedings of the 56th Annual IEEE\/ACM International Symposium on Microarchitecture. 494\u2013508. https:\/\/doi.org\/10.1145\/3613424.3614274 10.1145\/3613424.3614274","DOI":"10.1145\/3613424.3614274"},{"key":"e_1_3_2_29_1","doi-asserted-by":"publisher","unstructured":"Rafaella Vale Thiago Melo D Azevedo Ismael Ara\u00fajo Israel F Araujo and Adenilton J da Silva. 2023. Decomposition of multi-controlled special unitary single-qubit gates. arXiv preprint arXiv:2302.06377. https:\/\/doi.org\/10.48550\/arXiv.2302.06377 10.48550\/arXiv.2302.06377","DOI":"10.48550\/arXiv.2302.06377"},{"key":"e_1_3_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3591254"},{"key":"e_1_3_2_31_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. 2022. Quartz: superoptimization of quantum circuits. In Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation. 625\u2013640. https:\/\/doi.org\/10.1145\/3519939.3523433 10.1145\/3519939.3523433","DOI":"10.1145\/3519939.3523433"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3656436","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3656436","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T20:38:44Z","timestamp":1751661524000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3656436"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,20]]},"references-count":30,"journal-issue":{"issue":"PLDI","published-print":{"date-parts":[[2024,6,20]]}},"alternative-id":["10.1145\/3656436"],"URL":"https:\/\/doi.org\/10.1145\/3656436","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"}}]}}