Game theory and its quantum extension apply in numerous fields that affect people’s social, political, and economical life. Physical limits imposed by the current technology used in computing architectures (e.g., circuit size) give rise to the need for novel mechanisms, such as quantum inspired computation. Elements from quantum computation and mechanics combined with game-theoretic aspects of computing could open new pathways towards the future technological era. This paper associates dominant strategies of repeated quantum games with quantum automata that recognize infinite periodic inputs. As a reference, we used the PQ-PENNY quantum game where the quantum strategy outplays the choice of pure or mixed strategy with probability 1 and therefore the associated quantum automaton accepts with probability 1. We also propose a novel game played on the evolution of an automaton, where players’ actions and strategies are also associated with periodic quantum automata.
Game theory and its quantum extension apply in numerous fields that affect people’s social, political, and economical life. Physical limits imposed by the current technology used in computing architectures (e.g., circuit size) give rise to the need for novel mechanisms, such as quantum inspired computation. Elements from quantum computation and mechanics combined with game-theoretic aspects of computing could open new pathways towards the future technological era. This paper associates dominant strategies of repeated quantum games with quantum automata that recognize infinite periodic inputs. As a reference, we used the PQ-PENNY quantum game where the quantum strategy outplays the choice of pure or mixed strategy with probability 1 and therefore the associated quantum automaton accepts with probability 1. We also propose a novel game played on the evolution of an automaton, where players’ actions and strategies are also associated with periodic quantum automata.
The meticulous study of finite automata has produced many important and useful results. Automata are simple yet efficient finite state machines that can be utilized in a plethora of situations. It comes, therefore, as no surprise that they have been used in classic game theory in order to model players and their actions. Game theory has recently been influenced by ideas from the field of quantum computation. As a result, quantum versions of classic games have already been introduced and studied. The PQ penny flip game is a famous quantum game introduced by Meyer in 1999. In this paper we investigate all possible finite games that can be played between the two players Q and Picard of the original PQ game. For this purpose we establish a rigorous connection between finite automata and the PQ game along with all its possible variations. Starting from the automaton that corresponds to the original game, we construct more elaborate automata for certain extensions of the game, before finally presenting a semiautomaton that captures the intrinsic behavior of all possible variants of the PQ game. What this means is that from the semiautomaton in question, by setting appropriate initial and accepting states, one can construct deterministic automata able to capture every possible finite game that can be played between the two players Q and Picard. Moreover, we introduce the new concepts of a winning automaton and complete automaton for either player.
Classic game theory is an important field with a long tradition of useful results. Recently, the quantum versions of classical games, such as the Prisoner's Dilemma (PD), have attracted a lot of attention. Similarly, state machines and specifically finite automata have also been under constant and thorough study for plenty of reasons. The quantum analogues of these abstract machines, like the quantum finite automata, have been studied extensively. In this work, we examine some well-known game conditional strategies that have been studied within the framework of the repeated PD game. Then, we try to associate these strategies to proper quantum finite automata that receive them as inputs and recognize them with probability 1, achieving some interesting results. We also study the quantum version of PD under the Eisert-Wilkens-Lewenstein scheme, proposing a novel conditional strategy for the repeated version of this game.
Quantum game theory is a multidisciplinary field which combines quantum mechanics with game theory by introducing non-classical resources such as entanglement, quantum operations and quantum measurement. By transferring two-player two-strategy (2 × 2) dilemma containing classical games into the quantum realm, dilemmas can be resolved in quantum pure strategies if entanglement is distributed between the players who use quantum operations. Moreover, players receive the highest sum of payoffs available in the game, which are otherwise impossible in classical pure strategies. Encouraged by the observation of rich dynamics of physical systems with many interacting parties and the power of entanglement in quantum versions of 2 × 2 games, it became generally accepted that quantum versions can be easily extended to N -player situations by simply allowing N -partite entangled states. In this article, however, we show that this is not generally true because the reproducibility of classical tasks in the quantum domain imposes limitations on the type of entanglement and quantum operators. We propose a benchmark for the evaluation of quantum and classical versions of games, and derive the necessary and sufficient conditions for a physical realization. We give examples of entangled states that can and cannot be used, and the characteristics of quantum operators used as strategies.
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.
Quantum computing defines the use of quantum mechanics in the computation process. Given that Moore's law is about to reach its physical limits, it is natural to search for new technologies and computation models. The need for mechanisms and verification processes for infinite quantum computation will draw the attention of the research community. Potential applications of the proposed automata concern the verification of quantum systems and the design of appropriate quantum circuits. In the present work we define a quantum version of ω-automata, the periodic quantum automata that are able to efficiently recognize ω-languages of the form (amb)ω, where m is a finite number. We present our definitions through examples and figures. Even if our definition is simple, yet it has several interesting and useful properties. For example, they seem to be space efficient for periodic ω-languages of the form (amb)ω.
Game theory is a well established field with applications in many areas including the social sciences, biology, and computer science [6]. Recently, however, researchers in quantum computation have begun to study the implications of games set in the quantum domain (i.e. game theoretical situations where either one or more players have quantum computational power or where the implementation of strategies uses some form of quantum information). Such a setting allows for entanglement and superpositions of strategies and evaluation of payoffs using quantum measurement. This approach to game theory, according to some scholars in the field, could help us understand certain physical systems, improve economic markets, and develop quantum algorithms. I have conducted an investigation into quantum game theory. I have constructed simulation tools using Maple that, along with research into related work, have helped gain some insight into this new field. The important solutions in classical game theory are usually Nash equilibria. What do they look like in the quantum realm? In what