Quantum theory does not necessitate the breakdown of full-blown deduction. On the contrary, it comes with substantially enhanced logical reasoning power as compared to its classical counterpart. It features a co-deductive mechanism besides a deductive one, resulting in a sound purely graphical calculus which admits an information-flow interpretation. (Abramsky & Coecke 2004; Coecke 2005a; 2005b; Coecke & Pavlovic 2006). The key physical concept represented by the logic is the interaction of quantum systems i.e. the tensor product structure, contra (Birkhoff & von Neumann 1936)-logic which only addresses individual systems. The trace structure, important in IR applications (van Rijsbergen 2004), is an intrincic part of the logic, together with many other quantitative concepts, again contra BvN-logic where the trace only arises indirectly via Glea-son’s theorem. Hence we provide a powerful high-level formalism for designing, controlling and even au-tomating quantum informatic tasks, which can involve multiple agents. We also mention several existing ap-plications to non-quantum domains such as linguistics, multi-agent systems and concurrency.
Quantum theory does not necessitate the breakdown of full-blown deduction. On the contrary, it comes with substantially enhanced logical reasoning power as compared to its classical counterpart. It features a co-deductive mechanism besides a deductive one, resulting in a sound purely graphical calculus which admits an information-flow interpretation. (Abramsky & Coecke 2004; Coecke 2005a; 2005b; Coecke & Pavlovic 2006). The key physical concept represented by the logic is the interaction of quantum systems i.e. the tensor product structure, contra (Birkhoff & von Neumann 1936)-logic which only addresses individual systems. The trace structure, important in IR applications (van Rijsbergen 2004), is an intrincic part of the logic, together with many other quantitative concepts, again contra BvN-logic where the trace only arises indirectly via Glea-son’s theorem. Hence we provide a powerful high-level formalism for designing, controlling and even au-tomating quantum informatic tasks, which can involve multiple agents. We also mention several existing ap-plications to non-quantum domains such as linguistics, multi-agent systems and concurrency.
The non-classical nature of quantum theory has led to a number of efforts to formalize the logic of statements whose universe of discourse is the subatomic (see, for example, [3], [6], [8], and [10]).It might be hoped that ideally the fruit of such efforts would be a formalism not totally divorced from the classical logic, but incorporating or incorporated in it in such a manner as to unify the logic of the micro-and the macro-worlds.Indeed, this has been the general direction taken by these efforts, including that which we principally examine and expand upon here.*Josef Jauch, [6], pp.67-89, developed a "propositional calculus of quantum mechanics".He objected to calling a system like his a "logic of quantum mechanics"; however, our use of 'logic' here is not, I think, the use to which Jauch objected.A logic, for our present purposes, is a mathematical formalism having a reasonable interpretation as a theory of deduction; its actual application as normative of argumentation in reality is a matter of empirical judgment.This seems close to the way Jauch wished to use "propositional calculus" but more general, allowing for extension to a quantification theory of quantum mechanics, for example.Although Jauch's presentation of a propositional calculus of quantum mechanics is mathematically interesting and suggestive, there are a number of problems connected with it.It is our purpose to engage some of these problems and to present a rigorously defined formalism intended to come close to doing the job intended by Jauch for his logic.The success or lack of success of this effort as related to actual application of this formalism in the foundations of quantum theory is, I think, a matter for the physicists to decide; the empirical judgment involved in this application is not in the scope of this paper.If a formalism is to have a reasonable interpretation as a theory of deduction, it seems clear that it must include a relation which, when it holds between two elements of the formalism, may be reasonably interpreted as expressing that one of the elements 'follows from' the other, in •The author wishes to thank Robert Piziak for advice and comments in the course of research for this paper.
. We put forward a new take on the logic of quantum mechanics, following Schrödinger's point of view that it is composition which makes quantum theory what it is, rather than its particular propositional structure due to the existence of superpositions, as proposed by Birkhoff and von Neumann. This gives rise to an intrinsically quantitative kind of logic, which truly deserves the name ‘logic’ in that it also models meaning in natural language, the latter being the origin of logic, that it supports automation, the most prominent practical use of logic, and that it supports probabilistic inference. The physics and the logic of quantum-ish logic. In 1932 John von Neumann formalized Quantum Mechanics in his book “Mathematische Grundlagen der Quantenmechanik”. This was effectively the official birth of the quantum mechanical formalism which until now, some 75 years later, has remained the same. Quantum theory underpins so many things in our daily lives including chemical industry, energy production and information technology, which arguably makes it the most technologically successful theory of physics ever. However, in 1935, merely three years after the birth of his brainchild, von Neumann wrote in a letter to American mathematician Garrett Birkhoff: “I would like to make a confession which may seem immoral: I do not believe absolutely in Hilbert space no more.” (sic)—for more details see [73]. Soon thereafter they published a paper entitled “The Logic of Quantum Mechanics” [13]. Their ‘quantum logic’ was cast in order-theoretic terms, very much in the spirit of the then reigning algebraic view of logic, with the distributive law being replaced with a weaker (ortho)modular law. This resulted in a research community of quantum logicians [68, 71, 47, 30]. However, despite von Neumann's reputation, and the large body of research that has been produced in the area, one does not find a trace of this activity neither in the mainstream physics, mathematics, nor logic literature. Hence, 75 years later one may want to conclude that this activity was a failure. What went wrong? The mathematics of it. Let us consider the raison d'être for the Hilbert space formalism.
We present two applications to AI of recently introduced high level quantum structures.These structures are the categorical quantum logic of (Abramsky & Coecke 2004) and the quantale quantum logic of (Coecke, Moore, & Stubbe 2001).Firstly, we show how the diagrammatic toolkit of categorical quantum logic, when restricted to its pregroup fragment (Lambek 1999; 2001), simplifies analysis of sentence structure of different languages.Moreover, the quantitative values that arise in these diagrams signify different degrees of complexity of sentences, which turn out to vary for different languages.Secondly, we show how expanding the quantale quantum logic with epistemic modalities provides a powerful system to reason about information update in multi-agent systems.Finally, we indicate how the above two applications to non-quantum domains can themselves be 're-quantized', providing applications to quantum informatics of distributed systems.
Quantum information and computation is concerned with the use of quantum-mechanical systems to carry out computational and information-processing tasks (Nielsen and Chunag, 2000). In the few short years that this approach has been studied, a number of remarkable concepts and results have emerged, most notably:a couple of spectacular algorithms and a number of information protocols, exemplified by quantum teleportation, which exploit quantum entanglement in an essential fashion. The current tools available for developing quantum algorithms and protocols are deficient on two main levels: firstly, they are too low-level and at a more fundamental level, the standard mathematical framework for quantum mechanics (which is essentially due to von Neumann (1932)) is actually insufficiency comprehensive for informatic purposes. In joint work with Bob Coecke, we have recently made some striking progress in addressing both these points. They have recast the von Neumann formalism at a more abstract and conceptual level, using category theory.
According to quantum mechanics, the pure states of a microsystem are represented by vectors in a Hilbert Space. Sentences of the form, "x є L" (where x is the state vector for a system, L a subspace of the appropriate Hilbert space), may be called Q-propositions: such sentences serve to summarise our information about the results of possible experiments on the system. Quantum logic investigates the relations which hold among the Q-propositions about a given physical sys tem. These logical relations correspond to algebraic relations among the subspaces of Hilbert space. The algebra of this set of subspaces is non-Boolean, and may be regarded either as an orthomodular lattice or as a partial Boolean algebra. With each type of structure we can associate a logic. A general approach to the semantics for such a logic is provided in terms of interpretations of a formal language within an algebraic structure; an interpretation maps sentences of the language homomorphically onto elements of the structure. When the structure in question is a Boolean algera, the resulting logic is classical; here we develop a semantics for the logic associated with partial Boolean algebras. Two systems of proof, based on the natural deduction systems of Gentzen, are shown for this logic. With respect to the given sematics, these calculi are sound and weakly complete. Strong completeness is conjectured. Quantum logic deals with the logical relations between sentences, and so is properly called a logic. However, it is the logic appropriate to a limited class of sentences: proposals that it should replace classical logic wherever the latter is used should be viewed with suspicion.
We put forward a new take on the logic of quantum mechanics, following Schroedinger's point of view that it is composition which makes quantum theory what it is, rather than its particular propositional structure due to the existence of superpositions, as proposed by Birkhoff and von Neumann. This gives rise to an intrinsically quantitative kind of logic, which truly deserves the name `logic' in that it also models meaning in natural language, the latter being the origin of logic, that it supports automation, the most prominent practical use of logic, and that it supports probabilistic inference.