Qunity: A Unified Language for Quantum and Classical Computing

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 im...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of ACM on programming languages Ročník 7; číslo POPL; s. 921 - 951
Hlavní autoři: Voichick, Finn, Li, Liyi, Rand, Robert, Hicks, Michael
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY, USA ACM 09.01.2023
Témata:
Assertions
Categorical semantics
Compilers
Control primitives
Control structures
Data types and structures
Denotational semantics
Functional languages
Multiparadigm languages
Patterns
Quantum information theory
Quantum query complexity
Semantics
Software and its engineering
Syntax
Theory of computation
Kraus operators
algebraic data types
reversible computing
quantum subroutines
ISSN:2475-1421, 2475-1421
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISSN:2475-1421
2475-1421
DOI:10.1145/3571225