Qunity: A Unified Language for Quantum and Classical Computing

被引:0
|
作者
Voichick F. [1 ]
Li L. [1 ]
Rand R. [2 ]
Hicks M. [1 ]
机构
[1] University of Maryland, Amazon, College Park
[2] University of Chicago, Chicago
关键词
algebraic data types; Kraus operators; quantum subroutines; reversible computing;
D O I
10.1145/3571225
中图分类号
学科分类号
摘要
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. © 2023 Owner/Author.
引用
收藏
页码:921 / 951
页数:30
相关论文
共 50 条
  • [41] Programmable Quantum Gates for Classical Computing Applications
    Shankarpurkar, Ayush
    Manmeet
    Chatterjee, Vinayak
    Khairnar, Mohit
    Bharti, Gaurav Kumar
    2024 IEEE INTERNATIONAL CONFERENCE ON AUTOMATIC CONTROL AND INTELLIGENT SYSTEMS, I2CACIS 2024, 2024, : 181 - 185
  • [42] Transparallel mind: classical computing with quantum power
    van der Helm, Peter A.
    ARTIFICIAL INTELLIGENCE REVIEW, 2015, 44 (03) : 341 - 363
  • [43] Beating Classical Computing Without a Quantum Computer
    Franson, James D.
    SCIENCE, 2013, 339 (6121) : 767 - 768
  • [44] On the Possibility of Classical Client Blind Quantum Computing
    Cojocaru, Alexandru
    Colisson, Leo
    Kashefi, Elham
    Wallden, Petros
    CRYPTOGRAPHY, 2021, 5 (01) : 1 - 50
  • [45] Experimental Blind Quantum Computing for a Classical Client
    Huang, He-Liang
    Zhao, Qi
    Ma, Xiongfeng
    Liu, Chang
    Su, Zu-En
    Wang, Xi-Lin
    Li, Li
    Liu, Nai-Le
    Sanders, Barry C.
    Lu, Chao-Yang
    Pan, Jian-Wei
    PHYSICAL REVIEW LETTERS, 2017, 119 (05)
  • [46] Effectiveness of quantum algorithms on classical computing complexities
    Amellal, H.
    Meslouhi, A.
    El Allati, A.
    PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON SMART CITY APPLICATIONS (SCA'18), 2018,
  • [47] Transparallel mind: classical computing with quantum power
    Peter A. van der Helm
    Artificial Intelligence Review, 2015, 44 : 341 - 363
  • [48] Computing on the verge of chaos: classical and quantum reservoirs
    Felbacq, Didier
    Rousseau, Emmanuel
    Kling, Emmanuel
    ACTIVE PHOTONIC PLATFORMS, APP 2024, 2024, 13110
  • [49] Heterotic Quantum and Classical Computing on Convergence Spaces
    Patten, D. R.
    Jakel, D. W.
    Irwin, R. J.
    Blair, H. A.
    QUANTUM INFORMATION AND COMPUTATION XIII, 2015, 9500
  • [50] Quantum Vs Classical Computing: a Comparative Analysis
    Belkhir, Maria
    Benkaouha, Haroun
    Benkhelifa, Elhadj
    2022 SEVENTH INTERNATIONAL CONFERENCE ON FOG AND MOBILE EDGE COMPUTING, FMEC, 2022, : 137 - 144