2008/03/31 by Adrian P. Flitney, Maximilian Schlosshauer, Christian Schmid +3
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #quant-ph
paper · pdf · doi:10.1016/j.physleta.2008.12.003
published as Phys. Lett. A 373 (2009) 521-524 · v1 4 pages ReTeX, 2 figures (1 EPS); v2 11 pages LateX, 2 figures, changes to format, minor changes to wording (including title) and one new finding added on uniqueness of result
arxiv created 2008/09/23 · openalex publication_date 2008/12/09 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/01
We show that, for a continuous set of entangled four-partite states, the task of maximizing the payoff in the symmetric-strategy four-player quantum Minority game is equivalent to maximizing the violation of a four-particle Bell inequality with each observer choosing the same set of two dichotomic observables. We conclude the existence of direct correspondences between (i) the payoff rule and Bell inequalities, and (ii) the strategy and the choice of measured observables in evaluating these Bell inequalities. We also show that such a correspondence between Bell polynomials (in a single plane) and four-player, symmetric, binary-choice quantum games is unique to the four-player quantum Minority game and its "anti-Minority" version. This indicates that the four-player Minority game not only plays a special role among quantum games but also in studies of Bell-type quantum nonlocality.