In this paper, we provide an introduction to quantum game theory through discussion of ways of converting classical games into the quantum regime. We illustrate how a quantum-based approach can simulate all possible classical game histories in parallel, for the example of Parrondo’s games.
With utilizing some quantum mechanism into the game theory, quantum game theory provides us with the ability to achieve results not otherwise possible. In this paper, a brief overview of classical game theory and some game-theoretic terms are depicted. Then, an introduction to quantum theory is presented as well as some correlative works in this field. Finally, some well-known quantum games are analyzed and discussed, which shows its predominant effect on some games problems (the Prisoners' Dilemma, Parrondo's Games, etc.).
In the context of quantum information theory, “quantization” of various mathematical constructions is said to occur upon the replacement, at various points in the construction, of the classical randomization notion of probability distribution with higher order randomization notions from quantum mechanics such as quantum superposition with measurement. For this to be done “properly”, a faithful copy of the original construction is required to exist within the new “quantum” one, just as is required when a function is extended to a larger domain. Here, Markov processes that serve as mathematical models of history dependent Parrondo games are quantized properly.
Quantum game theory is an exciting new topic that combines the physical behaviour of information in quantum mechanical systems with game theory, the mathematical description of conflict and competition situations, to shed new light on the fields of quantum control and quantum information. This thesis presents quantizations of some classic game-theoretic problems, new results in existing quantization schemes for two player, two strategy non-zero sum games, and in quantum versions of Parrondo's games, where the \ncombination of two losing games can result in a winning game. In addition, quantum cellular automata and quantum walks are discussed, with a history-dependent quantum walk being presented.
We give a concise and self-contained introduction to the theory of Quantum Games by reviewing the seminal works of Meyer, Eisert-Wilkens-Lewenstein, Marinatto-Weber and Landsburg, which initiated the study of this field. By generalizing this body of work, we formulate a protocol to Quantumize any finite classical n-player game, and use a novel approach of describing such a Quantum Game in terms of commuting Payoff Operators. We describe what advantages can be gained by players by quantumizing such a game, particularly, what additional Nash Equilibria the players can achieve and the Pareto-Optimality of these additional equilibria.