General quantum Chinos games

Abstract

The Chinos game is a non-cooperative game between players who try to guess the total sum of coins drawn collectively. Semiclassical and quantum versions of this game were proposed by F. Guinea and M. A. Martin-Delgado, in J. Phys. A: Math. Gen. 36 L197 (2003), where the coins are replaced by a boson whose number occupancy is the aim of player's guesses. Here, we propose other versions of the Chinos game using a hard-core boson, one qubit and two qubits. In the latter case, we find that using entangled states the second player has a stable winning strategy that becomes symmetric for non-entangled states. Finally, we use the IBM Quantum Experience to compute the basic quantities involved in the two-qubit version of the game