Examples of games between two partners with mixed strategies, calculated by the use of the probability amplitude are given. The first game is described by the quantum formalism of spin one half system for which two noncommuting observables are measured. The second game corresponds to the spin one case. Quantum logical orthocomplemented nondistributive lattices for these two games are presented. Interference terms for the probability amplitudes are analyzed by using so called contextual approach to probability (in the von Mises frequency approach). We underline that our games are not based on using of some microscopic systems. The whole scenario is macroscopic.
We consider an application of the mathematical formalism of quantum mechanics outside physics, namely, to game theory. We present a simple game between macroscopic players, say, Alice and Bob (or in a more complex form—Alice, Bob, and Cecilia), which can be represented in the quantumlike (QL) way—by using a complex probability amplitude (game’s “wave function”) and noncommutative operators. The crucial point is that games under consideration are so-called extensive form games. Here the order of actions of players is important; such a game can be represented by the tree of actions. The QL probabilistic behavior of players is a consequence of incomplete information (which is available to, e.g., Bob) about the previous action of Alice. In general one could not construct a classical probability space underlying a QL game. This can happen even in a QL game with two players. In a QL game with three players Bell’s inequality can be violated. The most natural probabilistic description is given by the so-called contextual probability theory completed by the frequency definition of probability.
An ontological model of an operational theory is considered to be universally noncontextual if both preparation and measurement noncontextuality assumptions are satisfied in that model. In this report, we first generalize the logical proofs of quantum preparation and measurement contextuality for qubit system for any odd number of preparations and measurements. Based on the logical proof, we derive testable universally non-contextual inequalities violated by quantum theory. We then propose a class of two-party communication games and show that the average success probability of winning such games is solely linked to suitable Bell expression whose local bound is greater than universal non-contextual bound. Thus, for a given state, even if quantum theory does not exhibit non-locality, it may still reveal non-classicality by violating the universal non-contextual bound. Further, we consider a different communication game to demonstrate that for a given choices of observables in quantum theory, even if there is no logical proof of preparation and measurement contextuality exist, the universal quantum contextuality can be revealed through that communication game. Such a game thus test a weaker form of universal non-contextuality with minimal assumption.
Soon after the dawn of quantum error correction, DiVincenzo and Peres observed that stabilizer codewords could give rise to simple proofs of quantumness via contextuality. This discovery can be recast in the language of nonlocal games: every
n-qubit stabilizer state defines a specific "stabilizer-testing"
n-player nonlocal game, which quantum players can win with probability one. If quantum players can moreover outperform all possible classical players, then the state is contextual. However, the classical values of stabilizer-testing games are largely unknown for scalable examples beyond the
n-qubit GHZ state. We introduce several new methods for upper-bounding the classical values of these games. We first prove a general coding-theory bound for all stabilizer-testing games: if the classical value
pcl∗<1, then
pcl∗≤7/8, i.e., there is no classical strategy that can perform as well as the optimal quantum strategy even in an asymptotic sense. We then show how to tighten this bound for the most common scalable examples, namely GHZ, toric-code and cyclic cluster states. In particular, we establish an asymptotically tight upper bound for cyclic cluster states using transfer-matrix methods. This leads to the striking conclusion that measuring an exponentially small fidelity to the cyclic cluster state will suffice to witness its contextuality.