Tripartite Dynamic Zero-Sum Quantum Games

The Nash equilibrium plays a crucial role in game theory. Most of results are based on classical resources. Our goal in this paper is to explore multipartite zero-sum game with quantum settings. We find that in two different settings there is no strategy for a tripartite classical game being fair. Interestingly, this is resolved by providing dynamic zero-sum quantum games using single quantum state. Moreover, the gains of some players may be changed dynamically in terms of the committed state. Both quantum games are robust against the preparation noise and measurement errors.     

Non-Classical Rules in Quantum Games

Over the last twenty years, quantum game theory has given us many ideas of how quantum games could be played. One of the most prominent ideas in the field is a model of quantum playing bimatrix games introduced by J. Eisert, M. Wilkens and M. Lewenstein. The scheme assumes that players’ strategies are unitary operations and the players act on the maximally entangled two-qubit state. The quantum nature of the scheme has been under discussion since the article by Eisert et al. came out. The aim of our paper was to identify some of non-classical features of the quantum scheme.     

The effect of quantum noise on multiplayer quantum game

It has recently been realized that quantum strategies have a great advantage over classical ones in quantum games. However, quantum states are easily affected by the quantum noise, resulting in decoherence. In this paper, we investigate the effect of quantum noise on a multiplayer quantum game with a certain strategic space, with all players affected by the same quantum noise at the same time. Our results show that in a maximally entangled state, a special Nash equilibrium appears in the range of It has recently been realized that quantum strategies have a great advantage over classical ones in quantum games. However, quantum states are easily affected by the quantum noise, resulting in decoherence. In this paper, we investigate the effect of quantum noise on a multiplayer quantum game with a certain strategic space, with all players affected by the same quantum noise at the same time. Our results show that in a maximally entangled state, a special Nash equilibrium appears in the range of 0≤p≤0.622 （p is the quantum noise parameter）, and then disappears in the range of 0.622 〈 p≤ 1. Increasing the amount of quantum noise leads to the reduction of the quantum player＇s payoff.     

Efficiency of Classical and Quantum Games Equilibria

Nash equilibria and correlated equilibria of classical and quantum games are investigated in the context of their Pareto efficiency. The examples of the prisoner’s dilemma, battle of the sexes and the game of chicken are studied. Correlated equilibria usually improve Nash equilibria of games but require a trusted correlation device susceptible to manipulation. The quantum extension of these games in the Eisert–Wilkens–Lewenstein formalism and the Frąckiewicz–Pykacz parameterization is analyzed. It is shown that the Nash equilibria of these games in quantum mixed Pauli strategies are closer to Pareto optimal results than their classical counter-parts. The relationship of mixed Pauli strategies equilibria and correlated equilibria is also studied.     

The effect of quantum noise on the restricted quantum game

It has recently been established that quantum strategies have great advantage over classical ones in quantum games. However, quantum states are easily affected by the quantum noise resulting in decoherence. In this paper, we investigate the effect of quantum noise on the restricted quantum game in which one player is restricted in classical strategic space, another in quantum strategic space and only the quantum player is affected by the quantum noise. Our results show that in the maximally entangled state, no Nash equilibria exist in the range of It has recently been established that quantum strategies have great advantage over classical ones in quantum games. However, quantum states are easily affected by the quantum noise resulting in decoherence. In this paper, we investigate the effect of quantum noise on the restricted quantum game in which one player is restricted in classical strategic space, another in quantum strategic space and only the quantum player is affected by the quantum noise. Our results show that in the maximally entangled state, no Nash equilibria exist in the range of 0 〈 p ≤ 0.422 （p is the quantum noise parameter）, while two special Nash equilibria appear in the range of 0.422 〈 p 〈 1. The advantage that the quantum player diminished only in the limit of maximum quantum noise. Increasing the amount of quantum noise leads to the increase of the classical player＇s payoff and the reduction of the quantum player＇s payoff, but is helpful in forming two Nash equilibria.     

第四讲 量子对策论

量子对策论是量子信息学的新兴分支,是经典对策论与量子信息学两门学科的交叉学科.由 于引入了量子力学中的量子叠加性和纠缠态,量子对策得出了与经典对策迥然不同的结果.     

Theoretical analysis of quantum game in cavity QED

Recent years, several ways of implementing quantum games in different physical systems have been presented. In this paper, we perform a theoretical analysis of an experimentally feasible way to implement a two player quantum game in cavity quantum electrodynamic(QED). In the scheme, the atoms interact simultaneously with a highly detuned cavity mode with the assistance of a classical field. So the scheme is insensitive to the influence from the cavity decay and the thermal field, and it does not require the cavity to remain in the vacuum state throughout the procedure.     

Quantum Parrondo game based on a quantum ratchet effect

A Parrondo game is a counterintuitive game where two losing games can be combined to form a winning game. We construct a quantum version of a Parrondo game based on a quantum ratchet effect for a delta-kicked model, which can be realized in optical lattices. A game set is presented and a quantum anti-Parrondo game is also investigated.     

Parrondo Games as Lattice Gas Automata

Parrondo games are coin flipping games with the surprising property that alternating plays of two losing games can produce a winning game. We show that this phenomenon can be modelled by probabilistic lattice gas automata. Furthermore, motivated by the recent introduction of quantum coin flipping games, we show that quantum lattice gas automata provide an interesting definition for quantum Parrondo games.     

量子博弈论及其应用

介绍了量子博弈理论及与经典博弈理论的关系，指出了量子博弈理论的优越性，及对现实物理世界的意义。     

Quantum games via search algorithms

We build new quantum games, similar to the spin flip game, where as a novelty the players perform measurements on a quantum system associated to a continuous time search algorithm. The measurements collapse the wave function into one of the two possible states. These games are characterized by a continuous space of strategies and the selection of a particular strategy is determined by the moments when the players measure.     

Quantum Game with Restricted Matrix Strategies

We study a quantum game played by two players with restricted multiple strategies. It is found that in this restricted quantum game Nash equilibrium does not always exist when the initial state is entangled. At the same time,we find that when Nash equilibrium exists the payoff function is usually different from that in the classical counterpart except in some special cases. This presents an explicit example showing quantum game and classical game may differ.When designing a quantum game with limited strategies, the allowed strategy should be carefully chosen according to the type of initial state.     

量子信息引论

文章在阐述量子信息的发展背景之后,介绍了量子纠缠、量子计算、量子密码、量子因特网、量子克隆、量子对策论等方面的内容,既阐述了相关的基本概念,也论及最新的研究进展。     

A competitive game whose maximal Nash-equilibrium payoff requires quantum resources for its achievement

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. 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.     

Quantum Game with Restricted Matrix Strategies

We study a quantum game played by two players with restricted multiple strategies. It is found that in this restricted quantum game Nash equilibrium does not always exist when the initial state is entangled. At the same time,we find that when Nasli equilibrium exists the payoff function is usually different from that in the classical counterpart except in some special cases. This presents an explicit example showing quantum game and classical game may differ.When designing a quantum game with limited strategies, the allowed strategy should be carefully chosen according to the type of initial state.     

Linear optics implementation for quantum game under quantum noise

It has recently been shown that linear optics alone would suffice to implement efficient quantum computation. Quantum computation circuits using coherent states as the logical qubits can be constructed from very simple linear networks, conditional measurements and coherent superposition resource states. We present the quantum game under quantum noise and a proposal for implementing the noisy quantum game using only linear optics.     

基于鹰鸽量子博弈理论评价科研院所的科技自主创新能力

科研院所的科技自主创新能力是推动国家科技进步和经济发展,应对国际经济危机的主要动力,创建科学、完善的科技创新能力评价方法有助于提升科研院所科技创新能力,并为国家制定科技创新决策提供参考依据。本文基于鹰鸽量子博弈理论,提出了一种评价科研院所自主创新能力的方法。介绍了量子博弈论的各基本要素在科技自主创新体系中所对应的物理内涵,根据鹰鸽量子博弈理论建立了科技自主创新能力评价模型,分析了纠缠度与收益矩阵之间的关系,确立了依靠各参与者在鹰鸽量子博弈中的纠缠度来表征科技自主创新能力的方法。给出了科研院所科技自主创新能力的量子博弈论解释,构建了科技自主创新能力评价指标体系,并确定了评价的合成计算方法,即量子纠缠度的计算方法。最后,以中科院部分研究所为实例进行了科技自主创新能力的评价,并利用主成份分析法和中物院的简单统计方法对得到的数据进行了对比分析,结果证明了提出的方法合理且有可操作性。     

Proposal of Realization Restricted Quantum Game with Linear Optic Method

We present a quantum game with the restricted strategic space and its realization with linear optical system, which can be played by two players who are separated remotely. This game can also be realized on any other quantum computers. We find that the constraint brings some interesting properties that are useful for making game models.     

Quantum Version of a Generalized Monty Hall Game and Its Possible Applications to Quantum Secure Communications

In this work, the authors propose a quantum version of a generalized Monty Hall game, that is, one in which the parameters of the game are left free and not fixed on its regular values. The developed quantum scheme is then used to study the expected payoff of the player, using both a separable and an entangled initial‐state. In the two cases, the classical mixed‐strategy payoff is recovered under certain conditions. Lastly, the authors extend the quantum scheme to include multiple independent players, and use this extension to sketch two possible application of the game mechanics to quantum networks, specifically, two validated, multi‐party, key‐distribution quantum protocols.