International Journal of Interactive Multimedia and Artificial Intelligence

The Game Theory in Quantum Computers: A Review.

Raquel Pérez Antón, José Ignacio López Sánchez, Alberto Corbí

Published Oct 2, 2023• 9 citations

Abstract

Game theory has been studied extensively in recent centuries as a set of formal mathematical strategies for optimal decision making. This discipline improved its efficiency with the arrival, in the 20th century, of digital computer science. However, the computational limitations related to exponential time type problems in digital processors, triggered the search for more efficient alternatives. One of these choices is quantum computing. Certainly, quantum processors seem to be able to solve some of these complex problems, at least in theory. For this reason, in recent times, many research works have emerged related to the field of quantum game theory. In this paper we review the main studies about the subject, including operational requirements and implementation details. In addition, we describe various quantum games, their design strategy, and the used supporting tools. We also present the still open debate linked to the interpretation of the transformations of classical algorithms in fundamental game theory to their quantum version, with special attention to the Nash equilibrium.

DOI: 10.9781/ijimai.2023.09.001

Related papers

Quantum Games, Quantum States, Their Properties and Applications

Dmitrijs Kravcenko

Quantum mechanics and game theory were developed at almost the same time, during the first half of 20th century.Classical game theory is one of the most developed in mathematics and computer science.It has many applications in economics, biology, and different kinds of social science.In computer science, many cryptographic protocols are also based on the elements of game theory.Quantum computing is a relatively new branch of computer science.It unites different aspects of complexity theory and quantum physics.Our intention is to take it one step further and combine classical game theory with the acquired knowledge of quantum computing; in particular, to study the effects of using quantum information in the well-known problems of game theory.In this thesis, we obtain several bounds on the values of some special classes of nonlocal quantum games, and we present a new scheme for games quantization.

Jan 1, 20130 citations

On Topics in Quantum Games

Y. Avishai

This work concentrates on simultaneous move non-cooperating quantum games. Part of it is evidently not new, but it is included for the sake self consistence, as it is devoted to introduction of the mathematical and physical grounds of the pertinent topics, and the way in which a simple classical game is modified to become a quantum game (a procedure referred to as a quantization of a classical game). The connection between game theory and information science is briefly stressed, and the role of quantum entanglement (that plays a central role in the theory of quantum games), is exposed. Armed with these tools, we investigate some basic concepts like the existence (or absence) of a pure strategy and mixed strategy Nash equilibrium and its relation with the degree of entanglement. The main results of this work are as follows: 1) Construction of a numerical algorithm based on the method of best response functions, designed to search for pure strategy Nash equilibrium in quantum games. The formalism is based on the discretization of a continuous variable into a mesh of points, and can be applied to quantum games that are built upon two-players two-strategies classical games, based on the method of best response functions. 2) Application of this algorithm to study the question of how the existence of pure strategy Nash equilibrium is related to the degree of entanglement (specified by a continuous parameter γ ). It is shown that when the classical game GC has a pure strategy Nash equilibrium that is not Pareto efficient, then the quantum game GQ with maximal entanglement (γ = π/2) has no pure strategy Nash equilibrium. By studying a non-symmetric prisoner dilemma game, it is found that there is a critical value 0γc such that for γγc there is a pure strategy Nash equilibrium and for γ≥γc there is no pure strategy Nash equilibrium. The behavior of the two payoffs as function of γ starts at that of the classical ones at (D, D) and approaches the cooperative classical ones at (C, C) (C = confess, D = don’t confess). 3) We then study Bayesian quantum games and show that under certain conditions, there is a pure strategy Nash equilibrium in such games even when entanglement is maximal. 4) We define the basic ingredients of a quantum game based on a two-player three strategies classical game. This requires the introduction of trits (instead of bits) and quantum trits (instead of quantum bits). It is proved that in this quantum game, there is no classical commensurability in the sense that the classical strategies are not obtained as a special case of the quantum strategies.

Journal of Quantum Information ScienceJan 1, 20239 citations

Quantum-like modelling in game theory: Quo Vadis? A brief review

Sudip Patra, Partha Ghose

Purpose The current paper is a brief review of the emerging field of quantum-like modelling in game theory. This paper aims to explore several quantum games, which are superior compared to their classical counterparts, which means either they give rise to superior Nash equilibria or they make the game fairer. For example, quantum Prisoners Dilemma generates Pareto superior outcomes as compared to defection outcome in the famous classical case. Again, a quantum-like version of cards game can make the game fairer, increasing the chance of winning of players who are disadvantaged in the classical case. This paper explores all the virtues of simple quantum games, also highlighting some findings of the authors as regards Prisoners Dilemma game. Design/methodology/approach As this is a general review paper, the authors have not demonstrated any specific mathematical method, rather explored the well-known quantum probability framework, used for designing quantum games. They have a short appendix which explores basic structure of Hilbert space representation of human decision-making. Findings Along with the review of the extant literature, the authors have also highlighted some new findings for quantum Prisoners Dilemma game. Specifically, they have shown in the earlier studies (which are referred to here) that a pure quantum entanglement set up is not needed for designing better games, even a weaker condition, which is classical entanglement is sufficient for producing Pareto improved outcomes. Research limitations/implications Theoretical research, with findings and implications for future game designs, it has been argued that it is not always needed to have true quantum entanglement for superior Nash Equilibria. Originality/value The main purpose here is to raise awareness mainly in the social science community about the possible applications of quantum-like game theory paradigm. The findings related to Prisoners Dilemma game are, however, original.

Asian Journal of Economics and BankingDec 3, 20204 citations

Quantum game theory and quantum decision systems

Shivangi J. Gandhi, Madhuri R. Chopade, Twinkle K. Patel

Quantum game theory (QGT) extends traditional game theory by using quantum mechanics to create new models for strategic decision-making. Traditional game theory provides effective tools for analyzing rational human interaction; yet it suffers from three main restrictions because it cannot properly handle uncertain situations, contradictory behavior, and complex relationships among agents. QGT addresses these challenges through its implementation of quantum phenomena, which enable strategic options that go beyond traditional mixed strategies. The extended system introduces fresh equilibrium solutions that allow easier resolution of standard problems. The chapter presents an organized structure to display QGT, which shows its value for strategic decision-making systems. The chapter shows fundamental concepts that link classical theories with quantum theories through its demonstration of how quantum strategies have developed from their original state to their present form, which expands traditional game models. The research investigates optimization methods, cybersecurity measures, economic systems, and artificial intelligence applications. The study identifies implementation obstacles and future research needs. The advanced QGT decision-making systems provide outstanding solutions that allow intelligent systems to interact with their environments and solve complex environmental problems.

CRC Press eBooksOct 21, 20260 citations

Quantum game theory and the complexity of approximating quantum Nash equilibria

John Bostanci, John Watrous

This paper is concerned with complexity theoretic aspects of a general formulation of quantum game theory that models strategic interactions among rational agents that process and exchange quantum information. In particular, we prove that the computational problem of finding an approximate Nash equilibrium in a broad class of quantum games is, like the analogous problem for classical games, included in (and therefore complete for) the complexity class PPAD. Our main technical contribution, which facilitates this inclusion, is an extension of prior methods in computational game theory to strategy spaces that are characterized by semidefinite programs.

arXiv:2102.00512QuantumDec 22, 202216 citations

Some Topics in Quantum Games

Y. Avishai

This work, based on the author's MA thesis, concentrates on simultaneous move quantum games of two players. A numerical algorithm based on the method of best response functions, designed to search for pure strategy Nash equilibrium in quantum games is constructed. It is then used show that there is a critical degree of entanglement above which a pure strategy Nash Equilibrium does not exist. The behavior of the two payoffs approach the cooperative classical ones. Bayesian quantum games are defined, and it is shown that under certain conditions, there {\it is} a pure strategy Nash equilibrium in such games even when entanglement is maximal. The basic ingredients of a quantum game based on a two-players {\it three} decisions classical games are presented. This requires the definition of trits (instead of bits) and quantum trits (instead of quantum bits). It is shown that in this quantum game, there is no classical commensurability in the sense that the classical strategies are not obtained as a special case of the quantum strategies. An entanglement operator transforming a pure two qutrit state into a maximally entangled one is explicitly constructed.

arXiv:1306.0284Jun 3, 20138 citations