Quantum Game Players Can Have Advantage Without Discord
نویسندگان
چکیده
The last two decades have witnessed a rapid development of quantum information processing, a new paradigm which studies the power and limit of “quantum advantages” in various information processing tasks. Problems such as when quantum advantage exists, and if existing, how much it could be, are at a central position of these studies. In a broad class of scenarios, there are, implicitly or explicitly, at least two parties involved, who share a state, and the correlation in this shared state is the key factor to the efficiency under concern. In these scenarios, the shared entanglement or discord is usually what accounts for quantum advantage. In this paper, we examine a fundamental problem of this nature from the perspective of game theory, a branch of applied mathematics studying selfish behaviors of two or more players. We exhibit a natural zero-sum game, in which the chance for any player to win the game depends only on the ending correlation. We show that in a certain classical equilibrium, a situation in which no player can further increase her payoff by any local classical operation, whoever first uses a quantum computer has a big advantage over its classical opponent. The equilibrium is fair to both players and, as a shared correlation, it does not contain any discord, yet a quantum advantage still exists. This indicates that at least in game theory, the previous notion of discord as a measure of non-classical correlation needs to be reexamined, when there are two players with different objectives.
منابع مشابه
Quantum Locality in Game Strategy
Game theory is a well established branch of mathematics whose formalism has a vast range of applications from the social sciences, biology, to economics. Motivated by quantum information science, there has been a leap in the formulation of novel game strategies that lead to new (quantum Nash) equilibrium points whereby players in some classical games are always outperformed if sharing and proce...
متن کاملاثر درهمتنیدگی و چهارچوب نالخت در بازی کوانتومی چهارکیوبیتی
The effect of increasing quantum bits and Unruh effect on quantum Prisoners’ dilemma has been investigated for both entangled and unentangled initial states. The Nash equilibrium, as an important result of quantum game theory, was obtained through the different payoffs resulted from choosing various strategies. It has been shown that the non-inertial frame disturbs the symmetry of the game. Act...
متن کاملAsymptotic dynamics of quantum discord in open quantum systems
It is well known that quantum entanglement makes certain tasks in quantum information theory possible. However, there are also quantum tasks that display a quantum advantage without entanglement. Distinguishing classical and quantum correlations in quantum systems is therefore of both practical and fundamental importance. Realistic quantum systems are not closed, and therefore it is important t...
متن کاملDynamics of entangled quantum optical system in independent media
We study the dynamics of two three-level atoms interacting with independent bosonic Lorentzian reservoirs at zero temperature. Such systems can be created in far astronomical objects. Quantum mechanical behaviour of these particles can produce detectable effects on the spectroscopic identifications of these objects, if such behaviour remain stable during the interaction with their media. It is ...
متن کاملMultiplayer quantum minority game with decoherence
A quantum version of the Minority game for an arbitrary number of agents is studied. When the number of agents is odd, quantizing the game produces no advantage to the players, however, for an even number of agents new Nash equilibria appear that have no classical analogue. The new Nash equilibria provide far preferable expected payoffs to the players compared to the equivalent classical game. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 256 شماره
صفحات -
تاریخ انتشار 2015