• Corpus ID: 238226981

Synchronous Values of Games

  title={Synchronous Values of Games},
  author={J. William Helton and Hamoon Mousavi and Seyed Sajjad Nezhadi and Vern I. Paulsen and Travis B. Russell},
We study synchronous values of games, especially synchronous games. It is known that a synchronous game has a perfect strategy if and only if it has a perfect synchronous strategy. However, we give examples of synchronous games, in particular graph colouring games, with synchronous value that is strictly smaller than their ordinary value. Thus, the optimal strategy for a synchronous game need not be synchronous. We derive a formula for the synchronous value of an XOR game as an optimization… 



A synchronous game for binary constraint systems

It is proved that the set of synchronous quantum correlations is not closed, which implies W. Slofstra's result, by giving an example of a synchronous game that has a perfect quantum approximate strategy but no perfect quantum strategy.

Algebras, Synchronous Games and Chromatic Numbers of Graphs

We associate to each synchronous game an algebra whose representations determine if the game has a perfect deterministic strategy, perfect quantum strategy or one of several other perfect strategies.

Characterization of Binary Constraint System Games

This work investigates a simple class of multi-prover interactive proof systems, called binary constraint system (BCS) games, and characterize those that admit a perfect entangled strategy (i.e., a strategy with value 1 when the provers can use shared entanglement) in terms of a system of matrix equations.

Hardness amplification for entangled games via anchoring

A simple transformation on games called anchoring, inspired in part by the Feige-Kilian transformation, that turns any (multiplayer) game into an anchored game and proves an exponential-decay parallel repetition theorem for anchored games that involve any number of entangled players.

Perfect Commuting-Operator Strategies for Linear System Games

Linear system games are a generalization of Mermin's magic square game introduced by Cleve and Mittal. They show that perfect strategies for linear system games in the tensor-product model of

A parallel repetition theorem for entangled projection games

The “quantum correlated sampling lemma” generalizes results of van Dam and Hayden on universal embezzlement to the following approximate scenario: two non-communicating parties, given classical descriptions of bipartite states, are able to locally generate a joint entangled state.


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

Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems

It is shown that, when the provers are allowed to coordinate their behavior using a shared entangled quantum state, a perfect parallel repetition theorem holds in the following sense: the prover’s optimal success probability for simultaneously playing a collection of XOR proof systems is exactly the product of the individual optimal success probabilities.

Tsirelson’s problem and an embedding theorem for groups arising from non-local games

Tsirelson’s problem asks whether the commuting operator model for two-party quantum correlations is equivalent to the tensor-product model. We give a negative answer to this question by showing that

Consequences and limits of nonlocal strategies

This paper investigates various aspects of the nonlocal effects that can arise when entangled quantum information is shared between two parties, and establishes limits on nonlocal behavior by upper-bounding the values of several of these games.