Skip to main content Accessibility help
×
Home

A lambda calculus for quantum computation with classical control

  • PETER SELINGER (a1) and BENOIT VALIRON (a2)

Abstract

In this paper we develop a functional programming language for quantum computers by extending the simply-typed lambda calculus with quantum types and operations. The design of this language adheres to the ‘quantum data, classical control’ paradigm, following the first author's work on quantum flow-charts. We define a call-by-value operational semantics, and give a type system using affine intuitionistic linear logic. The main results of this paper are the safety properties of the language and the development of a type inference algorithm.

Copyright

Related content

Powered by UNSILO

A lambda calculus for quantum computation with classical control

  • PETER SELINGER (a1) and BENOIT VALIRON (a2)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.