Distributivity breaking and macroscopic quantum games

Grib, A. A.; Khrennikov, A. Yu.; Parfionov, G. N.; Starkov, K. A.
February 2005
AIP Conference Proceedings;2005, Vol. 750 Issue 1, p108
Conference Proceeding
Examples of games between two partners with mixed strategies, calculated by the use of the probability amplitude as some vector in Hilbert space are given. The games are macroscopic, no microscopic quantum agent is supposed. The reason for the use of the quantum formalism is in breaking of the distributivity property for the lattice of yes-no questions arising due to the special rules of games. The rules of the games suppose two parts: the preparation and measurement. In the first part due to use of the quantum logical orthocomplemented non-distributive lattice the partners freely choose the wave functions as descriptions of their strategies. The second part consists of classical games described by Boolean sublattices of the initial non-Boolean lattice with same strategies which were chosen in the first part. Examples of games for spin one half are given. New Nash equilibria are found for some cases. Heisenberg uncertainty relations without the Planck constant are written for the “spin one half game”. © 2005 American Institute of Physics


Related Articles

  • QUANTUM VS. CLASSICAL LOGIC: THE REVISIONIST APPROACH. TÂRZIU, Gabriel // Logos & Episteme;2012, Vol. 3 Issue 4, p579 

    Quantum logic can be understood in two ways: as a study of the algebraic structures that appear in the context of the Hilbert space formalism of quantum mechanics; or as representing a non-classical logic in conflict with classical logic. My aim in this paper is to analyze the possibility to...

  • Quantum Set Theory. Titani, Satoko; Kozawa, Haruhiko // International Journal of Theoretical Physics;Nov2003, Vol. 42 Issue 11, p2575 

    The complete orthomodular lattice of closed subspaces of a Hilbert space is considered as the logic describing a quantum physical system, and called a quantum logic. G. Takeuti developed a quantum set theory based on the quantum logic. He showed that the real numbers defined in the quantum set...

  • On Gleason’s Theorem without Gleason. Buhagiar, David; Chetcuti, Emmanuel; Dvurečenskij, Anatolij // Foundations of Physics;Jun2009, Vol. 39 Issue 6, p550 

    The original proof of Gleason’s Theorem is very complicated and therefore, any result that can be derived also without the use of Gleason’s Theorem is welcome both in mathematics and mathematical physics. In this paper we reprove some known results that had originally been proved...

  • A representation theorem of infimum of bounded quantum observables. Liu Weihua; Wu Junde // Journal of Mathematical Physics;Jul2008, Vol. 49 Issue 7, p073521 

    In 2006, Gudder introduced a logic order on the bounded quantum observable set S(H). In 2007, Pulmannova and Vincekova proved that for each subset D of S(H), the infimum of D exists with respect to this logic order. In this paper, we present a representation theorem for the infimum of D.

  • Quantum logic as a dynamic logic. Baltag, Alexandru; Smets, Sonja // Synthese;Mar2011, Vol. 179 Issue 2, p285 

    We address the old question whether a logical understanding of Quantum Mechanics requires abandoning some of the principles of classical logic. Against Putnam and others (Among whom we may count or not E. W. Beth, depending on how we interpret some of his statements), our answer is a clear 'no'....

  • Gentzen-Type Calculi for Involutive Quantales. Kamide, Norihiro // International Journal of Theoretical Physics;Apr2005, Vol. 44 Issue 4, p399 

    Completeness and cut-elimination theorems are proved for some Gentzen-type sequent calculi which are closely related to non-commutative involutive quantales.

  • Product Łukasiewicz Quantum Logic. Bertini, Cesarino; Leporini, Roberto // International Journal of Theoretical Physics;Feb2011, Vol. 50 Issue 2, p571 

    The theory of logical gates in quantum computation has suggested new forms of quantum logic, called quantum computational logics. The basic semantic idea is the following: the meaning of a sentence is identified with a density operator (called qumix). In this framework, any sentence α of the...

  • Quantum Computational Logic. Gudder, S. // International Journal of Theoretical Physics;Jan2003, Vol. 42 Issue 1, p39 

    A quantum computational logic is constructed by employing density operators on spaces of qubits and quantum gates represented by unitary operators. It is shown that this quantum computational logic is isomorphic to the basic sequential effect algebra [0, 1].

  • Typed Quantum Logic. Tokuo, Kenji // International Journal of Theoretical Physics;Jan2003, Vol. 42 Issue 1, p27 

    The aim of this paper was to lift traditional quantum logic to its higher order version with the help of a type-theoretic method. A higher order axiomatic system is defined explicitly and then a sound and complete class of models is given. This is an attempt to provide a quantum counterpart of...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics