首页/论文/quant-ph/0201140

arXiv quant-ph/02011402002-01-30quant-phcond-mathep-th

Quantum Chinos Game: winning strategies through quantum fluctuations

F. Guinea, M. A. Martin-Delgado

备注：: REVTEX4.b4 file, 3 tables
发表信息：: J.Phys. A36 (2003) L197
DOI：: 10.1088/0305-4470/36/13/104

英文摘要：

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.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

General quantum Chinos games

The Chinos game is a non-cooperative game between players who try to guess the total sum of coins drawn collectively. Semiclassical and quantum versions of this game were proposed by F. Guinea and M. A. Martin-Delgado, in J. Phys. A: Math. Gen. 36 L197 (2003), where the coins are replaced by a boson whose number occupancy is the aim of player's guesses. Here, we propose other versions of the Chinos game using a hard-core boson, one qubit and two qubits. In the latter case, we find that using entangled states the second player has a stable winning strategy that becomes symmetric for non-entangl…

2022-10-05quant-ph

An explicit classical strategy for winning a $\mathrm{CHSH}_{q}$ game

A $\mathrm{CHSH}_{q}$ game is a generalization of the standard two player $\mathrm{CHSH}$ game, having $q$ different input and output options. In contrast to the binary game, the best classical and quantum winning strategies are not known exactly. In this paper we provide a constructive classical strategy for winning a $\mathrm{CHSH}_{q}$ game, with $q$ being a prime. Our construction achieves a winning probability better than $\frac{1}{22}q^{-\frac{2}{3}}$, which is in contrast with the previously known constructive strategies achieving only the winning probability of $O(q^{-1})$.

2015-10-26quant-ph

Winning strategies for pseudo-telepathy games using single non-local box

Using a single NL-box, a winning strategy is given for the impossible colouring pseudo-telepathy game for the set of vectors having Kochen-Specker property in four dimension. A sufficient condition to have a winning strategy for the impossible colouring pseudo-telepathy game for general $d$-dimension, with single use of NL-box, is then described. It is also shown that the magic square pseudo-telepathy game of any size can be won by using just two ebits of entanglement -- for quantum strategy, and by a single NL-box -- for non-local strategy.

2006-02-20quant-ph

Connes' Embedding Problem and Winning Strategies for Quantum XOR Games

We consider quantum XOR games, defined in [11], from the perspective of unitary correlations defined in [7]. We show that Connes' embedding problem has a positive answer if and only if every quantum XOR game has entanglement bias equal to the commuting bias. In particular, the embedding problem is equivalent to determining whether every quantum XOR game $G$ with a winning strategy in the commuting model also has a winning strategy in the approximate finite-dimensional model.

2017-06-07math.OAquant-ph

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…

2010-07-17quant-ph

Extended GHZ n-player games with classical probability of winning tending to 0

In 1990, Mermin presented a n player game that is won with certainty using n spin-1/2 particles in a GHZ state whilst no classical strategy (or local theory) can win with probability higher than ${1/2} + \frac{1}{2^{\lceil n/2 \rceil}}$ (which is larger than 1/2). This article first introduces a class of arithmetic games containing Mermin's and gives a quantum algorithm based on a generalized n party GHZ state that wins those games with certainty. It is then proved for a subclass of those games where each player is given a single bit of input that no classical strategy can win with a probabili…

2004-08-23quant-ph

更多相关论文收起更多论文

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 win…

2008-04-17quant-ph

An Analysis of the Quantum Penny Flip Game using Geometric Algebra

We analyze the quantum penny flip game using geometric algebra and so determine all possible unitary transformations which enable the player Q to implement a winning strategy. Geometric algebra provides a clear visual picture of the quantum game and its strategies, as well as providing a simple and direct derivation of the winning transformation, which we demonstrate can be parametrized by two angles. For comparison we derive the same general winning strategy by conventional means using density matrices.

2009-02-25quant-ph

$(n,k)$ 量子陪集一夫一妻制博弈的获胜率

Winning Rates of $(n,k)$ Quantum Coset Monogamy Games

本文提出并分析 $(n,k)$ 量子陪集一夫一妻制博弈，推广等信息情形，并依据子空间率给出改进的凸获胜率上界及无纠缠策略的可达最优界。

2025-09-30cs.ITmath.ITquant-ph

Duality games and operational duality relations

We give operational meaning to wave-particle duality in terms of discrimination games. Duality arises as a constraint on the probability of winning these games. The games are played with the aid of an n-port interferometer, and involve 3 parties, Alice and Bob, who cooperate, and the House, who supervises the game. In one game called ways they attempt to determine the path of a particle in the interferometer. In another, called phases, they attempt to determine which set of known phases have been applied to the different paths. The House determines which game is to be played by flipping a coin…

2017-08-13quant-ph

Quantum Pseudo-Telepathy in Spin Systems: Magic Square Game Under Magnetic Fields and Dzyaloshinskii-Moriya Interaction

Dzyaloshinskii-Moriya (DM) interaction has been proven to excite entanglement of spin systems, enhancing the capability of realizing various quantum tasks such as teleportation. In this work, we consider the DM interaction -to the best of our knowledge, for the first time in quantum game theory. We study the winning probability of magic square game played with the thermal entangled state of spin models under external magnetic fields and DM interaction. We analytically show that although DM interaction excites the entanglement of the system as expected, it surprizingly reduces the winning proba…

2016-09-12quant-ph

Unitary Noise and the Mermin-GHZ 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. Since it is generally very hard to perfectly implement a quantum winning strategy for a pseudo-telepathy game, quantum players are almost certain to make errors even though they use a winning strategy. Af…

2010-06-08cs.CCquant-ph

图同态博弈的普适性与量子着色问题

Universality of graph homomorphism games and the quantum coloring problem

本文证明有限无向图的量子图参数可编码所有同步非局域博弈的获胜策略，通过将任意同步博弈弱*-等价地归约为3-着色博弈，并给出Lovász归约的量子版本，从而统一刻画了色数、独立数和团数的量子版本。

2023-07-10math.OAquant-ph