Hostname: page-component-745bb68f8f-grxwn Total loading time: 0 Render date: 2025-01-13T14:26:12.518Z Has data issue: false hasContentIssue false
  • English
  • Français

Towards a quantum programming language

Published online by Cambridge University Press:  05 August 2004

PETER SELINGER
PETER SELINGER
Affiliation:
Department of Mathematics and Statistics, University of Ottawa, Ottawa, Ontario K1N 6N5, Canada Email: selinger@mathstat.uottawa.ca
Get access Rights & Permissions [Opens in a new window]

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.

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 14 , Issue 4 , August 2004 , pp. 527 - 586
Copyright
2004 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)