Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Transactions on Games

A Quantum Adaptation for the Morra Game and Some of Its Variants

Antonio Costantino Marceddu, Bartolomeo Montrucchio

Published Mar 2, 2023• 3 citations
Publisher

Abstract

The Morra game is quite old. Back in time, traces of it can be found in ancient Egypt, ancient Rome, and even China. It involves two players who, for a limited number of turns, must try to suppose the sum of the number personally chosen with the number chosen by the opponent. The rules are simple, but it is rather difficult to play at a high level as there are multiple cognitive, motor, and perceptual processes involved.The goal of this paper is to illustrate the process of implementing a quantum random player for the Morra game and some of its variants. This can be done by using a quantum number generator circuit to generate two numbers and a quantum adder to obtain the supposed sum. The advantage of this proposal is that, unlike the implementations of the Morra game on classical computers, which only allow the generation of pseudo-random numbers, true randomness can be obtained through quantum computing.In addition to the description of the entire algorithms, the source code of the implementations is provided to give everyone the freedom to easily test both the quantum implementation of the Morra game and the variants discussed in the paper.

DOI
10.1109/tg.2023.3251663

Related papers

Photonic implementation of the quantum Morra game

Andrés Ulibarrena, Alejandro Sopena, Russell Brooks +4 more

The Morra game, an age-old noncooperative game, traditionally played on one's hand, has proved to be a rich setting to study game-theoretic strategies, both classically and within the quantum realm. In this paper, we study a faithful translation of a two-player quantum Morra game, which builds on previous study by including the classical game as a special case. We propose a natural deformation of the game in the quantum regime in which Alice has a winning advantage, breaking the balance of the classical game. A Nash equilibrium can be found in some cases by employing a pure strategy, which is impossible in the classical game where a mixed strategy is always required. We prepared our states using photonic qubits on a linear optics setup, with an average deviation ≤2% with respect to the measured outcome probabilities. Finally, we discuss potential applications of the quantum Morra game to the study of quantum information and communication. Published by the American Physical Society 2024

arXiv:2311.08495•Physical Review Research•Jun 5, 2024•3 citations

A Quantum Adaptation to Roll Truly Random Dice in Role Playing Games

Antonio Costantino Marceddu, Nicola Dilillo, Marco Russo +2 more

In role-playing games (RPGs), players are called upon to assume the role of a character moving in an imaginary environment and facing several challenges. Their success or failure often depends on randomizers like cards or dice. Regarding the latter, the most commonly used in RPGs are the Platonic solids with the addition of the ten-sided die. They are commonly simulated through classical computers, however, since true randomness is not in their nature, they can only generate pseudorandom numbers. On the contrary, quantum computers exploit the nondeterministic nature of quantum mechanics, so they are perfect candidates for truly random simulations in games of chance. For this reason, this paper proposes and tests various quantum circuits for sampling uniformly distributed discrete values within a fixed range, corresponding to the number of faces of the dice. The simulations reveal the pure randomness of the output of the implemented circuits. They were then used to generate random numbers within a three-dimensional dice-rolling game.

IEEE Conference on Games (CoG)•Aug 21, 2023•1 citation

General quantum Chinos games

Daniel Centeno, Germán Sierra

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 the 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, 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.

arXiv:2112.05175•Journal of Physics Communications•Jul 1, 2022•1 citation

Theory, Methods and Tools for Statistical Testing of Pseudo and Quantum Random Number Generators

Krister Sune Jakobsson

Statistical random number testing is a well studied field focusing on pseudo-random number generators, that is to say algorithms that produce random-looking sequences of numbers. These generators tend to have certain kinds of flaws, which have been exploited through rigorous testing. Such testing has led to advancements, and today pseudo random number generators are both very high-speed and produce seemingly random numbers. Recent advancements in quantum physics have opened up new doors, where products called quantum random number generators that produce acclaimed true randomness have emerged. Of course, scientists want to test such randomness, and turn to the old tests used for pseudo random number generators to do this. The main question this thesis seeks to answer is if publicly available such tests are good enough to evaluate a quantum random number generator. We also seek to compare sequences from such generators with those produced by state of the art pseudo random number generators, in an attempt to compare their quality. Another potential problem with quantum random number generators is the possibility of them breaking without the user knowing. Such a breakdown could have dire consequences. For example, if such a generator were to control the output of a slot machine, an malfunction could cause the machine to generate double earnings for a player compared to what was planned. Thus, we look at the possibilities to implement live tests to quantum random number generators, and propose such tests. Our study has covered six commonly available tools for random number testing, and we show that in particular one of these stands out in that it has a series of tests that fail our quantum random number generator as not random enough, despite passing an pseudo random number generator. This implies that the quantum random number generator behave differently from the pseudo random number ones, and that we need to think carefully about how we test, what we expect from an random sequence and what we want to use it for.

•Jan 1, 2014•8 citations

Quantum Computation and Pseudotelepathic Games

Jeffrey Bub

A quantum algorithm succeeds not because the superposition principle allows ‘the computation of all values of a function at once’ via ‘quantum parallelism’, but rather because the structure of a quantum state space allows new sorts of correlations associated with entanglement, with new possibilities for information-processing transformations between correlations, that are not possible in a classical state space. I illustrate this with an elementary example of a problem for which a quantum algorithm is more efficient than any classical algorithm. I also introduce the notion of ‘pseudotelepathic’ games and show how the difference between classical and quantum correlations plays a similar role here for games that can be won by quantum players exploiting entanglement, but not by classical players whose only allowed common resource consists of shared strings of random numbers (common causes of the players’ correlated responses in a game).

arXiv:1005.2449•Philosophy of Science•Oct 1, 2008•4 citations

Playing Dice with the Universe: Programming Quantum Computers to Play Traditional Games

Tristan Zaborniak, Vikram Khipple Mulligan

The challenge of programming classical computers to play traditional, competitive games against human players has helped to advance classical hardware and software. Quantum computers have the potential to play games in a unique way: programmed \textit{only} with the rules of a game, they should be able to implicitly represent all future paths of a game leading to wins, losses, or draws, and to sample from this path set to identify moves that maximize the likelihood of a win. This permits skilled play without hard-coded or machine-learned strategy. As a proof of principle, we present early results obtained after programming the D-Wave quantum annealer with the rules of tic-tac-toe, enabling it to play against a human or classical computer opponent. We anticipate that, as it has for classical computers, game-playing will serve as an important real-world benchmark for quantum computers.

cs.ETCross-listedarXiv:2604.23819•Apr 28, 2026•0 citations
The Morra game is quite old. Back in time, traces of it can be found in ancient Egypt, ancient Rome, and even China. It involves two players who, for a limited number of turns, must try to suppose the sum of the number personally chosen with the number chosen by the opponent. The rules are simple, but it is rather difficult to play at a high level as there are multiple cognitive, motor, and perceptual processes involved.The goal of this paper is to illustrate the process of implementing a quantum random player for the Morra game and some of its variants. This can be done by using a quantum number generator circuit to generate two numbers and a quantum adder to obtain the supposed sum. The advantage of this proposal is that, unlike the implementations of the Morra game on classical computers, which only allow the generation of pseudo-random numbers, true randomness can be obtained through quantum computing.In addition to the description of the entire algorithms, the source code of the implementations is provided to give everyone the freedom to easily test both the quantum implementation of the Morra game and the variants discussed in the paper.
The Morra game, an age-old noncooperative game, traditionally played on one's hand, has proved to be a rich setting to study game-theoretic strategies, both classically and within the quantum realm. In this paper, we study a faithful translation of a two-player quantum Morra game, which builds on previous study by including the classical game as a special case. We propose a natural deformation of the game in the quantum regime in which Alice has a winning advantage, breaking the balance of the classical game. A Nash equilibrium can be found in some cases by employing a pure strategy, which is impossible in the classical game where a mixed strategy is always required. We prepared our states using photonic qubits on a linear optics setup, with an average deviation ≤2% with respect to the measured outcome probabilities. Finally, we discuss potential applications of the quantum Morra game to the study of quantum information and communication. Published by the American Physical Society 2024
In role-playing games (RPGs), players are called upon to assume the role of a character moving in an imaginary environment and facing several challenges. Their success or failure often depends on randomizers like cards or dice. Regarding the latter, the most commonly used in RPGs are the Platonic solids with the addition of the ten-sided die. They are commonly simulated through classical computers, however, since true randomness is not in their nature, they can only generate pseudorandom numbers. On the contrary, quantum computers exploit the nondeterministic nature of quantum mechanics, so they are perfect candidates for truly random simulations in games of chance. For this reason, this paper proposes and tests various quantum circuits for sampling uniformly distributed discrete values within a fixed range, corresponding to the number of faces of the dice. The simulations reveal the pure randomness of the output of the implemented circuits. They were then used to generate random numbers within a three-dimensional dice-rolling game.
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 the 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, 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.
Statistical random number testing is a well studied field focusing on pseudo-random number generators, that is to say algorithms that produce random-looking sequences of numbers. These generators tend to have certain kinds of flaws, which have been exploited through rigorous testing. Such testing has led to advancements, and today pseudo random number generators are both very high-speed and produce seemingly random numbers. Recent advancements in quantum physics have opened up new doors, where products called quantum random number generators that produce acclaimed true randomness have emerged. Of course, scientists want to test such randomness, and turn to the old tests used for pseudo random number generators to do this. The main question this thesis seeks to answer is if publicly available such tests are good enough to evaluate a quantum random number generator. We also seek to compare sequences from such generators with those produced by state of the art pseudo random number generators, in an attempt to compare their quality. Another potential problem with quantum random number generators is the possibility of them breaking without the user knowing. Such a breakdown could have dire consequences. For example, if such a generator were to control the output of a slot machine, an malfunction could cause the machine to generate double earnings for a player compared to what was planned. Thus, we look at the possibilities to implement live tests to quantum random number generators, and propose such tests. Our study has covered six commonly available tools for random number testing, and we show that in particular one of these stands out in that it has a series of tests that fail our quantum random number generator as not random enough, despite passing an pseudo random number generator. This implies that the quantum random number generator behave differently from the pseudo random number ones, and that we need to think carefully about how we test, what we expect from an random sequence and what we want to use it for.
A quantum algorithm succeeds not because the superposition principle allows ‘the computation of all values of a function at once’ via ‘quantum parallelism’, but rather because the structure of a quantum state space allows new sorts of correlations associated with entanglement, with new possibilities for information-processing transformations between correlations, that are not possible in a classical state space. I illustrate this with an elementary example of a problem for which a quantum algorithm is more efficient than any classical algorithm. I also introduce the notion of ‘pseudotelepathic’ games and show how the difference between classical and quantum correlations plays a similar role here for games that can be won by quantum players exploiting entanglement, but not by classical players whose only allowed common resource consists of shared strings of random numbers (common causes of the players’ correlated responses in a game).
The challenge of programming classical computers to play traditional, competitive games against human players has helped to advance classical hardware and software. Quantum computers have the potential to play games in a unique way: programmed \textit{only} with the rules of a game, they should be able to implicitly represent all future paths of a game leading to wins, losses, or draws, and to sample from this path set to identify moves that maximize the likelihood of a win. This permits skilled play without hard-coded or machine-learned strategy. As a proof of principle, we present early results obtained after programming the D-Wave quantum annealer with the rules of tic-tac-toe, enabling it to play against a human or classical computer opponent. We anticipate that, as it has for classical computers, game-playing will serve as an important real-world benchmark for quantum computers.