Quantum Coherent Spaces were introduced by Girard as a quantum framework where to interpret the exponential-free fragment of Linear Logic. Aim of this paper is to extend Girard's interpretation to a subsystem of linear logic with bounded exponentials. We provide deduction rules for the bounded exponentials and, correspondingly, we introduce the novel notion of bounded exponentials of Quantum Coherent Spaces. We show that the latter provide a categorical model of our system. In order to do that, we first study properties of the category of Quantum Coherent Spaces.
Quantum Coherent Spaces were introduced by Girard as a quantum framework where to interpret the exponential-free fragment of Linear Logic. Aim of this paper is to extend Girard's interpretation to a subsystem of linear logic with bounded exponentials. We provide deduction rules for the bounded exponentials and, correspondingly, we introduce the novel notion of bounded exponentials of Quantum Coherent Spaces. We show that the latter provide a categorical model of our system. In order to do that, we first study properties of the category of Quantum Coherent Spaces.
The exponential modalities of linear logic have been used by various authors to model infinite-dimensional quantum systems. This paper explains how these modalities can also give rise to the complementarity principle of quantum mechanics. The paper uses a formulation of quantum systems based on dagger-linear logic, whose categorical semantics lies in mixed unitary categories, and a formulation of measurement therein. The main result exhibits a complementary system as the result of measurements on free exponential modalities. Recalling that, in linear logic, exponential modalities have two distinct but dual components, ! and ?, this shows how these components under measurement become "compacted" into the usual notion of complementary Frobenius algebras from categorical quantum mechanics.
The search for a semantics for higher-order quantum computation leads naturallyto the study of categories of normed cones. In the first part of this paper, we develop the theory of continuous normed cones, and prove some of their basic properties, includinga Hahn-Banach style theorem. We then describe two different concrete *-autonomous categories of normed cones. The first of these categories is built from completelypositive maps as in the author's semantics of first-order quantum computation. The second category is a reformulation of Girard's quantum coherent spaces. We also pointout why ultimately, neither of these categories is a satisfactory model of higher-order quantum computation.
The report deals with the axiomatic approach to the phenomena of quantum computation and algorithms. It gives an overview of the classical approach (due to von Neumann) using the structures of Hilbert spaces, as well as mentions some major results in the field and discusses the flaws of the model and its current dominance. This leads to the introduction of a new axiomatization, first proposed by S. Abramsky and B. Coecke in 2007, which relies on the modern concepts of category theory. It is a field of mathematics originally created in the 1940s by specialists in algebraic topology but currently gaining popularity in other branches because of its abstract nature and emphasis on operations rather than objects. Most importantly, category theory is a powerful tool in functional analysis allowing mathematicians to reformulate the statements of Hilbert space theory in a more intuitive way, without matrix calculus. Finally, the logic behind quantum operations is discussed: it is revealed that the ideas of quantum algorithms have a strong connection to Jean-Yves Girard’s linear logic.
This thesis is a study of the construction and representation of typed models of quantum mechanics for use in quantum computation. We introduce logical and graphical syntax for quantum mechanical processes and prove that these formal systems provide sound and complete representations of abstract quantum mechanics. In addition, we demonstrate how these representations may be used to reason about the behaviour of quantum computational processes. Quantum computation is presently mired in low-level formalisms, mostly derived directly from matrices over Hilbert spaces. These formalisms are an obstacle to the full understanding and exploitation of quantum effects in informatics since they obscure the essential structure of quantum states and processes. The aim of this work is to introduce higher level tools for quantum mechanics which will be better suited to computation than those presently employed in the field. Inessential details of Hilbert space representations are removed and the informatic structures are presented directly. Entangled states are particularly important in this treatment, as is appropriate, since entanglement is a fundamental driver of quantum computation. The benefits two-fold: as well as producing foundational tools for the study of quantum computation this work also connects quantum mechanics to mainstream areas of computer science such as categorical logic, type theory, program language semantics, and rewriting. We describe, following Abramsky and Coecke, how quantum mechanics may be carried out without reference to Hilbert space, in a strongly compact closed category. In particular we show how to freely construct a categorical model of abstract quantum mechanics from an arbitrary category. We introduceMultiplicative Categorical Quantum Logic (mCQL), a sequent calculus whose proof rules capture the structure of compact closed categories. This sequent calculus is interpreted in a freely generated compact closed category, and its semantics is sound with respect to cut elimination. We define an equivalent graphical syntax, similar to linear logic’s proof-nets, and prove that these proof-nets provide a full and faithful representation of any freely generated compact closed category. Further analysis of the structure of quantum states which correspond to mCQL proofs using multiplicative linear logic shows that the linear type system describes the quantum entanglement found in such states. We show that the entanglement present in these states is always of a particularly simple form: collections of entangled pairs. In order to tackle arbitrary entanglement, we generalise the work of Kelly and Laplaza to give a representation theorem for the free compact closed category by a polycategory. Such categories are shown to be equivalent to a generalised system of proof-nets whose axioms may have more than one premise
This thesis develops the categorical proof theory for the non-compact multiplicative dagger linear logic, and investigates its applications to Categorical Quantum Mechanics (CQM). The existing frameworks of CQM are categorical proof theories of compact dagger linear logic, and are motivated by the interpretation of quantum systems in the category of finite dimensional Hilbert spaces. This thesis describes a new non-compact framework called Mixed Unitary Categories which can accommodate infinite dimensional systems, and develops models for the framework. To this end, it builds on linearly distributive categories, and ∗-autonomous categories which are categorical proof theories of (non-compact) multiplicative linear logic. The proof theory of non-compact dagger-linear logic is obtained from the basic setting of an LDC by adding a dagger functor satisfying appropriate coherences to give a dagger-LDC. From every (isomix) dagger-LDC one can extract a canonical "unitary core" which up to equivalence is the traditional CQM framework of dagger-monoidal categories. This leads to the framework of Mixed Unitary Categories (MUCs): every MUC contains a (compact) unitary core which is extended by a (non-compact) isomix dagger-LDC. Various models of MUCs based on Finiteness Spaces, Chu spaces, Hopf modules, etc., are developed in this thesis. This thesis also generalizes the key algebraic structures of CQM, such as observables, measurement, and complementarity, to MUC framework. Furthermore, using the MUC framework, this thesis establishes a connection between the complementary observables of quantum mechanics and the exponential modalities of linear logic.
Categorical quantum mechanics exploits the dagger compact closed structure of finite dimensional Hilbert spaces, and uses the graphical calculus of string diagrams to facilitate reasoning about finite dimensional processes. A significant portion of quantum physics, however, involves reasoning about infinite dimensional processes, and it is well-known that the category of all Hilbert spaces is not compact closed. Thus, a limitation of using dagger compact closed categories is that one cannot directly accommodate reasoning about infinite dimensional processes. A natural categorical generalization of compact closed categories, in which infinite dimensional spaces can be modelled, is *-autonomous categories and, more generally, linearly distributive categories. This article starts the development of this direction of generalizing categorical quantum mechanics. An important first step is to establish the behaviour of the dagger in these more general settings. Thus, these notes simultaneously develop the categorical semantics of multiplicative dagger linear logic. The notes end with the definition of a mixed unitary category. It is this structure which is subsequently used to extend the key features of categorical quantum mechanics.