Quantum Matching Pennies Game

Constructing quantum games from a system of Bell's inequalities

We report constructing quantum games directly from a system of Bell's inequalities using Arthur Fine's analysis published in early 1980s. This analysis showed that such a system of inequalities forms a set of both necessary and sufficient conditions required to find a joint distribution function compatible with a given set of joint probabilities, in terms of which the system of Bell's inequalities is usually expressed. Using the setting of a quantum correlation experiment for playing a quantum game, and considering the examples of Prisoners' Dilemma and Matching Pennies, we argue that this app…

Quantum strategies

We consider game theory from the perspective of quantum algorithms. Strategies in classical game theory are either pure (deterministic) or mixed (probabilistic). We introduce these basic ideas in the context of a simple example, closely related to the traditional Matching Pennies game. While not every two-person zero-sum finite game has an equilibrium in the set of pure strategies, von Neumann showed that there is always an equilibrium at which each player follows a mixed strategy. A mixed strategy deviating from the equilibrium strategy cannot increase a player's expected payoff. We show, how…

Separation between Classical and Quantum Winning Strategies for the Matching Game

Communication complexity is an area of classical computer science which studies how much communication is necessary to solve various distributed computational problems. Quantum information processing can be used to reduce the amount of communication required to carry out some distributed problems. We speak of pseudo-telepathy when it is able to completely eliminate the need for communication. The matching game is the newest member of the family of pseudo-telepathy games. After introducing a general model for pseudo-telepathy games, we focus on the question what the smallest size of inputs is f…

Better Non-Local Games from Hidden Matching

We construct a non-locality game that can be won with certainty by a quantum strategy using log n shared EPR-pairs, while any classical strategy has winning probability at most 1/2+O(log n/sqrt{n}). This improves upon a recent result of Junge et al. in a number of ways.

量子完美匹配

Quantum Perfect Matchings

本文通过非局域博弈定义并研究量子与非信号完美匹配，给出非信号匹配的完全组合表征，证明奇数 n≥7 的完全图具有量子完美匹配，并建立完美匹配与线图量子独立数的等价关系，同时证明超图中量子完美匹配判定不可判定。

量子通信网络中用于优化关联的匹配博弈

Matching Game for Optimized Association in Quantum Communication Networks

本文将量子通信网络中的请求-量子交换机关联问题建模为匹配博弈，提出交换稳定的RQSA算法，在部分信息可用下实现近最优的请求服务率与保真度，且优于贪婪基准并具可扩展性。