{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T20:23:56Z","timestamp":1791231836249,"version":"4.1.0"},"reference-count":46,"publisher":"Association for Computing Machinery (ACM)","issue":"POPL","license":[{"start":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T00:00:00Z","timestamp":1673222400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100006192","name":"Advanced Scientific Computing Research","doi-asserted-by":"publisher","award":["DE-SC0019040"],"award-info":[{"award-number":["DE-SC0019040"]}],"id":[{"id":"10.13039\/100006192","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA95502110051"],"award-info":[{"award-number":["FA95502110051"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1730449"],"award-info":[{"award-number":["CCF-1730449"]}],"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":[[2023,1,9]]},"abstract":"<jats:p>We introduce Qunity, a new quantum programming language designed to treat quantum computing as a natural generalization of classical computing. Qunity presents a unified syntax where familiar programming constructs can have both quantum and classical effects. For example, one can use sum types to implement the direct sum of linear operators, exception-handling syntax to implement projective measurements, and aliasing to induce entanglement. Further, Qunity takes advantage of the overlooked BQP subroutine theorem, allowing one to construct reversible subroutines from irreversible quantum algorithms through the uncomputation of \"garbage\" outputs. Unlike existing languages that enable quantum aspects with separate add-ons (like a classical language with quantum gates bolted on), Qunity provides a unified syntax and a novel denotational semantics that guarantees that programs are quantum mechanically valid. We present Qunity's syntax, type system, and denotational semantics, showing how it can cleanly express several quantum algorithms. We also detail how Qunity can be compiled into a low-level qubit circuit language like OpenQASM, proving the realizability of our design.<\/jats:p>","DOI":"10.1145\/3571225","type":"journal-article","created":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T21:58:14Z","timestamp":1673474294000},"page":"921-951","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":38,"title":["Qunity: A Unified Language for Quantum and Classical Computing"],"prefix":"10.1145","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1913-4178","authenticated-orcid":false,"given":"Finn","family":"Voichick","sequence":"first","affiliation":[{"name":"University of Maryland, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8184-0244","authenticated-orcid":false,"given":"Liyi","family":"Li","sequence":"additional","affiliation":[{"name":"University of Maryland, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6842-5505","authenticated-orcid":false,"given":"Robert","family":"Rand","sequence":"additional","affiliation":[{"name":"University of Chicago, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2759-9223","authenticated-orcid":false,"given":"Michael","family":"Hicks","sequence":"additional","affiliation":[{"name":"University of Maryland, USA \/ Amazon, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,1,11]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2005.1"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/080712167"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63390-9_1"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.23638\/LMCS-13(1:8)2017"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11080-6"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796300933"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3386007"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.195.3"},{"key":"e_1_2_1_9_1","unstructured":"Kostia Chardonnet Marc de Visme Beno\u00eet Valiron and Renaud Vilmart. 2022. The Many-Worlds Calculus: Representing Quantum Control. arxiv:2206.10234. \t\t\t\t  Kostia Chardonnet Marc de Visme Beno\u00eet Valiron and Renaud Vilmart. 2022. The Many-Worlds Calculus: Representing Quantum Control. arxiv:2206.10234."},{"key":"e_1_2_1_10_1","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. arxiv:quant-ph\/0703015. \t\t\t\t  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. arxiv:quant-ph\/0703015."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.82.1"},{"key":"e_1_2_1_12_1","unstructured":"Andrew W Cross Lev S Bishop John A Smolin and Jay M Gambetta. 2017. Open Quantum Assembly Language. arxiv:1707.03429. https:\/\/github.com\/Qiskit\/openqasm\/tree\/OpenQASM2.x \t\t\t\t  Andrew W Cross Lev S Bishop John A Smolin and Jay M Gambetta. 2017. Open Quantum Assembly Language. arxiv:1707.03429. https:\/\/github.com\/Qiskit\/openqasm\/tree\/OpenQASM2.x"},{"key":"e_1_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Andrew W Cross Ali Javadi-Abhari Thomas Alexander Niel de Beaudrap Lev S Bishop Steven Heidel Colm A Ryan John Smolin Jay M Gambetta and Blake R Johnson. 2021. OpenQASM 3: A broader and deeper quantum assembly language. arxiv:2104.14722. https:\/\/qiskit.github.io\/openqasm\/ \t\t\t\t  Andrew W Cross Ali Javadi-Abhari Thomas Alexander Niel de Beaudrap Lev S Bishop Steven Heidel Colm A Ryan John Smolin Jay M Gambetta and Blake R Johnson. 2021. OpenQASM 3: A broader and deeper quantum assembly language. arxiv:2104.14722. https:\/\/qiskit.github.io\/openqasm\/","DOI":"10.1145\/3505636"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1985.0070"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3373718.3394765"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1090\/psapm\/068"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2011.01.015"},{"key":"e_1_2_1_18_1","volume-title":"A functional quantum programming language. Ph. D. Dissertation","author":"Grattage Jonathan James","unstructured":"Jonathan James Grattage . 2006. A functional quantum programming language. Ph. D. Dissertation . University of Nottingham. http :\/\/eprints.nottingham.ac.uk\/10250\/ Jonathan James Grattage. 2006. A functional quantum programming language. Ph. D. Dissertation. University of Nottingham. http:\/\/eprints.nottingham.ac.uk\/10250\/"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462177"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.76.3228"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139031103"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322230"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103667"},{"key":"e_1_2_1_24_1","volume-title":"An Introduction to Quantum Computing","author":"Kaye Phillip","unstructured":"Phillip Kaye , Raymond Laflamme , and Michele Mosca . 2007. An Introduction to Quantum Computing . Oxford University Press , Oxford . Phillip Kaye, Raymond Laflamme, and Michele Mosca. 2007. An Introduction to Quantum Computing. Oxford University Press, Oxford."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.2172\/366453"},{"key":"e_1_2_1_26_1","volume-title":"Efficient algorithms in quantum query complexity. Ph. D. Dissertation","author":"Kothari Robin","unstructured":"Robin Kothari . 2014. Efficient algorithms in quantum query complexity. Ph. D. Dissertation . University of Waterloo . http:\/\/hdl.handle.net\/10012\/8625 Robin Kothari. 2014. Efficient algorithms in quantum query complexity. Ph. D. Dissertation. University of Waterloo. http:\/\/hdl.handle.net\/10012\/8625"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3428218"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3563309"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.2307\/1968867"},{"key":"e_1_2_1_30_1","volume-title":"Quantum Computation and Quantum Information (10 th anniversary ed.)","author":"Nielsen Michael A","unstructured":"Michael A Nielsen and Isaac L Chuang . 2010. Quantum Computation and Quantum Information (10 th anniversary ed.) . Cambridge University Press , Cambridge, UK . https:\/\/worldcat.org\/en\/title\/700706156 Michael A Nielsen and Isaac L Chuang. 2010. Quantum Computation and Quantum Information (10 th anniversary ed.). Cambridge University Press, Cambridge, UK. https:\/\/worldcat.org\/en\/title\/700706156"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009894"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2018-08-06-79"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.287.17"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-72831-5"},{"key":"e_1_2_1_35_1","volume-title":"Algebraic and Logical Methods in Quantum Computation. Ph. D. Dissertation","author":"Ross Neil Julien","unstructured":"Neil Julien Ross . 2015. Algebraic and Logical Methods in Quantum Computation. Ph. D. Dissertation . Dalhousie University . arxiv:1510.02198. https:\/\/hdl.handle.net\/10222\/60819 Neil Julien Ross. 2015. Algebraic and Logical Methods in Quantum Computation. Ph. D. Dissertation. Dalhousie University. arxiv:1510.02198. https:\/\/hdl.handle.net\/10222\/60819"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-89366-2_19"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129504004256"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139193313.005"},{"key":"e_1_2_1_39_1","unstructured":"John van de Wetering. 2020. ZX-calculus for the working quantum computer scientist. arxiv:2012.13966. \t\t\t\t  John van de Wetering. 2020. ZX-calculus for the working quantum computer scientist. arxiv:2012.13966."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703432165"},{"key":"e_1_2_1_41_1","volume-title":"Qunity: A Unified Language for Quantum and Classical Computing (Extended Version). arxiv:2204.12384.","author":"Voichick Finn","year":"2022","unstructured":"Finn Voichick , Liyi Li , Robert Rand , and Michael Hicks . 2022 . Qunity: A Unified Language for Quantum and Classical Computing (Extended Version). arxiv:2204.12384. Finn Voichick, Liyi Li, Robert Rand, and Michael Hicks. 2022. Qunity: A Unified Language for Quantum and Classical Computing (Extended Version). arxiv:2204.12384."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.7150282"},{"key":"e_1_2_1_43_1","volume-title":"Advanced Topics in Types and Programming Languages","author":"Walker David","unstructured":"David Walker . 2004. Substructural Type Systems . In Advanced Topics in Types and Programming Languages , Benjamin C Pierce (Ed.). The MIT Press , Cambridge, MA . David Walker. 2004. Substructural Type Systems. In Advanced Topics in Types and Programming Languages, Benjamin C Pierce (Ed.). The MIT Press, Cambridge, MA."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-30440-3_428"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1038\/299802a0"},{"key":"e_1_2_1_46_1","volume-title":"Foundations of Quantum Programming","author":"Ying Mingsheng","unstructured":"Mingsheng Ying . 2016. Foundations of Quantum Programming . Elsevier Science , Cambridge, MA . https:\/\/worldcat.org\/en\/title\/1027777388 Mingsheng Ying. 2016. Foundations of Quantum Programming. Elsevier Science, Cambridge, MA. https:\/\/worldcat.org\/en\/title\/1027777388"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3571225","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3571225","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:08:21Z","timestamp":1750183701000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3571225"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,9]]},"references-count":46,"journal-issue":{"issue":"POPL","published-print":{"date-parts":[[2023,1,9]]}},"alternative-id":["10.1145\/3571225"],"URL":"https:\/\/doi.org\/10.1145\/3571225","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,9]]},"assertion":[{"value":"2023-01-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}