Skip to Main content Skip to Navigation

Semantics for a Higher Order Functional Programming Language for Quantum Computation

Abstract : The objective of this thesis is to develop a semantics for higher order quantum information. Following the work done in the author's M.Sc. thesis, we study a lambda calculus for quantum computation with classical control. The language features two important properties. The first one, arising from the so-called no-cloning theorem of quantum computation, is the need for a distinction between duplicable and non-duplicable elements. For keeping track of duplicability at higher order, we use a type system inspired by the resource-sensitive linear logic. The second important aspect is the probability inherent to measurement, the only operation for retrieving classical data from quantum data. This forces us into choosing a reduction strategy for being able to define an operational semantics. We address the question of a denotational semantics in two respects. First, we restrict the study to the strictly linear aspect of the language. Doing so, we suppress the need for distinguishing between duplicable and non-duplicable elements and we can focus on the description of quantum features at higher order. Using the category of completely positive maps as a framework, we build a fully abstract denotational model of the strictly linear fragment of the language. The study of the full language is more demanding. For dealing with the probabilistic aspect of the language, we use a method inspired by Moggi and build a computational model with a distinction between values and computations. For the distinction between duplicability and non-duplicability in the calculus, we adapt Bierman's linear category, where the duplication is considered as a comonad with specific properties. The resulting model is what we call a linear category for duplication. Finally, we only focus on the fragment of the language that contains the aforementioned elements, and remove the classical Boolean and quantum Boolean features to get a generic computational linear lambda-calculus. In this idealized setting, we show that such a language have a full and complete interpretation in a linear category for duplication.
Document type :
Complete list of metadata
Contributor : Benoît Valiron Connect in order to contact the contributor
Submitted on : Monday, May 17, 2010 - 3:14:05 PM
Last modification on : Thursday, September 2, 2021 - 8:14:03 AM
Long-term archiving on: : Thursday, September 16, 2010 - 2:22:06 PM


  • HAL Id : tel-00483944, version 1


Benoît Valiron. Semantics for a Higher Order Functional Programming Language for Quantum Computation. Other [cs.OH]. University of Ottawa, 2008. English. ⟨tel-00483944⟩



Record views


Files downloads