General quantum Chinos games
arXiv:2112.05175 · doi:10.1088/2399-6528/ac7434
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
10 pages, 5 figures. The quantum game has been formulated in a more general way as compared to the first version
References in corpus (6)
- Quantum games: a review of the history, current state, and interpretation
- Quantum Game Theory Based on the Schmidt Decomposition
- Quantum decision theory as quantum theory of measurement
- Evolutionary Processes in Quantum Decision Theory
- A Subjective Model of Human Decision Making Based on Quantum Decision Theory
- Playing with a Quantum Computer