AbstractThis paper studies the linear fragment of the programing language for quantum computation with classical control described in [Selinger, P. and B. Valiron, A lambda calculus for quantum computation with classical control, in: P. Urzyczyn, editor, Proceedings of the Seventh International Conference on Typed Lambda Calculi and Applications (TLCA 2005), Lecture Notes in Computer Science 3461 (2005), pp. 354–368]. We sketch the language, and discuss equivalence of terms. We also describe a fully abstract denotational semantics based on completely positive maps
We develop a type theory and provide a denotational semantics for a simple fragment of the quantum l...
This thesis introduces the language QML, a functional language for quantum computations on finite ty...
Abstract—While much of the current study on quantum computation employs low-level formalisms such as...
AbstractThis paper studies the linear fragment of the programing language for quantum computation wi...
The objective of this thesis is to develop a semantics for higher order quantum information. Followi...
In this thesis, we study quantum programming languages, and focus on the quantum lambda-calculus, a ...
International audienceQuantum programming languages permit a hardware independent, high-level descri...
International audienceWe propose a way to unify two approaches of non-cloning in quantum lambda-calc...
We introduce a minimal language combining both higher-order computation and linear algebra. Roughly,...
AbstractWe develop a sound and complete equational theory for the functional quantum programming lan...
AbstractIn this paper we define nQML, a functional quantum programming language that follows the “qu...
AbstractIn this paper we give a fully complete model for a linear probabilistic lambda-calculus. The...
International audienceWe provide a computational de nition of the notions of vector space and biline...
Finding a denotational semantics for higher order quantum com-putation is a long-standing problem in...
We propose a way to unify two approaches of non-cloning in quantum lambda-calculi. The first approac...
We develop a type theory and provide a denotational semantics for a simple fragment of the quantum l...
This thesis introduces the language QML, a functional language for quantum computations on finite ty...
Abstract—While much of the current study on quantum computation employs low-level formalisms such as...
AbstractThis paper studies the linear fragment of the programing language for quantum computation wi...
The objective of this thesis is to develop a semantics for higher order quantum information. Followi...
In this thesis, we study quantum programming languages, and focus on the quantum lambda-calculus, a ...
International audienceQuantum programming languages permit a hardware independent, high-level descri...
International audienceWe propose a way to unify two approaches of non-cloning in quantum lambda-calc...
We introduce a minimal language combining both higher-order computation and linear algebra. Roughly,...
AbstractWe develop a sound and complete equational theory for the functional quantum programming lan...
AbstractIn this paper we define nQML, a functional quantum programming language that follows the “qu...
AbstractIn this paper we give a fully complete model for a linear probabilistic lambda-calculus. The...
International audienceWe provide a computational de nition of the notions of vector space and biline...
Finding a denotational semantics for higher order quantum com-putation is a long-standing problem in...
We propose a way to unify two approaches of non-cloning in quantum lambda-calculi. The first approac...
We develop a type theory and provide a denotational semantics for a simple fragment of the quantum l...
This thesis introduces the language QML, a functional language for quantum computations on finite ty...
Abstract—While much of the current study on quantum computation employs low-level formalisms such as...