Add to ORKGWe define a strongly normalising proof-net calculus corresponding to the logic of strongly compact closed categories with biproducts. The calculus is a full and faithful representation of the free strongly compact closed category with biproducts on a given category with an involution. This syntax can be used to represent and reason about quantum processes
Categorical quantum mechanics exploits the dagger compact closed structure offinite dimensional Hilb...
International audienceWe build on the series of work by Dal Lago and coauthors and identify proof ne...
These lecture notes survey some joint work with Samson Abramsky as it was presented by me at Mathema...
We define a strongly normalising proof-net calculus corresponding to the logic of strongly compact c...
Just as conventional functional programs may be understood as proofs in an intuitionistic logic, so ...
Just as conventional functional programs may be understood as proofs in an intuitionistic logic, so ...
We develop a type theory and provide a denotational semantics for a simple fragment of the quantum l...
We propose a new typed graphical language for quantum computation, based on compact categories with ...
We propose a new typed graphical language for quantum computation, based on compact categories with ...
We propose a new typed graphical language for quantum computation, based on compact categories with ...
We propose a new typed graphical language for quantum computation, based on compact categories with ...
We propose a new typed graphical language for quantum computation, based on compact categories with ...
We propose a new typed graphical language for quantum computation, based on compact categories with ...
We propose a new typed graphical language for quantum computation, based on compact categories with ...
These lecture notes survey some joint work with Samson Abramsky as it was presented by me at Mathema...
Categorical quantum mechanics exploits the dagger compact closed structure offinite dimensional Hilb...
International audienceWe build on the series of work by Dal Lago and coauthors and identify proof ne...
These lecture notes survey some joint work with Samson Abramsky as it was presented by me at Mathema...
We define a strongly normalising proof-net calculus corresponding to the logic of strongly compact c...
Just as conventional functional programs may be understood as proofs in an intuitionistic logic, so ...
Just as conventional functional programs may be understood as proofs in an intuitionistic logic, so ...
We develop a type theory and provide a denotational semantics for a simple fragment of the quantum l...
We propose a new typed graphical language for quantum computation, based on compact categories with ...
We propose a new typed graphical language for quantum computation, based on compact categories with ...
We propose a new typed graphical language for quantum computation, based on compact categories with ...
We propose a new typed graphical language for quantum computation, based on compact categories with ...
We propose a new typed graphical language for quantum computation, based on compact categories with ...
We propose a new typed graphical language for quantum computation, based on compact categories with ...
We propose a new typed graphical language for quantum computation, based on compact categories with ...
These lecture notes survey some joint work with Samson Abramsky as it was presented by me at Mathema...
Categorical quantum mechanics exploits the dagger compact closed structure offinite dimensional Hilb...
International audienceWe build on the series of work by Dal Lago and coauthors and identify proof ne...
These lecture notes survey some joint work with Samson Abramsky as it was presented by me at Mathema...