Modular almost orthogonal quantum logics

Almost orthogonal quantum logics, i.e., atomic orthomodular lattices in which to every atom there exist only finitely many nonorthogonal atoms, are studied. It is shown that an almost orthogonal quantum logic is modular if and only if it has the exchange property if and only if it can be embedded into a direct product of finite modular quantum logics. The class of almost orthogonal modular OMLs is the largest subclass of the class of atomic modular OMLs in which the conditions commutator-finite and block-finite are equivalent. A finite faithful valuation on an almost orthogonal quantum logicL exists if and only ifL is modular and the set of all atoms ofL is at most countable.     

Coupling of quantum logics

A quantum logic is a couple (L, M), whereL is a logic andM is a quite full set of states onL. A tensor product in the category of quantum logics is defined and a comparison with the definition of free orthodistributive product of orthomodular σ lattices is given. Several physically important cases are treated.     

Quantum logics and convex geometry

The main result is a representation theorem which shows that, for a large class of quantum logics, a quantum logic,Q, is isomorphic to the lattice of projective faces in a suitable convex setK. As an application we extend our earlier results [4], which, subject to countability conditions, gave a geometric characterization of those quantum logics which are isomorphic to the projection lattice of a von Neumann algebra or aJ B W-algebra.     

Testing for Classicality of a Physical System

Often quantum logics are algebraically modelled by orthomodular posets. The physical system described by such a quantum logic is classical if and only if the corresponding orthomodular poset is a Boolean algebra. We provide an easy testing procedure for this case. Moreover, we characterize orthomodular posets which are lattices and consider orthomodular posets which admit a full set of states and hence represent so-called spaces of numerical events. This way further test procedures are obtained.     

Three-valued derived logics for classical phase spaces

Reichenbach proposed a three-valued logic to describe quantum mechanics. In his development, Reichenbach presented three different negation operators without providing any criteria for choosing among them. In this paper we develop two three-valuedderived logics for classical systems. These logics are derived in that they are based on a theory of physical measurement. In this regard they have some of the characteristics of the quantum logic developed by Birkhoff and von Neumann. The theory of measurement used in the present development is the one used previously in developingbivalent derived logics for classical systems. As these systems are derived logics, many of the ambiguities possessed by systems such as Reichenbach's are avoided.     

Grassmann variables on quantum spaces

Attention is focused on antisymmetrized versions of quantum spaces that are of particular importance in physics, i.e. two-dimensional quantum plane, q-deformed Euclidean space in three or four dimensions as well as q-deformed Minkowski space. For each case standard techniques for dealing with q-deformed Grassmann variables are developed. Formulae for multiplying supernumbers are given. The actions of symmetry generators and fermionic derivatives upon antisymmetrized quantum spaces are calculated. The complete Hopf structure for all types of quantum space generators is written down. From the formulae for the coproduct a realization of the L-matrices in terms of symmetry generators can be read off. The L-matrices together with the action of symmetry generators determine how quantum spaces of different type have to be fused together. Arrival of the final proofs: 6 December 2005     

Symmetry and Topology in Quantum Logic

A test space is a collection of non-empty sets, usually construed as the catalogue of (discrete) outcome sets associated with a family of experiments. Subject to a simple combinatorial condition called algebraicity, a test space gives rise to a “quantum logic”—that is, an orthoalgebra. Conversely, all orthoalgebras arise naturally from algebraic test spaces. In non-relativistic quantum mechanics, the relevant test space is the set ℱ F(H) of frames (unordered orthonormal bases) of a Hilbert space H. The corresponding logic is the usual one, i.e., the projection lattice L(H) of H. The test space ℱ F(H) has a strong symmetry property with respect to the unitary group of H, namely, that any bijection between two frames lifts to a unitary operator. In this paper, we consider test spaces enjoying the same symmetry property relative to an action by a compact topological group. We show that such a test space, if algebraic, gives rise to a compact, atomistic topological orthoalgebra. We also present a construction that generates such a test space from purely group-theoretic data, and obtain a simple criterion for this test space to be algebraic. PACS: 02.10.Ab; 02.20.Bb; 03.65.Ta.     

Concrete Quantum Logics and Δ -Logics,States and Δ -States

By a concrete quantum logic (in short, by a logic) we mean the orthomodular poset that is set-representable. If \(L=({\Omega },\mathcal {L})\) is a logic and \(\mathcal {L}\) is closed under the formation of symmetric difference, Δ , we call L a Δ -logic. In the first part we situate the known results on logics and states to the context of Δ -logics and Δ -states (the Δ -states are the states that are subadditive with respect to the symmetric difference). Moreover, we observe that the rather prominent logic \(\mathcal {E}^{\text {even}}_{\Omega }\) of all even-coeven subsets of the countable set Ω possesses only Δ -states. Then we show when a state on the logics given by the divisibility relation allows for an extension as a state. In the next paragraph we consider the so called density logic and its Δ -closure. We find that the Δ -closure coincides with the power set. Then we investigate other properties of the density logic and its factor.     

Linearity of expectation functionals

LetB be the set of bounded observables on a quantum logic. A mapJ: B →R is called an expectation functional ifJ is normalized, positive, continuous, and compatibly linear. Two questions are considered. IsJ linear, and isJ an expectation relative to some state? It is shown that the answers are affirmative for hidden variable logics and most Hilbert space logics. An example is given which shows thatJ can be nonlinear on an arbitrary quantum logic.     

Binary logic is rich enough

Given a finite ortholatticeL, the *-semigroup is explicitly built whose annihilator ortholattice is isomorphic toL. Thus, it is shown that any finite quantum logic is the additive part of a binary logic. Some areas of possible applications are outlined.     

Partial Abelian semigroups

Orthomodular lattices and posets, orthoalgebras, and D-posets are all examples of partial Abelian semigroups. So, too, are the event structures of test spaces. The passage from an algebraic test space to its logic (an orthoalgebra) is an instance of a general construction involving a partial Abelian semigroupL and a distinguished subsetM L such that perspectivity with respect toM is a congruence onL. The quotient ofL by such a congruence is always a cancellative, unital PAS, and every such PAS arises canonically as such a quotient.     

Analysis of the Einstein-Podolsky-Rosen experiment by relativistic quantum logic

The EPR experiment is investigated within the abstract language of relativistic quantum physics (relativistic quantum logic). First we show that the principles of reality (R) and locality (L) contradict the validity principle (Q) of quantum physics. A reformulation of this argument is then given in terms of relativistic quantum logic which is based on the principlesR andQ. It is shown that the principleL must be replaced by a convenient relaxation ¯L, by which the contradiction can be eliminated. On the other hand this weak locality principle ¯L does not contradict Einstein causality and is thus in accordance with special relativity.     

Quantum Computational Logics and Possible Applications

In quantum computational logics meanings of formulas are identified with quantum information quantities: systems of qubits or, more generally, mixtures of systems of qubits. We consider two kinds of quantum computational semantics: (1) a compositional semantics, where the meaning of a compound formula is determined by the meanings of its parts; (2) a holistic semantics, which makes essential use of the characteristic “holistic” features of the quantum-theoretic formalism. The compositional and the holistic semantics turn out to characterize the same logic. In this framework, one can introduce the notion of quantum-classical truth table, which corresponds to the most natural way for a quantum computer to calculate classical tautologies. Quantum computational logics can be applied to investigate different kinds of semantic phenomena where holistic, contextual and gestaltic patterns play an essential role (from natural languages to musical compositions).     

Paraconsistent quantum logics

Paraconsistent quantum logics are weak forms of quantum logic, where the noncontradiction and the excluded-middle laws are violated. These logics find interesting applications in the operational approach to quantum mechanics. In this paper, we present an axiomatization, a Kripke-style, and an algebraic semantical characterization for two forms of paraconsistent quantum logic. Further developments are contained in Giuntini and Greuling's paper in this issue.     

Why physics needs mathematics

Classical and the quantum mechanical sciences are in essential need of mathematics. Only thus can the laws of nature be formulated quantitatively permitting quantitative predictions. Mathematics also facilitates extrapolations. But classical and quantum sciences differ in essential ways: they follow different laws of logic, Aristotelian and non-Aristotelian logics, respectively. These are explicated.     

PLQP & Company: Decidable Logics for Quantum Algorithms

We introduce a probabilistic modal (dynamic-epistemic) quantum logic PLQP for reasoning about quantum algorithms. We illustrate its expressivity by using it to encode the correctness of the well-known quantum search algorithm, as well as of a quantum protocol known to solve one of the paradigmatic tasks from classical distributed computing (the leader election problem). We also provide a general method (extending an idea employed in the decidability proof in Dunn et al. (J. Symb. Log. 70:353–359, 2005)) for proving the decidability of a range of quantum logics, interpreted on finite-dimensional Hilbert spaces. We give general conditions for the applicability of this method, and in particular we apply it to prove the decidability of PLQP.     

Quantum logics with the existence property

Aquantum logic (-orthocomplete orthomodular poset L with a convex, unital, and separating set of states) is said to have theexistence property if the expectation functionals onlin() associated with the bounded observables of L form a vector space. Classical quantum logics as well as the Hilbert space logics of traditional quantum mechanics have this property. We show that, if a quantum logic satisfies certain conditions in addition to having property E, then the number of its blocks (maximal classical subsystems) must either be one (classical logics) or uncountable (as in Hilbert space logics).Part of this work was done while the author was a visitor at the Department of Mathematics and Computer Science of the University of Denver, Denver, Colorado.     

Transition amplitude spaces and quantum logics with vector-valued states

Relations between transition amplitude spaces and quantum logics are studied. It is shown that transition amplitude spaces correspond to quantum logics with rich enough sets of vector-valued states.     

Probabilistic forcing in quantum logics

It is shown that an orthomodular lattice can be axiomatized as an ortholattice with aunique operation of identity (bi-implication) instead of the operation of implication, and a corresponding algebraic unified quantum logic is formulated. A statisticalyes-no physical interpretation of the quantum logical propositions is then provided to establish a support for a novelyes-no representation of quantum logic which prompts a conjecture about a possible completion of quantum logic by means of probabilistic forcing.     

Measures Defined on Quantum Logics of Sets

We study families formed with subsets of any set X which are quantum logics but which are not Boolean algebras. We consider sequences of measures defined on a sets quantum logics and valued on an effect algebra and obtain a sufficient condition for a sequences of such measures to be uniformly strongly additive with respect to order topology of effect algebras.