Quantum logic

Mathematically, quantum logic is formulated by weakening the distributive law for a Boolean algebra, resulting in an ortho­complemented lattice.

Quantum-mechanical observables and states can be defined in terms of functions on or to the lattice, giving an alternate formalism for quantum computations.

To illustrate why the distributive law fails, consider a particle moving on a line and (using some system of units where the reduced Planck constant is 1) let[Note 1] We might observe that: in other words, that the state of the particle is a weighted superposition of momenta between 0 and +1/6 and positions between −1 and +3.

So there are no states that can support either proposition, and In his classic 1932 treatise Mathematical Foundations of Quantum Mechanics, John von Neumann noted that projections on a Hilbert space can be viewed as propositions about physical observables; that is, as potential yes-or-no questions an observer might ask about the state of a physical system, questions that could be settled by some measurement.

Although Mackey's presentation still assumed that the ortho­complemented lattice is the lattice of closed linear subspaces of a separable Hilbert space,[4] Constantin Piron, Günther Ludwig and others later developed axiomatizations that do not assume an underlying Hilbert space.

[5] Inspired by Hans Reichenbach's then-recent defence of general relativity, the philosopher Hilary Putnam popularized Mackey's work in two papers in 1968 and 1975,[6] in which he attributed the idea that anomalies associated to quantum measurements originate with a failure of logic itself to his coauthor, physicist David Finkelstein.

[7] Putnam hoped to develop a possible alternative to hidden variables or wavefunction collapse in the problem of quantum measurement, but Gleason's theorem presents severe difficulties for this goal.

While Birkhoff and von Neumann's original work only attempted to organize the calculations associated with the Copenhagen interpretation of quantum mechanics, a school of researchers had now sprung up, either hoping that quantum logic would provide a viable hidden-variable theory, or obviate the need for one.

Alternative formulations include propositions derivable via a natural deduction,[16] sequent calculus[20][21] or tableaux system.

[18] The remainder of this article assumes the reader is familiar with the spectral theory of self-adjoint operators on a Hilbert space.

It follows easily from this characterization of propositions in classical systems that the corresponding logic is identical to the Boolean algebra of Borel subsets of the state space.

In the Hilbert space formulation of quantum mechanics as presented by von Neumann, a physical observable is represented by some (possibly unbounded) densely defined self-adjoint operator A on a Hilbert space H. A has a spectral decomposition, which is a projection-valued measure E defined on the Borel subsets of R. In particular, for any bounded Borel function f on R, the following extension of f to operators can be made:

In case f is the indicator function of an interval [a, b], the operator f(A) is a self-adjoint projection onto the subspace of generalized eigenvectors of A with eigenvalue in [a,b].

From there, This semantics has the nice property that the pre-Hilbert space is complete (i.e., Hilbert) if and only if the propositions satisfy the orthomodular law, a result known as the Solèr theorem.

However, unlike classical logic, the distributive law a ∧ (b ∨ c) = (a ∧ b) ∨ (a ∧ c) fails when dealing with noncommuting observables, such as position and momentum.

For example, consider a simple one-dimensional particle with position denoted by x and momentum by p, and define observables: Now, position and momentum are Fourier transforms of each other, and the Fourier transform of a square-integrable nonzero function with a compact support is entire and hence does not have non-isolated zeroes.

Moreover: if the relevant Hilbert space for the particle's dynamics only admits momenta no greater than 1, then a is true.

If Q is the lattice of closed subspaces of Hilbert H, then there is a bijective correspondence between Mackey observables and densely-defined self-adjoint operators on H. A quantum probability measure is a function P defined on Q with values in [0,1] such that P("⊥)=0, P(⊤)=1 and if {Ei}i is a sequence of pairwise-orthogonal elements of Q then Every quantum probability measure on the closed subspaces of a Hilbert space is induced by a density matrix — a nonnegative operator of trace 1.

[26][27] The orthocomplemented lattice of any set of quantum propositions can be embedded into a Boolean algebra, which is then amenable to classical logic.

[29] Quantum logic admits no reasonable material conditional; any connective that is monotone in a certain technical sense reduces the class of propositions to a Boolean algebra.