Name
Abstract | ||
|---|---|---|
We propose the design of a programming language for quantum computing. Traditionally, quantum algorithms are frequently expressed at the hardware level, for instance in terms of the quantum circuit model or quantum Turing machines. These approaches do not encourage structured programming or abstractions such as data types. In this paper, we describe the syntax and semantics of a simple quantum programming language with high-level features such as loops, recursive procedures, and structured data types. The language is functional in nature, statically typed, free of run-time errors, and has an interesting denotational semantics in terms of complete partial orders of superoperators. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1017/S0960129504004256 | Mathematical Structures in Computer Science |
Keywords | Field | DocType |
simple quantum programming language,quantum computing,data type,quantum turing machine,interesting denotational semantics,programming language,complete partial order,structured data type,quantum circuit model,quantum algorithm | Functional logic programming,Quantum programming,Programming language,Programming paradigm,Computer science,Theoretical computer science,Quantum algorithm,First-generation programming language,Programming language theory,Language primitive,Semantics (computer science) | Journal |
Volume | Issue | ISSN |
14 | 4 | 0960-1295 |
Citations | PageRank | References |
157 | 12.12 | 7 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter Selinger | 1 | 434 | 36.65 |