量子信息研究进展

量子信息论是经典信息论与量子力学相结合的新兴交叉学科,本综述了最子信息领域的研究进展。即包括了为人们所熟知的量子通信与量子计算领域,也包括了刚刚兴起的但却有巨大潜力的量子对策论等领域。本以介绍量子信息论的基本理论框架为主,同时也介绍了量子信息领域的实验研究进展。     

量子信息研究进展

量子信息论是经典信息论与量子力学相结合的新兴交叉学科。本文综述了量子信息领域的研究进展。即包括了为人们所熟知的量子通信与量子计算领域 ,也包括了刚刚兴起的但却有巨大潜力的量子对策论等领域。本文以介绍量子信息论的基本理论框架为主 ,同时也介绍了量子信息领域的实验研究进展。     

Two Party Non-Local Games

In this work we have introduced two party games with respective winning conditions. One cannot win these games deterministically in the classical world if they are not allowed to communicate at any stage of the game. Interestingly we find out that in quantum world, these winning conditions can be achieved if the players share an entangled state. We also introduced a game which is impossible to win if the players are not allowed to communicate in classical world (both probabilistically and deterministically), yet there exists a perfect quantum strategy by following which, one can attain the winning condition of the game.     

Quantum Prisoner’s Dilemma game on hypergraph networks

We study the possible advantages of adopting quantum strategies in multi-player evolutionary games. We base our study on the three-player Prisoner’s Dilemma (PD) game. In order to model the simultaneous interaction between three agents we use hypergraphs and hypergraph networks. In particular, we study two types of networks: a random network and a SF-like network. The obtained results show that in the case of a three-player game on a hypergraph network, quantum strategies are not necessarily stochastically stable strategies. In some cases, the defection strategy can be as good as a quantum one.     

Experimental implementation of a three qubit quantum game with corrupt source using nuclear magnetic resonance quantum information processor

In a three player quantum 'Dilemma' game each player takes independent decisions to maximize his/her individual gain. The optimal strategy in the quantum version of this game has a higher payoff compared to its classical counterpart. However, this advantage is lost if the initial qubits provided to the players are from a noisy source. We have experimentally implemented the three player quantum version of the 'Dilemma' game as described by Johnson, [N.F. Johnson, Phys. Rev. A 63 (2001) 020302(R)] using nuclear magnetic resonance quantum information processor and have experimentally verified that the payoff of the quantum game for various levels of corruption matches the theoretical payoff.     

Non-factorizable joint probabilities and evolutionarily stable strategies in the quantum prisoner's dilemma game

The well-known refinement of the Nash Equilibrium (NE) called an Evolutionarily Stable Strategy (ESS) is investigated in the quantum Prisoner's Dilemma (PD) game that is played using an Einstein-Podolsky-Rosen type setting. Earlier results report that in this scheme the classical NE remains intact as the unique solution of the quantum PD game. In contrast, we show here that interestingly in this scheme a non-classical solution for the ESS emerges for the quantum PD.     

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.     

Preferences in quantum games

A quantum game can be viewed as a state preparation in which the final output state results from the competing preferences of the players over the set of possible output states that can be produced. It is therefore possible to view state preparation in general as being the output of some appropriately chosen (notional) quantum game. This reverse engineering approach in which we seek to construct a suitable notional game that produces some desired output state as its equilibrium state may lead to different methodologies and insights. With this goal in mind we examine the notion of preference in quantum games since if we are interested in the production of a particular equilibrium output state, it is the competing preferences of the players that determine this equilibrium state. We show that preferences on output states can be viewed in certain cases as being induced by measurement with an appropriate set of numerical weightings, or payoffs, attached to the results of that measurement. In particular we show that a distance-based preference measure on the output states is equivalent to a having a strictly-competitive set of payoffs on the results of some measurement.     

Quantum repeated games with continuous-variable strategies

By the Li-Du-Massar method, we investigate the quantization of a two-stage repeated duopoly game. By solving the quantum repeated game with continuous-variable strategies, we analyze the effect of two stages' entanglement levels, and give some numerical evidences to describe our model.     

Parrondo?s game using a discrete-time quantum walk

We present a new form of a Parrondo game using discrete-time quantum walk on a line. The two players A and B with different quantum coins operators, individually losing the game can develop a strategy to emerge as joint winners by using their coins alternatively, or in combination for each step of the quantum walk evolution. We also present a strategy for a player A (B) to have a winning probability more than player B (A). Significance of the game strategy in information theory and physical applications are also discussed.     

Quantum games entropy

We propose the study of quantum games from the point of view of quantum information theory and statistical mechanics. Every game can be described by a density operator, the von Neumann entropy and the quantum replicator dynamics. There exists a strong relationship between game theories, information theories and statistical physics. The density operator and entropy are the bonds between these theories. The analysis we propose is based on the properties of entropy, the amount of information that a player can obtain about his opponent and a maximum or minimum entropy criterion. The natural trend of a physical system is to its maximum entropy state. The minimum entropy state is a characteristic of a manipulated system, i.e., externally controlled or imposed. There exist tacit rules inside a system that do not need to be specified or clarified and search the system equilibrium based on the collective welfare principle. The other rules are imposed over the system when one or many of its members violate this principle and maximize its individual welfare at the expense of the group.     

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.     

Constructing quantum games from symmetric non-factorizable joint probabilities

We construct quantum games from a table of non-factorizable joint probabilities, coupled with a symmetry constraint, requiring symmetrical payoffs between the players. We give the general result for a Nash equilibrium and payoff relations for a game based on non-factorizable joint probabilities, which embeds the classical game. We study a quantum version of Prisoners' Dilemma, Stag Hunt, and the Chicken game constructed from a given table of non-factorizable joint probabilities to find new outcomes in these games. We show that this approach provides a general framework for both classical and quantum games without recourse to the formalism of quantum mechanics.     

Quantum walks: Decoherence and coin-flipping games

We investigate the global chirality distribution of the quantum walk on the line when decoherence is introduced either through simultaneous measurements of the chirality and particle position, or as a result of broken links. The first mechanism drives the system towards a classical diffusive behavior. This is used to build new quantum games, similar to the spin-flip game. The second mechanism involves two different possibilities: (a) All the quantum walk links have the same probability of being broken. (b) Only the quantum walk links on a half-line are affected by random breakage. In case (a) the decoherence drives the system to a classical Markov process, whose master equation is equivalent to the dynamical equation of the quantum density matrix. This is not the case in (b) where the asymptotic global chirality distribution unexpectedly maintains some dependence with the initial condition. Explicit analytical equations are obtained for all cases.     

Towards a definition of the quantum ergodic hierarchy: Ergodicity and mixing

In a previous paper we have given a general framework for addressing the definition of quantum chaos by identifying the conditions that a quantum system must satisfy to lead to non-integrability in its classical limit. In this paper we will generalize those results, with the purpose of defining the two lower levels of the quantum ergodic hierarchy: ergodicity and mixing. We will also argue for the physical relevance of this approach by considering a particular example where our formalism has been successfully applied.     

Non-local quantum functions and the distributed Deutsch-Jozsa algorithm

Non-local implementations of quantum gates are a vital part of quantum networks. We find an optimal non-local implementation of quantum functions, the quantum gate equivalent of a switch statement. Then, we apply this result to the Deutsch-Jozsa problem, obtaining a distributed Deutsch-Jozsa algorithm and we show the relative efficiency improvement. As an application, we find a non-cooperative game based upon the original Deutsch-Jozsa problem where a classical agent has at most a 50% probability of winning, while a quantum agent can win every time.     

The equivalence of Bell's inequality and the Nash inequality in a quantum game-theoretic setting

The interaction of competing agents is described by classical game theory. It is now well known that this can be extended to the quantum domain, where agents obey the rules of quantum mechanics. This is of emerging interest for exploring quantum foundations, quantum protocols, quantum auctions, quantum cryptography, and the dynamics of quantum cryptocurrency, for example. In this paper, we investigate two-player games in which a strategy pair can exist as a Nash equilibrium when the games obey the rules of quantum mechanics. Using a generalized Einstein–Podolsky–Rosen (EPR) setting for two-player quantum games, and considering a particular strategy pair, we identify sets of games for which the pair can exist as a Nash equilibrium only when Bell's inequality is violated. We thus determine specific games for which the Nash inequality becomes equivalent to Bell's inequality for the considered strategy pair.     

An axiomatic measure of one-way quantum information

I introduce an algorithm to detect one-way quantum information between two interacting quantum systems, i.e. the direction and orientation of the information transfer in arbitrary quantum dynamics. I then build an information-theoretic quantifier of one-way information which satisfies a set of desirable axioms. In particular, it correctly evaluates whether correlation implies one-way quantum information, and when the latter is transferred between uncorrelated systems. In the classical scenario, the quantity measures information transfer between random variables. I also generalize the method to identify and rank concurrent sources of quantum information flow in many-body dynamics, enabling to reconstruct causal patterns in complex networks.     

Quantum correlation between two qubits induced by a common heat bath

In terms of geometric discord, we study quantum correlations between two qubits interacting with a common heat bath. A necessary and sufficient condition for zero discord for arbitrary two-qubit density matrix is derived. With this condition, we show that a common heat bath can always induce two-qubit quantum correlations if both qubits are initially prepared in arbitrary superposition of “pointer basis”.