To the memory of John D. Trimmer This paper assesses the impact of disjunctive facts on the quantum logic read off procedure. The purpose of the procedure is to transfer a significant quantum structure to a set of propositions; its first step is an attempt to discover that structure. Here I propose that disjunctive facts as traditionally conceived have blocked the procedure at its first step and have therefore subverted the best-known attempts to read off quantum logic. Recently however Allen Stairs has proposed a view of disjunctive facts which re-establishes the possibility of reading off quantum logic. Both the traditional conception and Stairs’ revision of disjunctive facts are interesting in their own right, independent of quantum propositional logic. Too many things are called ‘quantum logic’. The term is disentangled and notation is fixed in this preliminary step which relies on basic lattice theory.
To the memory of John D. Trimmer This paper assesses the impact of disjunctive facts on the quantum logic read off procedure. The purpose of the procedure is to transfer a significant quantum structure to a set of propositions; its first step is an attempt to discover that structure. Here I propose that disjunctive facts as traditionally conceived have blocked the procedure at its first step and have therefore subverted the best-known attempts to read off quantum logic. Recently however Allen Stairs has proposed a view of disjunctive facts which re-establishes the possibility of reading off quantum logic. Both the traditional conception and Stairs’ revision of disjunctive facts are interesting in their own right, independent of quantum propositional logic. Too many things are called ‘quantum logic’. The term is disentangled and notation is fixed in this preliminary step which relies on basic lattice theory.
The purpose of this paper is to defend ‘quantum logic’ against a vigorous attack of J.H. McGrath (1978). The case is serious, as he allegedly discredits quantum propositional logic showing it unmotivated and useless. The object of his criticism is the procedure of “taking a well-known theory and distilling its logic” (Finkelstein 1969), or “reading off quantum logic from quantum mechanics” (McGrath 1978). This procedure is indeed the corner stone of the quantum logic philosophy, so if it were be “discredited in a most general way” and shown to be “fundamentally misconceived” (McGrath 1978) then the idea of quantum logic has broken down. I am going to show, on the contrary, that McGrath's account of the ‘reading off’ procedure is not sufficiently precise resulting in the failure of his ‘acrobatic’ counterexample.
The purpose of this paper is to prove that the construction of a quantum logic is a task of specific interest for non-classical logic, but that it is relevant neither to the methodology of quantum mechanics nor to the formalisation of the alternative yes-no process. The main argument is that quantum structures (for example, orthocomplemented partially ordered sets, orthomodular lattices and partial algebras) are not systems of logic proper, but rather are perfectly formalizable structures in classical logic. In § 1, the orthodox formulation of Jauch and Piron are analyzed. I affirm that the objections made by these authors against “quantum logic” are not eliminated by the introduction of a conditional in the lattice structures, since the true reason why quantum “logic” is not really logic lies in its formulation, which is not that of a propositional system, but rather that of a specific theory whose model is these lattices. It is argued that the collection of the properties satisfied by certain objects of a structure does not justify their presentation as purely logical properties, nor does the presence of certain operations of the least upper bound and greatest lower bound permit us to call symbols introduced by analogy in propositionaI logic “connectives”. In any case, if that formalization is indeed possible, it does not imply the adoption of a new logic as a formal instrument for quantum mechanics. In § 2, aspects of quantum theories which are especially semantic in nature are analyzed. I agree with van Fraassen’s statement in the sense that that semantic formulation makes specific concepts of the theory clearer, but it does not attempt to construct its own logic. I deduce that it is non-classical logic which can actually take advantage of quantum semantics, as a model which, eventually, could throw light on the metalogical properties of certain special propositional systems. Finally, by using Benioff’s profound set theory analysis, I advance the hypothesis that classical logic is possibly the only one that can account for the richness of the meanings that appear in quantum mechanics.[Summary by Carlos Lungarzo]
This talk is about quantum logic, and before we engage in the subject proper let me say how much I appreciate the invitation to deliver it that was extended to me by the Japanese Society for the Philosophy of Science.In particular because I feel that such a meeting is really the place that is most adequate for the discussion of these matters.Let us introduce the subject by mentioning a few general points.First of all, logics deals with propositions.Hence we shall be concerned with propositions.But in fact our interest will be exclusively focused on what is-or what should be the simplest type of propositions: the propositions by means of which a physicist expresses what he knows about a physical system.A priori, our subject should then be very simple.Indeed the elementary books about logic tell us that the rules concerning these propositions can be formalized.That, for example, the propositions can be combined by means of two rules, corresponding to and and to or, and that the resulting structure is just that of a Boolean Algebra.We would expect this to hold for any system.However, as you know, a major difficulty already creeps in at this point when we want to deal with atomic systems.This is because a very simple word such as "and" may well have no obvious meaning in that case.And when we try to force a meaning to it was sometimes encounter quite unpleasant surprises, exemplified by the Heisenberg relations.Among the founders of quantum physics the reactions to such a fact were quite varied as is well known.Some of them sort of hoped that the difficulty just came from our using the wrong concepts.For example, it is quite obvious that if we try to describe as a particle something which is really a wave, we are heading for trouble and we are bound to formulate some meaningless propositions.However, this remark did not lead to a satisfactory solution in the end.Other physicists notably the Copenhagen group took a very different standpoint.Substantially, what they said boiled to this: since we cannot "see" the elementary particles, let us refrain from formulating directly propositions bearing on them.Ultimately, there fore, all their propositions bear on the instruments; or should be interpreted in terms of such propositions.This is -it turned out a very good recipe.Of course, propositions bearing on instruments are propositions of classical, macroscopic physcis.As such, they fall -57-
Summary Foundational studies in quantum theory have consisted in large part of attempts to avoid paradoxical situations in describing properties of a physical system. Quantum logic addresses some of the perplexing problems that plague interpretations of quantum theory by invoking a non-classical propositional calculus for the set of propositions of a quantum system. Historically, quantum logic derives from von Neumann’s observation that the set of projection operators on a Hilbert space constitute a ‘logic’ of experimental propositions. More than two decades passed from the pioneering work of Birkho and von Neumann before interest in quantum logic was re-ignited by Mackey’s probabilistic analysis of quantum theory. Piron’s axiomatization provided a signicant
Introduction Discussions of quantum-computational algorithms in the literature refer to various features of quantum mechanics as the source of the exponential speed-up relative to classical algorithms: superposition and entanglement, the fact that the state space of n bits is a space of 2 n states while the state space of n qubits is a space of 2 n dimensions, the possibility of computing all values of a function in a single computational step by “quantum parallelism,” or the possibility of an efficient implementation of the discrete quantum Fourier transform. Here I propose a different answer to the question posed in the title, in terms of the difference between classical logic and quantum logic, i.e., the difference between the Boolean classical event structure and the non-Boolean quantum event structure. In a nutshell, the ultimate source of the speed-up is the difference between a classical disjunction, which is true (or false) in virtue of the truth values of the disjuncts, and a quantum disjunction, which can be true (or false) even if none of the disjuncts is either true or false. In the following, I will discuss the information-processing in Deutsch's XOR algorithm (the first genuinely quantum algorithm) and related period-finding quantum algorithms (Simon's algorithm and Shor's factorization algorithm). It is well known that these algorithms can be formulated as solutions to a hidden-subgroup problem. Here the salient features of the information-processing are presented from the perspective of the way in which the algorithms exploit the non-Boolean logic represented by the projective geometry (the subspace structure) of Hilbert space.
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.