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:0909.5518 · Quantum Information and Computation

A lower bound on the value of entangled binary games

Salman Beigi

Published Nov 1, 2010• 1 citation
arXivHTMLPDF

Abstract

A two-player one-round binary game consists of two cooperative players who each replies by one bit to a message that he receives privately; they win the game if both questions and answers satisfy some predetermined property. A game is called entangled if the players are allowed to share a priori entanglement. It is well-known that the maximum winning probability (value) of entangled XOR-games (binary games in which the predetermined property depends only on the XOR of the two output bits) can be computed by a semidefinite program. In this paper we extend this result in the following sense; if a binary game is uniform, meaning that in an optimal strategy the marginal distributions of the output of each player are uniform, then its entangled value can be efficiently computed by a semidefinite program. We also introduce a lower bound on the entangled value of a general two-player one-round game; this bound depends on the size of the output set of each player and can be computed by a semidefinite program. In particular, we show that if the game is binary, $\omega_q$ is its entangled value, and $\omega_{sdp}$ is the optimum value of the corresponding semidefinite program, then $0.68\,\omega_{sdp} < \omega_q \leq \omega_{sdp}$.

DOI
10.26421/qic10.11-12-2

Related papers

Entangled games do not require much entanglement (withdrawn)

Gus Gutoski

We prove an explicit upper bound on the amount of entanglement required by any strategy in a two-player cooperative game with classical questions and quantum answers. Specifically, we show that every strategy for a game with n-bit questions and n-qubit answers can be implemented exactly by players who share an entangled state of no more than 5n qubits--a bound which is optimal to within a factor of 5/2. Previously, no upper bound at all was known on the amount of entanglement required even to approximate such a strategy. It follows that the problem of computing the value of these games is in NP, whereas previously this problem was not known to be computable.

arXiv:0908.3491•Aug 24, 2009•0 citations

Parallel Repetition of Free Entangled Games: Simplification and Improvements

André Chailloux, Scarpa, Giannicola

In a two-player game, two cooperating but non communicating players, Alice and Bob, receive inputs taken from a probability distribution. Each of them produces an output and they win the game if they satisfy some predicate on their inputs/outputs. The entangled value $ω^*(G)$ of a game $G$ is the maximum probability that Alice and Bob can win the game if they are allowed to share an entangled state prior to receiving their inputs. The $n$-fold parallel repetition $G^n$ of $G$ consists of $n$ instances of $G$ where Alice and Bob receive all the inputs at the same time and must produce all the outputs at the same time. They win $G^n$ if they win each instance of $G$. Recently, there has been a series of works showing parallel repetition with exponential decay for projection games [DSV13], games on the uniform distribution [CS14] and for free games, i.e. games on a product distribution [JPY13]. This article is meant to be a follow up of [CS14], where we improve and simplify several parts of our previous paper. Our main result is that for any free game $G$ with value $ω^*(G)=1-\varepsilon$, we have $ω^*(G^n) \le (1 - \varepsilon^2)^{Ω(\frac{n}{\log(l)})}$ where $l$ is the size of the output set of the game. This result improves on both the results in [JPY13] and [CS14]. The framework we use can also be extended to free projection games. We show that for a free projection game $G$ with value $ω^*(G)=1-\varepsilon$, we have $ω^*(G^n) \le (1 - \varepsilon)^{Ω(n)}$.

arXiv:1410.4397•Oct 16, 2014•11 citations

Entangled Games are Hard to Approximate

Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto +2 more

We establish the first hardness results for the problem of computing the value of one-round games played by a referee and a team of players who can share quantum entanglement. In particular, we show that it is NP-hard to approximate within an inverse polynomial the value of a one-round game with (i) quantum referee and two entangled players or (ii) classical referee and three entangled players. Previously it was not even known if computing the value exactly is NP-hard. We also describe a mathematical conjecture, which, if true, would imply hardness of approximation to within a constant.We start our proof by describing two ways to modify classical multi-player games to make them resistant to entangled players. We then show that a strategy for the modified game that uses entanglement can be "rounded'' to one that does not. The results then follow from classical inapproximability bounds. Our work implies that, unless P = NP, the values of entangled-player games cannot be computed by semidefinite programs that are polynomial in the size of the referee's system, a method that has been successful for more restricted quantum games.

Annual Symposium on Foundations of Computer Science•Oct 1, 2008•56 citations

Unique Games with Entangled Provers Are Easy

Julia Kempe, Oded Regev, Ben Toner

We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are “unique” constraints (i.e., permutations), the value of the game can be well approximated by a semidefinite program (SDP). Essentially the only algorithm known previously was for the special case of binary answers, as follows from the work of Tsirelson in 1980. Among other things, our result implies that the variant of the unique games conjecture where we allow the provers to share entanglement is false. Our proof is based on a novel “quantum rounding technique,” showing how to take a solution to an SDP and transform it into a strategy for entangled provers. Using our approximation by an SDP, we also show a parallel repetition theorem for unique entangled games.

arXiv:0710.0655•SIAM Journal on Computing•Jan 1, 2010•86 citations

Bounding Quantum-Classical Separations for Classes of Nonlocal Games

Tom Bannink, Jop Briët, Harry Buhrman +2 more

We bound separations between the entangled and classical values for several classes of nonlocal $t$-player games. Our motivating question is whether there is a family of $t$-player XOR games for which the entangled bias is $1$ but for which the classical bias goes down to $0$, for fixed $t$. Answering this question would have important consequences in the study of multi-party communication complexity, as a positive answer would imply an unbounded separation between randomized communication complexity with and without entanglement. Our contribution to answering the question is identifying several general classes of games for which the classical bias can not go to zero when the entangled bias stays above a constant threshold. This rules out the possibility of using these games to answer our motivating question. A previously studied set of XOR games, known not to give a positive answer to the question, are those for which there is a quantum strategy that attains value 1 using a so-called Schmidt state. We generalize this class to mod-$m$ games and show that their classical value is always at least $\frac{1}{m} + \frac{m-1}{m} t^{1-t}$. Secondly, for free XOR games, in which the input distribution is of product form, we show $β(G) \geq β^*(G)^{2^t}$ where $β(G)$ and $β^*(G)$ are the classical and entangled biases of the game respectively. We also introduce so-called line games, an example of which is a slight modification of the Magic Square game, and show that they can not give a positive answer to the question either. Finally we look at two-player unique games and show that if the entangled value is $1-ε$ then the classical value is at least $1-\mathcal{O}(\sqrt{ε\log k})$ where $k$ is the number of outputs in the game. Our proofs use semidefinite-programming techniques, the Gowers inverse theorem and hypergraph norms.

arXiv:1811.11068•Leibniz international proceedings in informatics•Nov 27, 2018•11 citations

Quantum XOR Games

Oded Regev, Thomas Vidick

We introduce quantum XOR games, a model of two-player, one-round games that extends the model of XOR games by allowing the referee’s questions to the players to be quantum states. We give examples showing that quantum XOR games exhibit a wide range of behaviors that are known not to exist for standard XOR games, such as cases in which the use of entanglement leads to an arbitrarily large advantage over the use of no entanglement. By invoking two deep extensions of Grothendieck’s inequality, we present an efficient algorithm that gives a constant-factor approximation to the best performance that players can obtain in a given game, both in the case that they have no shared entanglement and that they share unlimited entanglement. As a byproduct of the algorithm, we prove some additional interesting properties of quantum XOR games, such as the fact that sharing a maximally entangled state of arbitrary dimension gives only a small advantage over having no entanglement at all.

arXiv:1207.4939•ACM Transactions on Computation Theory•Aug 31, 2015•61 citations
A two-player one-round binary game consists of two cooperative players who each replies by one bit to a message that he receives privately; they win the game if both questions and answers satisfy some predetermined property. A game is called entangled if the players are allowed to share a priori entanglement. It is well-known that the maximum winning probability (value) of entangled XOR-games (binary games in which the predetermined property depends only on the XOR of the two output bits) can be computed by a semidefinite program. In this paper we extend this result in the following sense; if a binary game is uniform, meaning that in an optimal strategy the marginal distributions of the output of each player are uniform, then its entangled value can be efficiently computed by a semidefinite program. We also introduce a lower bound on the entangled value of a general two-player one-round game; this bound depends on the size of the output set of each player and can be computed by a semidefinite program. In particular, we show that if the game is binary, ωq\omega_qωq​ is its entangled value, and ωsdp\omega_{sdp}ωsdp​ is the optimum value of the corresponding semidefinite program, then 0.68 ωsdp<ωq≤ωsdp0.68\,\omega_{sdp} < \omega_q \leq \omega_{sdp}0.68ωsdp​<ωq​≤ωsdp​.
We prove an explicit upper bound on the amount of entanglement required by any strategy in a two-player cooperative game with classical questions and quantum answers. Specifically, we show that every strategy for a game with n-bit questions and n-qubit answers can be implemented exactly by players who share an entangled state of no more than 5n qubits--a bound which is optimal to within a factor of 5/2. Previously, no upper bound at all was known on the amount of entanglement required even to approximate such a strategy. It follows that the problem of computing the value of these games is in NP, whereas previously this problem was not known to be computable.
In a two-player game, two cooperating but non communicating players, Alice and Bob, receive inputs taken from a probability distribution. Each of them produces an output and they win the game if they satisfy some predicate on their inputs/outputs. The entangled value ω∗(G)ω^*(G)ω∗(G) of a game GGG is the maximum probability that Alice and Bob can win the game if they are allowed to share an entangled state prior to receiving their inputs. The nnn-fold parallel repetition GnG^nGn of GGG consists of nnn instances of GGG where Alice and Bob receive all the inputs at the same time and must produce all the outputs at the same time. They win GnG^nGn if they win each instance of GGG. Recently, there has been a series of works showing parallel repetition with exponential decay for projection games [DSV13], games on the uniform distribution [CS14] and for free games, i.e. games on a product distribution [JPY13]. This article is meant to be a follow up of [CS14], where we improve and simplify several parts of our previous paper. Our main result is that for any free game GGG with value ω∗(G)=1−εω^*(G)=1-\varepsilonω∗(G)=1−ε, we have ω∗(Gn)≤(1−ε2)Ω(nlog⁡(l))ω^*(G^n) \le (1 - \varepsilon^2)^{Ω(\frac{n}{\log(l)})}ω∗(Gn)≤(1−ε2)Ω(log(l)n​) where lll is the size of the output set of the game. This result improves on both the results in [JPY13] and [CS14]. The framework we use can also be extended to free projection games. We show that for a free projection game GGG with value ω∗(G)=1−εω^*(G)=1-\varepsilonω∗(G)=1−ε, we have ω∗(Gn)≤(1−ε)Ω(n)ω^*(G^n) \le (1 - \varepsilon)^{Ω(n)}ω∗(Gn)≤(1−ε)Ω(n).
We establish the first hardness results for the problem of computing the value of one-round games played by a referee and a team of players who can share quantum entanglement. In particular, we show that it is NP-hard to approximate within an inverse polynomial the value of a one-round game with (i) quantum referee and two entangled players or (ii) classical referee and three entangled players. Previously it was not even known if computing the value exactly is NP-hard. We also describe a mathematical conjecture, which, if true, would imply hardness of approximation to within a constant.We start our proof by describing two ways to modify classical multi-player games to make them resistant to entangled players. We then show that a strategy for the modified game that uses entanglement can be "rounded'' to one that does not. The results then follow from classical inapproximability bounds. Our work implies that, unless P = NP, the values of entangled-player games cannot be computed by semidefinite programs that are polynomial in the size of the referee's system, a method that has been successful for more restricted quantum games.
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are “unique” constraints (i.e., permutations), the value of the game can be well approximated by a semidefinite program (SDP). Essentially the only algorithm known previously was for the special case of binary answers, as follows from the work of Tsirelson in 1980. Among other things, our result implies that the variant of the unique games conjecture where we allow the provers to share entanglement is false. Our proof is based on a novel “quantum rounding technique,” showing how to take a solution to an SDP and transform it into a strategy for entangled provers. Using our approximation by an SDP, we also show a parallel repetition theorem for unique entangled games.
We bound separations between the entangled and classical values for several classes of nonlocal ttt-player games. Our motivating question is whether there is a family of ttt-player XOR games for which the entangled bias is 111 but for which the classical bias goes down to 000, for fixed ttt. Answering this question would have important consequences in the study of multi-party communication complexity, as a positive answer would imply an unbounded separation between randomized communication complexity with and without entanglement. Our contribution to answering the question is identifying several general classes of games for which the classical bias can not go to zero when the entangled bias stays above a constant threshold. This rules out the possibility of using these games to answer our motivating question. A previously studied set of XOR games, known not to give a positive answer to the question, are those for which there is a quantum strategy that attains value 1 using a so-called Schmidt state. We generalize this class to mod-mmm games and show that their classical value is always at least 1m+m−1mt1−t\frac{1}{m} + \frac{m-1}{m} t^{1-t}m1​+mm−1​t1−t. Secondly, for free XOR games, in which the input distribution is of product form, we show β(G)≥β∗(G)2tβ(G) \geq β^*(G)^{2^t}β(G)≥β∗(G)2t where β(G)β(G)β(G) and β∗(G)β^*(G)β∗(G) are the classical and entangled biases of the game respectively. We also introduce so-called line games, an example of which is a slight modification of the Magic Square game, and show that they can not give a positive answer to the question either. Finally we look at two-player unique games and show that if the entangled value is 1−ε1-ε1−ε then the classical value is at least 1−O(εlog⁡k)1-\mathcal{O}(\sqrt{ε\log k})1−O(εlogk​) where kkk is the number of outputs in the game. Our proofs use semidefinite-programming techniques, the Gowers inverse theorem and hypergraph norms.
We introduce quantum XOR games, a model of two-player, one-round games that extends the model of XOR games by allowing the referee’s questions to the players to be quantum states. We give examples showing that quantum XOR games exhibit a wide range of behaviors that are known not to exist for standard XOR games, such as cases in which the use of entanglement leads to an arbitrarily large advantage over the use of no entanglement. By invoking two deep extensions of Grothendieck’s inequality, we present an efficient algorithm that gives a constant-factor approximation to the best performance that players can obtain in a given game, both in the case that they have no shared entanglement and that they share unlimited entanglement. As a byproduct of the algorithm, we prove some additional interesting properties of quantum XOR games, such as the fact that sharing a maximally entangled state of arbitrary dimension gives only a small advantage over having no entanglement at all.