Concurrent Quantum Strategies

2019 ◽  
pp. 3-19
Author(s):  
Pierre Clairambault ◽  
Marc de Visme ◽  
Glynn Winskel
Keyword(s):  
Quantum Strategies

Evolution of quantum strategies on a lattice network

2015 ◽  
Author(s):  
Heng Zhang ◽  
Junsuo Zhao ◽  
Wenjun Zhang ◽  
Dan Li ◽  
Xi Yong ◽  
...  
Keyword(s):  
Lattice Network ◽  
Quantum Strategies

scholarly journals Quantum Strategies

1999 ◽  
Vol 82 (5) ◽  
pp. 1052-1055 ◽  
Author(s):  
David A. Meyer
Keyword(s):  
Quantum Strategies

The structure of nearly-optimal quantum strategies for the non-local XOR games

2016 ◽  
Vol 16 (13&14) ◽  
pp. 1191-1211 ◽  
Author(s):  
Dimeter Ostrev
Keyword(s):  
Algebraic Structure ◽  
Optimal Strategy ◽  
Infinite Family ◽  
Optimal Strategies ◽  
Non Local ◽  
Quantum Strategies

We consider the infinite family of non-local games CHSH(n). We consider nearly-optimal strategies for CHSH(n). We introduce a notion of approximate homomorphism for strategies and show that any nearly-optimal strategy for CHSH(n) is approximately homomorphic to the canonical optimal CHSH(n) strategy. This demonstrates that any nearly-optimal CHSH(n) strategy must approximately contain the algebraic structure of the canonical optimal strategy.

scholarly journals THE SET OF QUANTUM CORRELATIONS IS NOT CLOSED

2019 ◽  
Vol 7 ◽  
Author(s):  
WILLIAM SLOFSTRA
Keyword(s):  
Hilbert Space ◽  
Linear System ◽  
Tensor Product ◽  
Quantum Correlations ◽  
Embedding Theorem ◽  
Product Strategy ◽  
Finite Dimensional ◽  
Universal Embedding ◽  
Quantum Strategies ◽  
Finite Dimensional Hilbert Space

We construct a linear system nonlocal game which can be played perfectly using a limit of finite-dimensional quantum strategies, but which cannot be played perfectly on any finite-dimensional Hilbert space, or even with any tensor-product strategy. In particular, this shows that the set of (tensor-product) quantum correlations is not closed. The constructed nonlocal game provides another counterexample to the ‘middle’ Tsirelson problem, with a shorter proof than our previous paper (though at the loss of the universal embedding theorem). We also show that it is undecidable to determine if a linear system game can be played perfectly with a finite-dimensional strategy, or a limit of finite-dimensional quantum strategies.

scholarly journals Quantum strategies win in a defector-dominated population

2012 ◽  
Vol 391 (11) ◽  
pp. 3316-3322 ◽  
Author(s):  
Qiang Li ◽  
Azhar Iqbal ◽  
Minyou Chen ◽  
Derek Abbott
Keyword(s):  
Quantum Strategies

scholarly journals QUANTUM MECHANISM HELPS AGENTS COMBAT "BAD" SOCIAL CHOICE RULES

2011 ◽  
Vol 09 (01) ◽  
pp. 615-623 ◽  
Author(s):  
HAOYANG WU
Keyword(s):  
Game Theory ◽  
Social Choice ◽  
Mechanism Design ◽  
Design Theory ◽  
Reverse Problem ◽  
Quantum Domain ◽  
Quantum Mechanism ◽  
Social Choice Rules ◽  
Quantum Strategies

Quantum strategies have been successfully applied to game theory for years. However, as a reverse problem of game theory, the theory of mechanism design is ignored by physicists. In this paper, the theory of mechanism design is generalized to a quantum domain. The main result is that by virtue of a quantum mechanism, agents who satisfy a certain condition can combat "bad" social choice rules instead of being restricted by the traditional mechanism design theory.

scholarly journals Randomness in nonlocal games between mistrustful players

2017 ◽  
Vol 17 (7&8) ◽  
pp. 595-610
Author(s):  
Carl A. Miller ◽  
Yaoyun Shi
Keyword(s):  
Quantum Cryptography ◽  
Cryptographic Protocols ◽  
Related Question ◽  
The Other ◽  
Signaling Game ◽  
Local Randomness ◽  
Quantum Strategies

If two quantum players at a nonlocal game G achieve a superclassical score, then their measurement outcomes must be at least partially random from the perspective of any third player. This is the basis for device-independent quantum cryptography. In this paper we address a related question: does a superclassical score at G guarantee that one player has created randomness from the perspective of the other player? We show that for complete-support games, the answer is yes: even if the second player is given the first player’s input at the conclusion of the game, he cannot perfectly recover her output. Thus some amount of local randomness (i.e., randomness possessed by only one player) is always obtained when randomness is certified from nonlocal games with quantum strategies. This is in contrast to non-signaling game strategies, which may produce global randomness without any local randomness. We discuss potential implications for cryptographic protocols between mistrustful parties.

Sign in / Sign up

Export Citation Format

Share Document