We describe categorical models of a circuit-based (quantum) functional programming language. We show that enriched categories play a crucial role. Following earlier work on QWire by Paykin et al., we consider both a simple first-order linear language for circuits, and a more powerful host language, such that the circuit language is embedded inside the host language. Our categorical semantics for the host language is standard, and involves cartesian closed categories and monads. We interpret the circuit language not in an ordinary category, but in a category that is enriched in the host category. We show that this structure is also related to linear/non-linear models. As an extended example, we recall an earlier result that the category of W...
International audienceIn this paper, we introduce dynamic lifting to a quantum circuit-description l...
AbstractThis paper studies the linear fragment of the programing language for quantum computation wi...
Abstract—A classical circuit can be represented by a circuit graph or equivalently by a Boolean expr...
We describe categorical models of a circuit-based (quantum) functional programming language. We show...
Contains fulltext : 191029.pdf (publisher's version ) (Open Access) ...
We develop a type theory and provide a denotational semantics for a simple fragment of the quantum l...
This dissertation has two main parts. The first part deals with questions relating to Haghverdi and ...
We propose a categorical foundation for the connection between pure and mixed states in quantum info...
We propose a categorical foundation for the connection between pure and mixed states in quantum info...
This thesis studies the categorical formalisation of quantum computing, through the prism of type th...
International audienceIn this paper, we introduce dynamic lifting to a quantum circuit-description l...
International audienceIn this paper, we introduce dynamic lifting to a quantum circuit-description l...
International audienceIn this paper, we introduce dynamic lifting to a quantum circuit-description l...
International audienceIn this paper, we introduce dynamic lifting to a quantum circuit-description l...
International audienceIn this paper, we introduce dynamic lifting to a quantum circuit-description l...
International audienceIn this paper, we introduce dynamic lifting to a quantum circuit-description l...
AbstractThis paper studies the linear fragment of the programing language for quantum computation wi...
Abstract—A classical circuit can be represented by a circuit graph or equivalently by a Boolean expr...
We describe categorical models of a circuit-based (quantum) functional programming language. We show...
Contains fulltext : 191029.pdf (publisher's version ) (Open Access) ...
We develop a type theory and provide a denotational semantics for a simple fragment of the quantum l...
This dissertation has two main parts. The first part deals with questions relating to Haghverdi and ...
We propose a categorical foundation for the connection between pure and mixed states in quantum info...
We propose a categorical foundation for the connection between pure and mixed states in quantum info...
This thesis studies the categorical formalisation of quantum computing, through the prism of type th...
International audienceIn this paper, we introduce dynamic lifting to a quantum circuit-description l...
International audienceIn this paper, we introduce dynamic lifting to a quantum circuit-description l...
International audienceIn this paper, we introduce dynamic lifting to a quantum circuit-description l...
International audienceIn this paper, we introduce dynamic lifting to a quantum circuit-description l...
International audienceIn this paper, we introduce dynamic lifting to a quantum circuit-description l...
International audienceIn this paper, we introduce dynamic lifting to a quantum circuit-description l...
AbstractThis paper studies the linear fragment of the programing language for quantum computation wi...
Abstract—A classical circuit can be represented by a circuit graph or equivalently by a Boolean expr...