scholarly journals Dagger linear logic for categorical quantum mechanics

2021 ◽  
Vol Volume 17, Issue 4 ◽  
Author(s):  
Robin Cockett ◽  
Cole Comfort ◽  
Priyaa Srinivasan

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.

2009 ◽  
Vol 06 (01) ◽  
pp. 129-172 ◽  
Author(s):  
JESÚS CLEMENTE-GALLARDO ◽  
GIUSEPPE MARMO

We briefly review the most relevant aspects of complete integrability for classical systems and identify those aspects which should be present in a definition of quantum integrability. We show that a naive extension of classical concepts to the quantum framework would not work because all infinite dimensional Hilbert spaces are unitarilly isomorphic and, as a consequence, it would not be easy to define degrees of freedom. We argue that a geometrical formulation of quantum mechanics might provide a way out.


1984 ◽  
Vol 39 (2) ◽  
pp. 113-131
Author(s):  
Fritz Bopp

The question is often asked how to interprete quantum physics. That question does not arise in classical physics, since Newton's axioms are immediately connected with basic ideas and experiences. The same is possible in quantum physics, if we remember how elementary particle physicists describe their experiments. As Helmholtz has pointed out. the basic assumption of classical physics is that of geneidentity. That means: Bodies remain the same during their motion. Obviously, that is no longer true in quantum physics. Particles can be created and annihilated. Therefore creation and annihilation must be considered as basic processes. Motion only occurs, if a particle is annihilated in a certain point, if an equal one is created in an infinitesimally neighbouring point, and if this process is continuously going on during a certain time. Motions of that kind are compatible with the existence of some manifest creation and annihilation processes. If we accept this idea, quantum physics can be derived from first principles. As in classical physics, we know therefore what happens from the very beginning. Thus questions of interpretation become dispensable. A particular mathematical method is used to exhaust continua. The theory is formulated in a finite lattice, whose point density and extension equally go to infinity. All calculations are therefore performed in a finite dimensional Hilbert space. The results are however related to an infinite dimensional one. Earlier calculations may, therefore, be essentially correct, though they must be rejected in theories which are based on manifestly infinite dimensional Hilbert spaces. Here limiting processes do not occur in the state space. They are only admissible for numerical results.


2005 ◽  
Vol 70 (2) ◽  
pp. 353-359 ◽  
Author(s):  
J. Michael Dunn ◽  
Tobias J. Hagge ◽  
Lawrence S. Moss ◽  
Zhenghan Wang

§1. Introduction. Our understanding of Nature comes in layers, so should the development of logic. Classic logic is an indispensable part of our knowledge, and its interactions with computer science have recently dramatically changed our life. A new layer of logic has been developing ever since the discovery of quantum mechanics. G. D. Birkhoff and von Neumann introduced quantum logic in a seminal paper in 1936 [1]. But the definition of quantum logic varies among authors (see [2]). How to capture the logic structure inherent in quantum mechanics is very interesting and challenging. Given the close connection between classical logic and theoretical computer science as exemplified by the coincidence of computable functions through Turing machines, recursive function theory, and λ-calculus, we are interested in how to gain some insights about quantum logic from quantum computing. In this note we make some observations about quantum logic as motivated by quantum computing (see [5]) and hope more people will explore this connection.The quantum logic as envisioned by Birkhoff and von Neumann is based on the lattice of closed subspaces of a Hilbert space, usually an infinite dimensional one. The quantum logic of a fixed Hilbert space ℍ in this note is the variety of all the true equations with finitely many variables using the connectives meet, join and negation. Quantum computing is theoretically based on quantum systems with finite dimensional Hilbert spaces, especially the states space of a qubit ℂ2. (Actually the qubit is merely a convenience.


Author(s):  
Phillip Kaye ◽  
Raymond Laflamme ◽  
Michele Mosca

We assume the reader has a strong background in elementary linear algebra. In this section we familiarize the reader with the algebraic notation used in quantum mechanics, remind the reader of some basic facts about complex vector spaces, and introduce some notions that might not have been covered in an elementary linear algebra course. The linear algebra notation used in quantum computing will likely be familiar to the student of physics, but may be alien to a student of mathematics or computer science. It is the Dirac notation, which was invented by Paul Dirac and which is used often in quantum mechanics. In mathematics and physics textbooks, vectors are often distinguished from scalars by writing an arrow over the identifying symbol: e.g a⃗. Sometimes boldface is used for this purpose: e.g. a. In the Dirac notation, the symbol identifying a vector is written inside a ‘ket’, and looks like |a⟩. We denote the dual vector for a (defined later) with a ‘bra’, written as ⟨a|. Then inner products will be written as ‘bra-kets’ (e.g. ⟨a|b⟩). We now carefully review the definitions of the main algebraic objects of interest, using the Dirac notation. The vector spaces we consider will be over the complex numbers, and are finite-dimensional, which significantly simplifies the mathematics we need. Such vector spaces are members of a class of vector spaces called Hilbert spaces. Nothing substantial is gained at this point by defining rigorously what a Hilbert space is, but virtually all the quantum computing literature refers to a finite-dimensional complex vector space by the name ‘Hilbert space’, and so we will follow this convention. We will use H to denote such a space. Since H is finite-dimensional, we can choose a basis and alternatively represent vectors (kets) in this basis as finite column vectors, and represent operators with finite matrices. As you see in Section 3, the Hilbert spaces of interest for quantum computing will typically have dimension 2n, for some positive integer n. This is because, as with classical information, we will construct larger state spaces by concatenating a string of smaller systems, usually of size two.


2007 ◽  
Vol 05 (02) ◽  
pp. 123-136 ◽  
Author(s):  
CLAUDE VALLÉE ◽  
VICENŢIU RĂDULESCU

We extend to infinite dimensional separable Hilbert spaces the Schur convexity property of eigenvalues of a symmetric matrix with real entries. Our framework includes both the case of linear, selfadjoint, compact operators, and that of linear selfadjoint operators that can be approximated by operators of finite rank and having a countable family of eigenvalues. The abstract results of the present paper are illustrated by several examples from mechanics or quantum mechanics, including the Sturm–Liouville problem, the Schrödinger equation, and the harmonic oscillator.


2008 ◽  
Vol 05 (06) ◽  
pp. 989-1032 ◽  
Author(s):  
JESÚS CLEMENTE-GALLARDO ◽  
GIUSEPPE MARMO

In this paper we present a survey of the use of differential geometric formalisms to describe Quantum Mechanics. We analyze Schrödinger framework from this perspective and provide a description of the Weyl–Wigner construction. Finally, after reviewing the basics of the geometric formulation of quantum mechanics, we apply the methods presented to the most interesting cases of finite dimensional Hilbert spaces: those of two, three and four level systems (one qubit, one qutrit and two qubit systems). As a more practical application, we discuss the advantages that the geometric formulation of quantum mechanics can provide us with in the study of situations as the functional independence of entanglement witnesses.


2019 ◽  
Vol 16 (05) ◽  
pp. 1950080 ◽  
Author(s):  
Thomas Vetterlein

An orthogonality space is a set endowed with a symmetric, irreflexive binary relation. By means of the usual orthogonality relation, each anisotropic quadratic space gives rise to such a structure. We investigate in this paper the question to which extent this strong abstraction suffices to characterize complex Hilbert spaces, which play a central role in quantum physics. To this end, we consider postulates concerning the nature and existence of symmetries. Together with a further postulate excluding the existence of nontrivial quotients, we establish a representation theorem for finite-dimensional orthomodular spaces over a dense subfield of [Formula: see text].


Author(s):  
Phillip Kaye ◽  
Raymond Laflamme ◽  
Michele Mosca

In this section we introduce the framework of quantum mechanics as it pertains to the types of systems we will consider for quantum computing. Here we also introduce the notion of a quantum bit or ‘qubit’, which is a fundamental concept for quantum computing. At the beginning of the twentieth century, it was believed by most that the laws of Newton and Maxwell were the correct laws of physics. By the 1930s, however, it had become apparent that these classical theories faced serious problems in trying to account for the observed results of certain experiments. As a result, a new mathematical framework for physics called quantum mechanics was formulated, and new theories of physics called quantum physics were developed in this framework. Quantum physics includes the physical theories of quantum electrodynamics and quantum field theory, but we do not need to know these physical theories in order to learn about quantum information. Quantum information is the result of reformulating information theory in this quantum framework. We saw in Section 1.6 an example of a two-state quantum system: a photon that is constrained to follow one of two distinguishable paths. We identified the two distinguishable paths with the 2-dimensional basis vectors and then noted that a general ‘path state’ of the photon can be described by a complex vector with |α0|2 +|α1|2 = 1. This simple example captures the essence of the first postulate, which tells us how physical states are represented in quantum mechanics. Depending on the degree of freedom (i.e. the type of state) of the system being considered, H may be infinite-dimensional. For example, if the state refers to the position of a particle that is free to occupy any point in some region of space, the associated Hilbert space is usually taken to be a continuous (and thus infinite-dimensional) space. It is worth noting that in practice, with finite resources, we cannot distinguish a continuous state space from one with a discrete state space having a sufficiently small minimum spacing between adjacent locations. For describing realistic models of quantum computation, we will typically only be interested in degrees of freedom for which the state is described by a vector in a finite-dimensional (complex) Hilbert space.


2005 ◽  
Vol 5 (1) ◽  
pp. 57-67
Author(s):  
J. Watrous

Let $\Phi$ be a super-operator, i.e., a linear mapping of the form $\Phi:\mathrm{L}(\mathcal{F})\rightarrow\mathrm{L}(\mathcal{G})$ for finite dimensional Hilbert spaces $\mathcal{F}$ and $\mathcal{G}$. This paper considers basic properties of the super-operator norms defined by $\|\Phi\|_{q\rightarrow p}= \sup\{\|\Phi(X)\|_p/\|X\|_q\,:\,X\not=0\}$, induced by Schatten norms for $1\leq p,q\leq\infty$. These super-operator norms arise in various contexts in the study of quantum information. In this paper it is proved that if $\Phi$ is completely positive, the value of the supremum in the definition of $\|\Phi\|_{q\rightarrow p}$ is achieved by a positive semidefinite operator $X$, answering a question recently posed by King and Ruskai~\cite{KingR04}. However, for any choice of $p\in [1,\infty]$, there exists a super-operator $\Phi$ that is the {\em difference} of two completely positive, trace-preserving super-operators such that all Hermitian $X$ fail to achieve the supremum in the definition of $\|\Phi\|_{1\rightarrow p}$. Also considered are the properties of the above norms for super-operators tensored with the identity super-operator. In particular, it is proved that for all $p\geq 2$, $q\leq 2$, and arbitrary $\Phi$, the norm $\|\Phi \|_{q\rightarrow p}$ is stable under tensoring $\Phi$ with the identity super-operator, meaning that $\|\Phi \|_{q\rightarrow p} = \|\Phi \otimes I\|_{q\rightarrow p}$. For $1\leq p < 2$, the norm $\|\Phi\|_{1\rightarrow p}$ may fail to be stable with respect to tensoring $\Phi$ with the identity super-operator as just described, but $\|\Phi\otimes I\|_{1\rightarrow p}$ is stable in this sense for $I$ the identity super-operator on $\mathrm{L}(\mathcal{H})$ for $\op{dim}(\mathcal{H}) = \op{dim}(\mathcal{F})$. This generalizes and simplifies a proof due to Kitaev \cite{Kitaev97} that established this fact for the case $p=1$.


Sign in / Sign up

Export Citation Format

Share Document