E. W. Piotrowski, J. Sladkowski
Recent development in quantum computation and quantum information theory allows to extend the scope of game theory for the quantum world. The paper presents the history, basic ideas and recent development in quantum game theory. In this context, a new application of the Ising chain model is proposed.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
A quantum invitation to probability theory
本文以儿童为对象，介绍量子概率论与复分析的基础概念，旨在以通俗方式引导初学者理解量子概率框架及其与复分析的关联。
Open quantum systems have become an active area of research, owing to its potential applications in many different fields ranging from computation to biology. Here, we review the formalism of dynamical maps used to represent the time evolution of open quantum systems and discuss the various representations and properties of the same, with many examples.
We give a non-technical introduction of the basic concepts of Quantum Information Theory along the distinction between possible and impossible machines. We then proceed to describe the mathematical framework of Quantum Information Theory. The capacities of a quantum channel for classical and for quantum information are defined in a unified scheme, and a mathematical characterization of all teleportation and dense coding schemes is given.
We describe quantum tomography as an inverse statistical problem and show how entropy methods can be used to study the behaviour of sieved maximum likelihood estimators. There remain many open problems, and a main purpose of the paper is to bring these to the attention of the statistical community.
The theory of quantum dynamical semigroups within the mathematically rigorous framework of completely positive dynamical maps is reviewed. First, the axiomatic approach which deals with phenomenological constructions and general mathematical structures is discussed. Then basic derivation schemes of the constructive approach including singular coupling, weak coupling and low density limits are presented in their higly simplified versions. Two-level system coupled to a heat bath, damped harmonic oscillator, models of decoherence, quantum Brownian particle and Bloch-Boltzmann equations are used a…
In the context of a physical theory, two devices, A and B, described by the theory are called incompatible if the theory does not allow the existence of a third device C that would have both A and B as its components. Incompatibility is a fascinating aspect of physical theories, especially in the case of quantum theory. The concept of incompatibility gives a common ground for several famous impossibility statements within quantum theory, such as ``no-cloning'' and ``no information without disturbance''; these can be all seen as statements about incompatibility of certain devices. The purpose o…
The engineering and control of devices at the quantum-mechanical level--such as those consisting of small numbers of atoms and photons--is a delicate business. The fundamental uncertainty that is inherently present at this scale manifests itself in the unavoidable presence of noise, making this a novel field of application for stochastic estimation and control theory. In this expository paper we demonstrate estimation and feedback control of quantum mechanical systems in what is essentially a noncommutative version of the binomial model that is popular in mathematical finance. The model is ext…
An overview of the concept of phase-locking at the non linear, geometric and quantum level is attempted, in relation to finite resolution measurements in a communication receiver and its 1/f noise. Sine functions, automorphic functions and cyclotomic arithmetic are respectively used as the relevant trigonometric tools. The common point of the three topics is found to be the Mangoldt function of prime number theory as the generator of low frequency noise in the coupling coefficient, the scattering coefficient and in quantum critical statistical states. Huyghens coupled pendulums, the Adler equa…
Deep neural networks have established themselves as one of the most promising machine learning techniques. Training such models at large scales is often parallelized, giving rise to the concept of distributed deep learning. Distributed techniques are often employed in training large models or large datasets either out of necessity or simply for speed. Quantum machine learning, on the other hand, is the interplay between machine learning and quantum computing. It seeks to understand the advantages of employing quantum devices in developing new learning algorithms as well as improving the existi…
The quantum state of a light beam can be represented as an infinite dimensional density matrix or equivalently as a density on the plane called the Wigner function. We describe quantum tomography as an inverse statistical problem in which the state is the unknown parameter and the data is given by results of measurements performed on identical quantum systems. We present consistency results for Pattern Function Projection Estimators as well as for Sieve Maximum Likelihood Estimators for both the density matrix of the quantum state and its Wigner function. Finally we illustrate via simulated da…
An invitation to the sample complexity of quantum hypothesis testing
本文研究量子假设检验的样本复杂度，刻画了对称与非对称二元场景的样本复杂度、给出多元场景的上下界，并探讨其在多领域的关联与未来开放方向。
Quantum Information Theory and Free Semialgebraic Geometry: One Wonderland Through Two Looking Glasses
本文通过正性、可分性、量子幻方、非局部博弈和张量网络等例子，展示量子信息论与自由半代数几何的共同对象及结合双视角的价值。
The theory of quantum games permits players to choose strategies that prepare and measure quantum states. Whereas conventional game theory provides guarantees for fixed-point stability in non-cooperative games, so-called Nash equilibria, we find this guarantee is not provided for quantum games. In particular, we show the conditions for Glickberg's fixed-point theorem do not apply to pure quantum games when the payoff is a physical observable. We further show that Nash equilibrium can be guaranteed when the payoff is defined with respect to state preparation.
S. J. van Enk and R. Pike in PRA 66, 024306 (2002) argue that the equilibrium solution to a quantum game isn't unique but is already present in the classical game itself. In this work, we contest this assertion by showing that a random strategy in a particular quantum (Hawk-Dove) game is unique to the quantum game. In other words, one cannot obtain the equilibrium solution of the quantum Hawk-Dove game in the classical Hawk-Dove game. Moreover, we provide an analytical solution to the quantum $2\times2$ strategic form Hawk-Dove game using randomly mixed strategies. The random strategy which we…
Quantum game theory for 2 2 games: a mathematical framework
本文提出一个严谨的数学框架，用于量子博弈论在静态2x2博弈中的应用，扩展经典概念到量子领域，其中玩家可使用任意酉操作或SU(2)连续群的概率测度作为混合策略。
Recent development in quantum computation and quantum information theory allows to extend the scope of game theory for the quantum world. The paper presents the history and basic ideas of quantum game theory. Description of Giffen paradoxes in this new formalism is discussed.
Recent development in quantum computation and quantum information theory allows to extend the scope of game theory for the quantum world. The authors have recently proposed a quantum description of financial market in terms of quantum game theory. The paper contain an analysis of such markets that shows that there would be advantage in using quantum computers and quantum strategies.
Exploiting Finite Geometries for Better Quantum Advantages in Mermin-Like Games
本文借鉴辛极空间几何，提出Eloily博弈，其量子-经典成功差距大于Mermin-Peres和doily博弈，并在IBM量子体验上以1的成功率超越经典界限，验证了量子策略优势。
Our purpose is to focus attention on a new criterion for quantum schemes by bringing together the notions of quantum game and game isomorphism. A quantum game scheme is required to generate the classical game as a special case. Now, given a quantum game scheme and two isomorphic classical games, we additionally require the resulting quantum games to be isomorphic as well. We show how this isomorphism condition influences the players' strategy sets. We are concerned with the Marinatto-Weber type quantum game scheme and the strong isomorphism between games in strategic form.
We apply several quantization schemes to simple versions of the Chinos game. Classically, for two players with one coin each, there is a symmetric stable strategy that allows each player to win half of the times on average. A partial quantization of the game (semiclassical) allows us to find a winning strategy for the second player, but it is unstable w.r.t. the classical strategy. However, in a fully quantum version of the game we find a winning strategy for the first player that is optimal: the symmetric classical situation is broken at the quantum level.
The aim of this paper is to bring together the notions of quantum game and game isomorphism. The work is intended as an attempt to introduce a new criterion for quantum game schemes. The generally accepted requirement forces a quantum scheme to generate the classical game in a particular case. Now, given a quantum game scheme and two isomorphic classical games, we additionally require the resulting quantum games to be isomorphic as well. We are concerned with the Eisert-Wilkens-Lewenstein quantum game scheme and the strong isomorphism between games in strategic form.
We present a scheme for playing quantum repeated 2x2 games based on the Marinatto and Weber's approach to quantum games. As a potential application, we study twice repeated Prisoner's Dilemma game. We show that results not available in classical game can be obtained when the game is played in the quantum way. Before we present our idea, we comment on the previous scheme of playing quantum repeated games.
We generalize a concept of classical finite extensive game to make it useful for application of quantum objects. The generalization extends a quantum realization scheme of static games to any finite extensive game. It represents an extension of any classical finite extensive games to the quantum domain. In addition our model is compatible with well-known quantum schemes of static games. The paper is summed up by two examples.
We continue the analysis of quantum-like description of markets and economics. The approach has roots in the recently developed quantum game theory and quantum computing. The present paper is devoted to quantum bargaining games which are a special class of quantum market games without institutionalized clearinghouses.
Infinitely Repeated Quantum Games and Strategic Efficiency
本文建立一般重复量子博弈概念并证明量子民间定理，揭示强纠缠下量子囚徒困境中经典 Pareto 最优与相互合作未必构成均衡，并给出具体均衡策略。
We consider the discrete-time quantum walk in the plane, and present a quantum implementation of Parrondo's game for four players. Physical significance of the game strategies are also discussed.
A framework for discussing relationships between different types of games is proposed. Within the framework, quantum simultaneous games, finite quantum simultaneous games, quantum sequential games, and finite quantum sequential games are defined. In addition, a notion of equivalence between two games is defined. Finally, the following three theorems are shown: (1) For any quantum simultaneous game G, there exists a quantum sequential game equivalent to G. (2) For any finite quantum simultaneous game G, there exists a finite quantum sequential game equivalent to G. (3) For any finite quantum se…
We propose a quantum-like description of markets and economics. The approach has roots in the recently developed quantum game theory.
The quantum advantage arising in a simplified multi-player quantum game, is found to be a disadvantage when the game's qubit-source is corrupted by a noisy "demon". Above a critical value of the corruption-rate, or noise-level, the coherent quantum effects impede the players to such an extent that the optimal choice of game changes from quantum to classical.
Scalable board games, including Five in a Row (or gomoku) and weiqi (or go), are generalized so that they can be played on or by quantum computers. We adopt three principles for the generalization: the first two are to ensure that the games are compatible with quantum computer and the third is to ensure that the standard classical games are the special cases. We demonstrate how to construct basic quantum moves and use them to set up quantum games. There are three different schemes to play the quantized games: one quantum computer with another quantum computer (QwQ), two classical computer play…
We study the applicability of quantum algorithms in computational game theory and generalize some results related to Subtraction games, which are sometimes referred to as one-heap Nim games. In quantum game theory, a subset of Subtraction games became the first explicitly defined class of zero-sum combinatorial games with provable separation between quantum and classical complexity of solving them. For a narrower subset of Subtraction games, an exact quantum sublinear algorithm is known that surpasses all deterministic algorithms for finding solutions with probability $1$. Typically, both Nim …
We investigate quantum games in which the information is asymmetrically distributed among the players, and find the possibility of the quantum game outperforming its classical counterpart depends strongly on not only the entanglement, but also the informational asymmetry. What is more interesting, when the information distribution is asymmetric, the contradictive impact of the quantum entanglement on the profits is observed, which is not reported in quantum games of symmetric information.
Recently the concept of quantum information has been introduced into game theory. Here we present the first study of quantum games with more than two players. We discover that such games can possess a new form of equilibrium strategy, one which has no analogue either in traditional games or even in two-player quantum games. In these `pure' coherent equilibria, entanglement shared among multiple players enables new kinds of cooperative behavior: indeed it can act as a contract, in the sense that it prevents players from successfully betraying one-another.
Game theory is the mathematical framework for analyzing strategic interactions in conflict and competition situations. In recent years quantum game theory has earned the attention of physicists, and has emerged as a branch of quantum information theory [1]. With the aid of entanglement and linear superposition of strategies, quantum games are shown to yield signifcant advantage over their classical counterparts. In this paper we explore optimal and equilibrium solutions to quantum minority games. Initial states with different level of entanglement are investigated. Focus will be on 4 and 6 pla…
We present the first study of a dynamical quantum game. Each agent has a `memory' of her performance over the previous m timesteps, and her strategy can evolve in time. The game exhibits distinct regimes of optimality. For small m the classical game performs better, while for intermediate m the relative performance depends on whether the source of qubits is `corrupt'. For large m, the quantum players dramatically outperform the classical players by `freezing' the game into high-performing attractors in which evolution ceases.
The noncooperative Nash equilibrium solution of classical games corresponds to a rational expectations attitude on the part of the players. However, in many cases, games played by human players have outcomes very different from Nash equilibria. A restricted version of quantum games is proposed to implement, in mathematical games, the interplay of self-interest and internalized social norms that rules human behavior.
We initiate a study of random instances of nonlocal games. We show that quantum strategies are better than classical for almost any 2-player XOR game. More precisely, for large n, the entangled value of a random 2-player XOR game with n questions to every player is at least 1.21... times the classical value, for 1-o(1) fraction of all 2-player XOR games.
While it is known that shared quantum entanglement can offer improved solutions to a number of purely cooperative tasks for groups of remote agents, controversy remains regarding the legitimacy of quantum games in a competitive setting--in particular, whether they offer any advantage beyond what is achievable using classical resources. We construct a competitive game between four players based on the minority game where the maximal Nash-equilibrium payoff when played with the appropriate quantum resource is greater than that obtainable by classical means, assuming a local hidden variable model…
In this paper, we propose a Quantum variation of combinatorial games, generalizing the Quantum Tic-Tac-Toe proposed by Allan Goff. A combinatorial game is a two-player game with no chance and no hidden information, such as Go or Chess. In this paper, we consider the possibility of playing superpositions of moves in such games. We propose different rulesets depending on when superposed moves should be played, and prove that all these rulesets may lead similar games to different outcomes. We then consider Quantum variations of the game of Nim. We conclude with some discussion on the relative int…
A simple and general formulation of the quantum game theory is presented, accommodating all possible strategies in the Hilbert space for the first time. The theory is solvable for the two strategy quantum game, which is shown to be equivalent to a family of classical games supplemented by quantum interference. Our formulation gives a clear perspective to understand why and how quantum strategies outmaneuver classical strategies. It also reveals novel aspects of quantum games such as the stone-scissor-paper phase sub-game and the fluctuation-induced moderation.
An example of the macroscopic game of two partners consisting of two classical games played simultaneously with special dependence of strategies is considered. The average profit of each partner is equal to the average profit obtained in the quantum game with two noncommuting operators for the spin one half system with strategies defined by the wave function. Nash equilibria in the macroscopic game coincide with Nash equilibria of the quantum game.
We study possible influence of not necessarily sincere arbiter on the course of classical and quantum 2x2 games and we show that this influence in the quantum case is much bigger than in the classical case. Extreme sensitivity of quantum games on initial states of quantum objects used as carriers of information in a game shows that a quantum game, contrary to a classical game, is not defined by a payoff matrix alone but also by an initial state of objects used to play a game. Therefore, two quantum games that have the same payoff matrices but begin with different initial states should be consi…
Playing a Parrondo's game with a qutrit is the subject of this paper. We show that a true quantum Parrondo's game can be played with a 3 state coin(qutrit) in a 1D quantum walk in contrast to the fact that playing a true Parrondo's game with a 2 state coin(qubit) in 1D quantum walk fails in the asymptotic limits.
Several variants of nonlocal games have been considered in the study of quantum entanglement and nonlocality. This paper concerns two of these variants, called quantum-classical games and extended nonlocal games. We give a construction of an extended nonlocal game from any quantum-classical game that allows one to translate certain facts concerning quantum- classical games to extended nonlocal games. In particular, based on work of Regev and Vidick, we conclude that there exist extended nonlocal games for which no finite-dimensional entangled strategy can be optimal. While this conclusion is a…
In this paper we show the connection between the supersymmetry and quantum games.
Quantumizing Classical Games: An Introduction to Quantum Game Theory
本文回顾量子博弈论的开创性工作，提出将任意有限经典n人博弈量子化的协议，采用可对易收益算子描述量子博弈，分析量子化带来的额外纳什均衡及帕累托最优性等优势。
Citizen Science Games on the Timeline of Quantum Games
本文概述用于量子物理公民科学研究的量子游戏，探索其与量子计算机游戏的联系，指出领域受严肃游戏应用、量子计算机发展及开放游戏开发活动驱动，并展望未来协作等前景。
A game-theoretic setting provides a mathematical basis for analysis of strategic interaction among competing agents and provides insights into both classical and quantum decision theory and questions of strategic choice. An outstanding mathematical question, is to understand the conditions under which a classical game-theoretic setting can be transformed to a quantum game, and under which conditions there is an equivalence. In this paper, we consider quantum games as those that allow non-factorizable probabilities. We discuss two approaches for obtaining a non-factorizable game and study the o…
This paper unifies the concepts of evolutionary games and quantum strategies. First, we state the formulation and properties of classical evolutionary strategies, with focus on the destinations of evolution in 2-player 2-strategy games. We then introduce a new formalism of quantum evolutionary dynamics, and give an example where an evolving quantum strategy gives reward if played against its classical counterpart.
Quantum Game Jam -- Making Games with Quantum Physicists
本文介绍了2014-2019年举办五届的Quantum Game Jam跨学科游戏创作活动，评估其组织模式与原型效用，证实其能促进协作学习并产出可后续开发的游戏原型。
The History of Quantum Games
该研究收集260余款量子游戏，从三个维度梳理其发展历程，反思量子游戏的定义与内涵，指出量子主题正拓展至商业游戏，且量子硬件发展催生了新型量子计算机游戏。
We introduce concurrent quantum non-local games, quantum output mirror games and concurrent classical-to-quantum non-local games, as quantum versions of synchronous non-local games, and provide tracial characterisations of their perfect strategies belonging to various correlation classes. We define *-algebras and C*-algebras of concurrent classical-to-quantum and concurrent quantum non-local games, and algebraic versions of the orthogonal rank of a graph. We show that quantum homomorphisms of quantum graphs can be viewed as entanglement assisted classical homomorphisms of the graphs, and give …
Quantum pseudo-telepathy games are good examples of explaining the strangeness of quantum mechanics and demonstrating the advantage of quantum resources over classical resources. Most of the quantum pseudo-telepathy games are common interest games, nevertheless conflicting interest games are more widely used to model real world situations. Recently Pappa et al. (Phys. Rev. Lett. 114, 020401, 2015) proposed the first two-party conflicting interest game where quantum advice enhances social optimality. In the present paper we give two new three-party conflicting interest games and show that quant…
We pursue a general theory of quantum games. We show that quantum games are more efficient than classical games, and provide a saturated upper bound for this efficiency. We demonstrate that the set of finite classical games is a strict subset of the set of finite quantum games. We also deduce the quantum version of the Minimax Theorem and the Nash Equilibrium Theorem.
We present a perspective on quantum games that focuses on the physical aspects of the quantities that are used to implement a game. If a game is to be played, it has to be played with objects and actions that have some physical existence. We call such games playable. By focusing on the notion of playability for games we can more clearly see the distinction between classical and quantum games and tackle the thorny issue of what it means to quantize a game. The approach we take can more properly be thought of as gaming the quantum rather than quantizing a game and we find that in this perspectiv…
Quantum games have proposed a new point of view for the solution of the classical problems and dilemmas in game theory. Certain quantization relationships can be proposed with the objective that a game can be generalized into a quantum domain where the linear superposition of actions is allowed. This quantization let us describe and solution problems originated by conflicting or cooperative behaviors among the members of a system from the point of view of quantum mechanical interactions. This leads us to interesting aspects which only can be observed through the quantization of a game like the…
Coordination and cooperation are among the most important issues of game theory. Recently, the attention turned to game theory on graphs and social networks. Encouraged by interesting results obtained in quantum evolutionary game analysis, we study cooperative Parrondo's games in a quantum setup. The game is modeled using multidimensional quantum random walks with biased coins. We use the GHZ and W entangled states as the initial state of the coins. Our analysis shows than an apparent paradox in cooperative quantum games and some interesting phenomena can be observed.
We quantize prisoners dilemma and chicken game by our generalized quantization scheme to explore the role of quantum discord in quantum games. In order to establish this connection we use Werner-like state as an initial state of the game. In this quantization scheme measurement can be performed in entangled as well as in product basis. For the measurement in entangled basis the dilemma in both the games can be resolved by separable states with non-zero quantum discord. Similarly for product basis measurement the payoffs are quantum mechanical only for nonzero values of quantum discord.
We pursue the possible connections between classical games and quantum computation. The Parrondo game is one in which a random combination of two losing games produces a winning game. We introduce novel realizations of this Parrondo effect in which the player can `win' via random reflections and rotations of the state-vector, and connect these to known quantum algorithms.
Quantum Extensive Form Games
本文提出量子展开型博弈概念，利用量子跃迁实现博弈树路径的成对湮灭，并将其用于量子化Conway的Angel问题，使已解决的经典博弈产生非平凡的量子版本。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。