General quantum Chinos games

TL;DR

This paper explores various quantum versions of the Chinos game, demonstrating how entanglement influences winning strategies and utilizing IBM Quantum Experience for practical computations.

Contribution

It introduces new quantum Chinos game variants using hard-core bosons and qubits, analyzing entanglement effects on strategies and providing experimental insights.

Findings

Entangled states give the second player a stable winning strategy.

Non-entangled states lead to symmetric strategies.

IBM Quantum Experience effectively computes game quantities.

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