We demonstrate how quantum computing can provide a promising framework for addressing imperfect information games, using the popular German card game Skat as a case study. Our approach employs quantum registers to encode the game's hidden and public information, along with tailored quantum gates to model the game's progress while respecting its rules. To evaluate player decisions, we introduce a score operator that projects the quantum state onto the winning subspace, enabling the estimation of winning probabilities via quantum algorithms such as quantum counting. This allows the efficient exploration of alternative strategies and potential improvements in computational speed compared to classical methods. By maximizing the payoff function, our framework yields actionable recommendations for optimal play. As classical computation faces severe limitations due to the exponential complexity of the game tree, we discuss the specific structural properties of Skat that may give rise to a quantum advantage once the problem size surpasses classical feasibility.
We demonstrate how quantum computing can provide a promising framework for addressing imperfect information games, using the popular German card game Skat as a case study. Our approach employs quantum registers to encode the game's hidden and public information, along with tailored quantum gates to model the game's progress while respecting its rules. To evaluate player decisions, we introduce a score operator that projects the quantum state onto the winning subspace, enabling the estimation of winning probabilities via quantum algorithms such as quantum counting. This allows the efficient exploration of alternative strategies and potential improvements in computational speed compared to classical methods. By maximizing the payoff function, our framework yields actionable recommendations for optimal play. As classical computation faces severe limitations due to the exponential complexity of the game tree, we discuss the specific structural properties of Skat that may give rise to a quantum advantage once the problem size surpasses classical feasibility.
Imperfect-information games with a graded-reward structure present significant computational challenges for equilibrium computation, since the payoff expectations must be estimated across exponentially large strategy spaces. Counterfactual Regret Minimization over the years has proven effective for approximating Nash equilibria, but Monte Carlo variants create a large overhead of sampling costs when the counterfactual values are estimated from sampled game-tree trajectories. We propose a novel Quantum-Assisted Counterfactual Regret Minimization, a framework that uses Quantum Amplitude Estimation to reduce the computational complexity of the regret updates in bounded-payoff imperfect-information games, while preserving the convergence of its classical counterpart. We give a theoretical analysis of the resulting exploitability bound, discuss NISQ-compatible amplitude-estimation variants, the structure of their resource requirements, and outline what is needed to validate the potential advantage empirically.
The quantization of games expand the players strategy space, allowing the emergence of more equilibriums. However, finding these equilibriums is difficult, especially if players are allowed to use mixed strategies. The size of the exploration space expands so much for quantum games that makes far harder to find the player’s best strategy. In this work, we propose a method to learn and visualize mixed quantum strategies and compare them with their classical counterpart. In our model, players do not know in advance which game they are playing (pay-off matrix) neither the action selected nor the reward obtained by their competitors at each step, they only learn from an individual feedback reward signal. In addition, we study both the influence of entanglement and noise on the performance of various quantum games.
Game theory is the study of strategic competition used in many branches of science. In general, a game is a match between two or more players and each wants to maximize his or her score. In a game, the player’s score depends on their strategies. The goal is to find the optimized decision, with regard to the payoff, in conformity with the rules of the game. This thesis considers the games with two players who know both their own and their rival’s payoff. However, they do not know the strategy chosen by the opponent.\nIn a classical game, the options of players are referred to as cooperation and defect. Quantum game theory is a generalization of classical game theory. In quantum games a linear combination of two options specify the strategy based on qubit. The quantum domain is characterized by entanglement. The quantum entanglement coefficient (y) varies from 0 to . The game is in the classical regime when y is smaller than a threshold. Quantum entanglement is intrinsically non-local.\nIn an iterated game tournament, 63 different strategies contest with four known strategies. Depending on the result, they are divided to a number of groups. The competition specifies which group of strategies can obtain a higher score.\nOther types of games are discussed in the thesis. They are known as incomplete information games. In these games one player has two payoff matrixes, and the rival does not know which of them is used. We discuss the advantage of using quantum strategy over the classical game, particular in avoiding the dilemma in classical games.
Classical game theory is a powerful tool focusing on optimized resource distribution, allocation, and sharing in classical wired and wireless networks. As quantum networks are emerging as a means of providing true connectivity between quantum computers, it is imperative and crucial to exploit game theory for addressing challenges such as entanglement distribution and access, routing, topology extraction, and inference. Quantum networks provide the promising opportunity of employing quantum games owing to their inherent capability of generating and sharing quantum states. In addition, quantum games offer enhanced payoffs and winning probabilities, new strategies, and equilibria, which are unimaginable in classical games. Employing quantum game theory to solve fundamental challenges in quantum networks opens a new fundamental research direction necessitating inter-disciplinary efforts. In this article, we introduce a novel game-the-oretical framework for exploiting quantum strategies to solve – as an archetypal example – one of the key functionalities of a quantum network, namely, entanglement distribution. We compare quantum strategies with classical ones by showing the quantum advantages in terms of link fidelity improvement and latency decrease in communication. In the future, we will generalize our game framework to optimize entanglement distribution and access over any quantum network topology. We will also explore how quantum games can be leveraged to address other challenges like routing, optimization of quantum operations, and topology design.
Abstract Quantum computers are on the verge of becoming a commercially available reality. They represent a paradigm shift in computing, with a steep learning gradient. The creation of games is a way to ease the transition for beginners. We present a game similar to the Poker variant Texas hold ’em with the intention to serve as an engaging pedagogical tool to learn the basics rules of quantum computing. The concepts of quantum states, quantum operations and measurement can be learned in a playful manner. The difference to the classical variant is that the community cards are replaced by a quantum register that is “randomly” initialized, and the cards for each player are replaced by quantum gates, randomly drawn from a set of available gates. Each player can create a quantum circuit with their cards, with the aim to maximize the number of 1’s that are measured in the computational basis. The basic concepts of superposition, entanglement and quantum gates are employed. We provide a proof-of-concept implementation using Qiskit (Aleksandrowicz et al. in An open-source framework for quantum computing, 2019). A comparison of the results for the created circuits using a simulator and IBM machines is conducted, showing that error rates on contemporary quantum computers are still very high. For the success of noisy intermediate scale quantum (NISQ) computers, improvements on the error rates and error mitigation techniques are necessary, even for simple circuits. We show that quantum error mitigation (QEM) techniques can be used to improve expectation values of observables on real quantum devices.
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.