We develop a type theory and provide a denotational semantics for a simple fragment of the quantum lambda calculus, a formal language for quantum computation based on linear logic. In our semantics, variables inhabit certain Hilbert bundles, and computations are interpreted as appropriate inner product preserving maps between Hilbert bundles. These bundles and maps form a symmetric monoidal closed category, as expected for a calculus based on linear logic
Categorical quantum mechanics exploits the dagger compact closed structure offinite dimensional Hilb...
33 pages, extended versionInternational audienceWe examine the relationship between the algebraic {\...
33 pages, extended versionInternational audienceWe examine the relationship between the algebraic {\...
We introduce a minimal language combining both higher-order computation and linear algebra. Roughly,...
This thesis studies the categorical formalisation of quantum computing, through the prism of type th...
AbstractThis paper studies the linear fragment of the programing language for quantum computation wi...
Finding a denotational semantics for higher order quantum com-putation is a long-standing problem in...
We define a strongly normalising proof-net calculus corresponding to the logic of strongly compact c...
We define a strongly normalising proof-net calculus corresponding to the logic of strongly compact c...
Abstract—While much of the current study on quantum computation employs low-level formalisms such as...
We introduce a minimal language combining higher-order computation and linear algebra. Roughly, this...
Abstract—While much of the current study on quantum computation employs low-level formalisms such as...
We describe categorical models of a circuit-based (quantum) functional programming language. We show...
AbstractIn this paper we give a fully complete model for a linear probabilistic lambda-calculus. The...
International audienceWe build on the series of work by Dal Lago and coauthors and identify proof ne...
Categorical quantum mechanics exploits the dagger compact closed structure offinite dimensional Hilb...
33 pages, extended versionInternational audienceWe examine the relationship between the algebraic {\...
33 pages, extended versionInternational audienceWe examine the relationship between the algebraic {\...
We introduce a minimal language combining both higher-order computation and linear algebra. Roughly,...
This thesis studies the categorical formalisation of quantum computing, through the prism of type th...
AbstractThis paper studies the linear fragment of the programing language for quantum computation wi...
Finding a denotational semantics for higher order quantum com-putation is a long-standing problem in...
We define a strongly normalising proof-net calculus corresponding to the logic of strongly compact c...
We define a strongly normalising proof-net calculus corresponding to the logic of strongly compact c...
Abstract—While much of the current study on quantum computation employs low-level formalisms such as...
We introduce a minimal language combining higher-order computation and linear algebra. Roughly, this...
Abstract—While much of the current study on quantum computation employs low-level formalisms such as...
We describe categorical models of a circuit-based (quantum) functional programming language. We show...
AbstractIn this paper we give a fully complete model for a linear probabilistic lambda-calculus. The...
International audienceWe build on the series of work by Dal Lago and coauthors and identify proof ne...
Categorical quantum mechanics exploits the dagger compact closed structure offinite dimensional Hilb...
33 pages, extended versionInternational audienceWe examine the relationship between the algebraic {\...
33 pages, extended versionInternational audienceWe examine the relationship between the algebraic {\...