{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T15:49:19Z","timestamp":1774367359221,"version":"3.50.1"},"reference-count":31,"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            Quantum computers are a revolutionary class of computational platforms that are capable of solving computationally hard problems. However, today\u2019s quantum hardware is subject to noise and decoherence issues that together limit the scale and complexity of the quantum circuits that can be implemented. Recently, practitioners have developed qutrit-based quantum hardware platforms that compute over\n            <jats:inline-formula>\n              <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\">\n                <mml:mo>\u2223<\/mml:mo>\n                <mml:mn>0<\/mml:mn>\n                <mml:mo stretchy=\"true\">\u27e9<\/mml:mo>\n                <mml:mo>,<\/mml:mo>\n                <mml:mo>\u2223<\/mml:mo>\n                <mml:mn>1<\/mml:mn>\n                <mml:mo stretchy=\"true\">\u27e9<\/mml:mo>\n              <\/mml:math>\n            <\/jats:inline-formula>\n            , and\n            <jats:inline-formula>\n              <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\">\n                <mml:mo>\u2223<\/mml:mo>\n                <mml:mn>2<\/mml:mn>\n                <mml:mo stretchy=\"true\">\u27e9<\/mml:mo>\n              <\/mml:math>\n            <\/jats:inline-formula>\n            states, and have presented circuit depth reduction techniques using qutrits\u2019 higher energy\n            <jats:inline-formula>\n              <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\">\n                <mml:mo>\u2223<\/mml:mo>\n                <mml:mn>2<\/mml:mn>\n                <mml:mo stretchy=\"true\">\u27e9<\/mml:mo>\n              <\/mml:math>\n            <\/jats:inline-formula>\n            states to temporarily store information. However, thus far, such quantum circuits that use higher order states for temporary storage need to be manually crafted by hardware designers. We present D\n            <jats:sc>are<\/jats:sc>\n            , an optimizing compiler for qutrit circuits that implement qubit computations. D\n            <jats:sc>are<\/jats:sc>\n            deploys a qutrit circuit decomposition algorithm and a rewrite engine to construct and optimize qutrit circuits. We evaluate D\n            <jats:sc>are<\/jats:sc>\n            against hand-optimized qutrit circuits and qubit circuits, and find D\n            <jats:sc>are<\/jats:sc>\n            delivers up to\n            <jats:inline-formula>\n              <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\">\n                <mml:mn>65<\/mml:mn>\n                <mml:mo>%<\/mml:mo>\n              <\/mml:math>\n            <\/jats:inline-formula>\n            depth improvement over manual qutrit implementations, and 43-75% depth improvement over qubit circuits. We also perform a fidelity analysis and find DARE-optimized qutrit circuits deliver up to\n            <jats:inline-formula>\n              <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\">\n                <mml:mn>8.9<\/mml:mn>\n                <mml:mo>\u00d7<\/mml:mo>\n              <\/mml:math>\n            <\/jats:inline-formula>\n            higher fidelity circuits than their manually implemented counterparts.\n          <\/jats:p>","DOI":"10.1145\/3656388","type":"journal-article","created":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T16:27:20Z","timestamp":1718900840000},"page":"272-295","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Compilation of Qubit Circuits to Optimized Qutrit Circuits"],"prefix":"10.1145","volume":"8","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":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3444-1544","authenticated-orcid":false,"given":"Sara","family":"Achour","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, 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","DOI":"10.1109\/ISMVL49045.2020.9345604"},{"key":"e_1_3_2_3_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.94.230502"},{"key":"e_1_3_2_4_1","article-title":"A new quantum ripple-carry addition circuit","volume":"2004","author":"Cuccaro Steven A.","year":"2004","unstructured":"Steven A. Cuccaro, Thomas G. Draper, Samuel A. Kutin, and Moulton David Petrie. 2004. A new quantum ripple-carry addition circuit. Arxiv (2004). https:\/\/doi.org\/arXiv:quant-ph\/0410184","journal-title":"Arxiv"},{"key":"e_1_3_2_5_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.87.012325"},{"key":"e_1_3_2_6_1","first-page":"1250","article-title":"Constructive Quantum Shannon Decomposition from Cartan Involutions. 7","volume":"2008","author":"Drury Byron","year":"2008","unstructured":"Byron Drury and Peter Love. 2008. Constructive Quantum Shannon Decomposition from Cartan Involutions. 7. Phys. A: Math. Theor (2008), 1250-1262","journal-title":"Phys. A: Math. Theor"},{"key":"e_1_3_2_7_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.129.100501"},{"key":"e_1_3_2_8_1","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_9_1","unstructured":"Craig Gidney. 2015. Constructing Large Increment Gates. https:\/\/algassert.com\/circuits\/2015\/06\/12\/Constructing-Large-Increment-Gates.html."},{"key":"e_1_3_2_10_1","doi-asserted-by":"publisher","unstructured":"Pranav Gokhale Jonathan M. Baker Casey Duckering Natalie C. Brown Kenneth R. Brown and Frederic T. Chong 2019. Asymptotic Improvements to Quantum Circuits via Qutrits. In Proceedings of the 46th International Symposium on Computer Architecture (Phoenix Arizona) (ISCA \u201819). Association for Computing Machinery New York NY USA 554-566. https:\/\/doi.org\/10.1145\/3307650.3322253 10.1145\/3307650.3322253","DOI":"10.1145\/3307650.3322253"},{"key":"e_1_3_2_11_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-023-37375-2"},{"key":"e_1_3_2_12_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.125.230501"},{"key":"e_1_3_2_13_1","unstructured":"IBM. 2018. Quantum devices and simulators. https:\/\/www.research.ibm.com\/bm-q\/technology\/devices\/."},{"key":"e_1_3_2_14_1","doi-asserted-by":"crossref","unstructured":"N. Khammassi I. Ashraf X. Fu C. G. Almudever and K. Bertels. 2017. QX: A High-Performance Quantum Computer Simulation Platform. In Proceedings of the Conference on Design Automation & Test in Europe (Lausanne Switzerland) (DATE \u201817). European Design and Automation Association Leuven BEL 464-469.","DOI":"10.23919\/DATE.2017.7927034"},{"key":"e_1_3_2_15_1","unstructured":"Faisal Shah Khan and Marek Perkowski. 2005. Synthesis of Ternary Quantum Logic Circuits by Decomposition arXiv:quant-ph\/0511041 [quant-ph]"},{"key":"e_1_3_2_16_1","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). https:\/\/doi.org\/10.1073\/pnas.1618020114 10.1073\/pnas.1618020114","DOI":"10.1073\/pnas.1618020114"},{"key":"e_1_3_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISMVL52857.2022.00014"},{"key":"e_1_3_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3575693.3575726"},{"key":"e_1_3_2_19_1","doi-asserted-by":"publisher","unstructured":"Andrew Litteken Lennart Maximilian Seifert Jason D. Chadwick Natalia Nottingham Tanay Roy Ziqian Li David Schuster Frederic T. Chong and Jonathan M. Baker. 2023. Dancing the Quantum Waltz: Compiling Three-Qubit Gates on Four Level Architectures. In Proceedings of the 50th Annual International Symposium on Computer Architecture (Orlando FL USA) (ISCA \u201823). Association for Computing Machinery New York NY USA Article 71 14 pages https:\/\/doi.org\/10.1145\/3579371.3589106 10.1145\/3579371.3589106","DOI":"10.1145\/3579371.3589106"},{"key":"e_1_3_2_20_1","doi-asserted-by":"publisher","unstructured":"Wen-Qiang Liu and Hai-Rui Wei. 2020. Optimal synthesis of the Fredkin gate in a multilevel system. New fournal of Physics 22 6 (jun 2020) 063026. https:\/\/doi.org\/10.1088\/1367-2630\/ab8e13 10.1088\/1367-2630\/ab8e13","DOI":"10.1088\/1367-2630\/ab8e13"},{"key":"e_1_3_2_21_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.123.070505"},{"key":"e_1_3_2_22_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.98.052316"},{"key":"e_1_3_2_23_1","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_24_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511976667"},{"key":"e_1_3_2_25_1","doi-asserted-by":"publisher","unstructured":"Tirthak Patel Ed Younis Costin Iancu Wibe de Jong and Devesh Tiwari. 2022. QUEST: Systematically Approximating Quantum Circuits for Higher Output Fidelity. In Proceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems (Lausanne Switzerland) (ASPLOS \u201822). Association for Computing Machinery New York NY USA 514-528. https:\/\/doi.org\/10.1145\/3503222.3507739 10.1145\/3503222.3507739","DOI":"10.1145\/3503222.3507739"},{"key":"e_1_3_2_26_1","doi-asserted-by":"publisher","unstructured":"Martin Ringbauer Michael Meth Lukas Postler Roman Stricker Rainer Blatt Philipp Schindler and Thomas Monz. 2022. A universal qudit quantum processor with trapped ions. Nat. Phy. 5 (May 2022). https:\/\/doi.org\/10.1038\/s41567-022-01658-0 10.1038\/s41567-022-01658-0","DOI":"10.1038\/s41567-022-01658-0"},{"key":"e_1_3_2_27_1","doi-asserted-by":"publisher","unstructured":"Sara Achour Ritvik Sharma. 2024. Dare Compiler. https:\/\/doi.org\/10.5281\/zenodo.10807175 10.5281\/zenodo.10807175","DOI":"10.5281\/zenodo.10807175"},{"key":"e_1_3_2_28_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevApplied.19.064024"},{"key":"e_1_3_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1120725.1120847"},{"key":"e_1_3_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-008-9215-6"},{"key":"e_1_3_2_31_1","doi-asserted-by":"crossref","unstructured":"Yasuhiro Takahashi Seiichiro Tani and Noboru Kunihiro. 2010. Quantum Addition Circuits and Unbounded Fan-Out. Quantum Info. Comput. 10 9 (sep 2010) 872-890.","DOI":"10.26421\/QIC10.9-10-12"},{"key":"e_1_3_2_32_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 Proceedings of the 43rd<italic>ACM<\/italic> 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. 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\/3656388","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3656388","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T20:43:28Z","timestamp":1751661808000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3656388"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,20]]},"references-count":31,"journal-issue":{"issue":"PLDI","published-print":{"date-parts":[[2024,6,20]]}},"alternative-id":["10.1145\/3656388"],"URL":"https:\/\/doi.org\/10.1145\/3656388","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"}}]}}