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 条
  • [21] Classical and quantum communications in grid computing
    Dima, M.
    Dulea, M.
    Aranghel, D.
    Mitrica, B.
    Petre, M.
    Stoica, M.
    Udrea, M.
    Sterian, R.
    Sterian, P.
    OPTOELECTRONICS AND ADVANCED MATERIALS-RAPID COMMUNICATIONS, 2010, 4 (11): : 1840 - 1843
  • [22] CLASSICAL AND QUANTUM COMMUNICATIONS IN GRID COMPUTING
    Dima, Mihai Octavian
    Petre, Marian
    Aranghel, Dorina
    Mitrica, Bogdan
    Dulea, Mihnea
    Petre, Carmelia
    Stoica, Mihaela
    Udrea, Mircea
    Sterian, Rodica
    Sterian, Paul
    Badita, Chivuta Ramona
    JOURNAL OF SCIENCE AND ARTS, 2010, (02): : 403 - 408
  • [23] The Polynomial Method in Quantum and Classical Computing
    Aaronson, Scott
    PROCEEDINGS OF THE 49TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2008, : 3 - 3
  • [24] Quantum Foundations of Classical Reversible Computing
    Frank, Michael P.
    Shukla, Karpur
    ENTROPY, 2021, 23 (06)
  • [25] An Axiomatization for Quantum Processes to Unifying Quantum and Classical Computing
    Wang, Yong
    INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 2019, 58 (10) : 3295 - 3322
  • [26] An Axiomatization for Quantum Processes to Unifying Quantum and Classical Computing
    Yong Wang
    International Journal of Theoretical Physics, 2019, 58 : 3295 - 3322
  • [27] QUANTUM STATE TRANSITION DIAGRAMS - A BRIDGE FROM CLASSICAL COMPUTING TO QUANTUM COMPUTING
    Hook, Loyd R.
    Lee, Samuel C.
    NANOSENSORS, BIOSENSORS, AND INFO-TECH SENSORS AND SYSTEMS 2010, 2010, 7646
  • [28] Classical computing, quantum computing, and Shor's factoring algorithm
    Manin, YI
    ASTERISQUE, 2000, (266) : 375 - +
  • [29] Dynamics of a Free Particle Using Classical Computing and Quantum Computing: Introducing Quantum Computing to Chemistry Students
    Bhattacharya, Atanu
    Dasgupta, Kalyan
    Paine, Binoy
    JOURNAL OF CHEMICAL EDUCATION, 2024, 101 (04) : 1599 - 1609
  • [30] A Unified Approach to Quantum Computation and Classical Reversible Computation
    De Vos, Alexis
    De Baerdemacker, Stijn
    REVERSIBLE COMPUTATION, RC 2018, 2018, 11106 : 133 - 143