Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1412.7399 · Quantum Information Processing

Do quantum strategies always win?

Namit Anand, Colin Benjamin

Published Aug 28, 2015• 24 citations
arXivHTMLPDF
DOI
10.1007/s11128-015-1105-y

Related papers

Do quantum strategies always win? A case study in the entangled quantum penny flip game.

Namit Anand, Colin Benjamin

•Dec 23, 2014•0 citations

Quantum strategies win in a defector-dominated population

Qiang Li, Azhar Iqbal, Minyou Chen +1 more

arXiv:1112.0713•Physica A Statistical Mechanics and its Applications•Feb 4, 2012•34 citations

QUANTUM STRATEGIES AND QUANTUM GAMBLING

S. Abeyratne

•Jan 1, 2006•0 citations

Noise and the Mermin-GHZ Game

Ivan Fialík

A pseudo-telepathy game is a game for two or more players for which there is no classical winning strategy, but there is a winning strategy based on sharing quantum entanglement by the players. 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. After introducing a model for pseudo-telepathy games, we investigate the impact of several basic noisy quantum channels on the quantum winning strategy for the Mermin-GHZ game. The question of how strong the noise can be so that quantum players would still be better than classical ones is also dealt with.

Electronic Notes in Theoretical Computer Science•Sep 1, 2009•1 citation

Quantum Chinos game: winning strategies through quantum fluctuations

F. Guinea, Miguel Angel Martin-Delgado

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.

arXiv:quant-ph/0201140•Journal of Physics A Mathematical and General•Mar 19, 2003•17 citations

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

Matej Pivoluska, Martin Plesch

A CHSH q game is a generalization of the standard two player CHSH game, with 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 CHSH q game, with q being a prime. Our construction achieves a winning probability better than , which is in contrast with the previously known constructive strategies achieving only the winning probability of .

arXiv:1510.07431•New Journal of Physics•Feb 12, 2016•6 citations
A pseudo-telepathy game is a game for two or more players for which there is no classical winning strategy, but there is a winning strategy based on sharing quantum entanglement by the players. 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. After introducing a model for pseudo-telepathy games, we investigate the impact of several basic noisy quantum channels on the quantum winning strategy for the Mermin-GHZ game. The question of how strong the noise can be so that quantum players would still be better than classical ones is also dealt with.
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.
An explicit classical strategy for winning a CHSHq{\mathrm{CHSH}}_{q}CHSHq​ game
A CHSH q game is a generalization of the standard two player CHSH game, with 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 CHSH q game, with q being a prime. Our construction achieves a winning probability better than , which is in contrast with the previously known constructive strategies achieving only the winning probability of .