Jeffrey Bub

I show that the quantum state ω can be interpreted as defining a probability measure on a subalgebra of the algebra of projection operators that is not fixed (as in classical statistical mechanics) but changes with ω and appropriate boundary conditions, hence with the dynamics of the theory. This subalgebra, while not embeddable into a Boolean algebra, will always admit two-valued homomorphisms, which correspond to the different possible ways in which a set of “determinate” quantities (selected by ω and the boundary conditions) can have values. The probabilities defined by ω (via the Born rule) are probabilities over these two-valued homomorphisms or value assignments. So any universe of interacting systems, including those functioning as measuring instruments, can be modelled quantum mechanically without the projection postulate

John von Neumann (1903-1957) was undoubtedly one of the scientific geniuses of the 20th century. The main fields to which he contributed include various disciplines of pure and applied mathematics, mathematical and theoretical physics, logic, theoretical computer science, and computer architecture. Von Neumann was also actively involved in politics and science management and he had a major impact on US government decisions during, and especially after, the Second World War. There exist several popular books on his personality and various collections focusing on his achievements in mathematics, computer science, and economy. Strangely enough, to date no detailed appraisal of his seminal contributions to the mathematical foundations of quantum physics has appeared. Von Neumann's theory of measurement and his critique of hidden variables became the touchstone of most debates in the foundations of quantum mechanics. Today, his name also figures most prominently in the mathematically rigorous branches of contemporary quantum mechanics of large systems and quantum field theory. And finally - as one of his last lectures, published in this volume for the first time, shows - he considered the relation of quantum logic and quantum mechanical probability as his most important problem for the second half of the twentieth century. The present volume embraces both historical and systematic analyses of his methodology of mathematical physics, and of the various aspects of his work in the foundations of quantum physics, such as theory of measurement, quantum logic, and quantum mechanical entropy. The volume is rounded off by previously unpublished letters and lectures documenting von Neumann's thinking about quantum theory after his 1932 Mathematical Foundations of Quantum Mechanics. The general part of the Yearbook contains papers emerging from the Institute's annual lecture series and reviews of important publications of philosophy of science and its history.

A quantum algorithm succeeds not because the superposition principle allows ‘the computation of all values of a function at once’ via ‘quantum parallelism’, but rather because the structure of a quantum state space allows new sorts of correlations associated with entanglement, with new possibilities for information‐processing transformations between correlations, that are not possible in a classical state space. I illustrate this with an elementary example of a problem for which a quantum algorithm is more efficient than any classical algorithm. I also introduce the notion of ‘pseudotelepathic’ games and show how the difference between classical and quantum correlations plays a similar role here for games that can be won by quantum players exploiting entanglement, but not by classical players whose only allowed common resource consists of shared strings of random numbers (common causes of the players’ correlated responses in a game). *Received October 2008. †To contact the author, please write to: Department of Philosophy, University of Maryland, College Park, MD 20742; e‐mail: [email protected].

Bohr's complementarity interpretation is represented as the relativization of the quantum mechanical description of a system to the maximal Boolean subalgebra (in the non-Boolean logical structure of the system) selected by a classically described experimental arrangement. Only propositions in this subalgebra have determinate truth values. The concept of a minimal revision of a Boolean subalgebra by a measurement is defined, and it is shown that the nonmaximal measurement of spin on one subsystem in the spin version of the Einstein—Podolsky—Rosen experiment actually selects an appropriate maximal Boolean subalgebra ℛ′ in the logical structure of the composite system, via a minimal revision of the maximal Boolean subalgebra & associated with the preparation of the singlet spin state. This provides an explanation for the determinate truth values of propositions in ℛ′ referring to the second subsystem within the framework of the complementarity interpretation

Unconditionally secure two-party bit commitment based solely on the principles of quantum mechanics (without exploiting special relativistic signalling constraints, or principles of general relativity or thermodynamics) has been shown to be impossible, but the claim is repeatedly challenged. The quantum bit commitment theorem is reviewed here and the central conceptual point, that an “Einstein–Podolsky–Rosen” attack or cheating strategy can always be applied, is clarified. The question of whether following such a cheating strategy can ever be disadvantageous to the cheater is considered and answered in the negative. There is, indeed, no loophole in the theorem