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:1809.10616 · Communications in Mathematical Physics

Universal Gaps for XOR Games from Estimates on Tensor Norm Ratios

Guillaume Aubrun, Ludovico Lami, Carlos Palazuelos, Stanisław J. Szarek, Andreas Winter

Published Mar 7, 2020• 23 citations
arXivHTMLPDF

Abstract

Abstract We define and study XOR games in the framework of general probabilistic theories, which encompasses all physical models whose predictive power obeys minimal requirements. The bias of an XOR game under local or global strategies is shown to be given by a certain injective or projective tensor norm, respectively. The intrinsic (i.e. model-independent) advantage of global over local strategies is thus connected to a universal functionr(n, m) called ‘projective–injective ratio’. This is defined as the minimal constant $$\rho $$ ρ such that $$\Vert \cdot \Vert _{X\otimes _\pi Y}\leqslant \rho \,\Vert \cdot \Vert _{X\otimes _\varepsilon Y}$$ ‖·‖X⊗πY⩽ρ‖·‖X⊗εY holds for all Banach spaces of dimensions $$\dim X=n$$ dimX=n and $$\dim Y=m$$ dimY=m , where $$X\otimes _\pi Y$$ X⊗πY and $$X \otimes _\varepsilon Y$$ X⊗εY are the projective and injective tensor products. By requiring that $$X=Y$$ X=Y , one obtains a symmetrised version of the above ratio, denoted by $$r_s(n)$$ rs(n) . We prove that $$r(n,m)\geqslant 19/18$$ r(n,m)⩾19/18 for all $$n,m\geqslant 2$$ n,m⩾2 , implying that injective and projective tensor products are never isometric. We then study the asymptotic behaviour ofr(n, m) and $$r_s(n)$$ rs(n) , showing that, up to log factors: $$r_s(n)$$ rs(n) is of the order $$\sqrt{n}$$ n (which is sharp);r(n, n) is at least of the order $$n^{1/6}$$ n1/6 ; andr(n, m) grows at least as $$\min \{n,m\}^{1/8}$$ min{n,m}1/8 . These results constitute our main contribution to the theory of tensor norms. In our proof, a crucial role is played by an ‘ $$\ell _1/\ell _2/\ell _{\infty }$$ ℓ1/ℓ2/ℓ∞ trichotomy theorem’ based on ideas by Pisier, Rudelson, Szarek, and Tomczak-Jaegermann. The main operational consequence we draw is that there is a universal gap between local and global strategies in general XOR games, and that this grows as a power of the minimal local dimension. In the quantum case, we are able to determine this gap up to universal constants. As a corollary, we obtain an improved bound on the scaling of the maximal quantum data hiding efficiency against local measurements.

DOI
10.1007/s00220-020-03688-2

Related papers

Multipartite entanglement in XOR games

Jop Briët, Harry Buhrman, Troy Lee +1 more

We study multipartite entanglement in the context of XOR games. In particular, we study the ratio of the entangled and classical \emph{biases}, which measure the maximum advantage of a quantum or classical strategy over a uniformly random strategy. For the case of two-player XOR games, Tsirelson proved that this ratio is upper bounded by the celebrated Grothendieck constant. In contrast, \PG proved the existence of entangled states that give quantum players an unbounded advantage over classical players in a three-player XOR game. We show that the multipartite entangled states that are most often seen in today's literature can only lead to a bias that is a constant factor larger than the classical bias. These states include GHZ states, any state local-unitarily equivalent to combinations of GHZ and maximally entangled states shared between different subsets of the players (e.g., stabilizer states), as well as generalizations of GHZ states of the form $\sum_i \alpha_i \ket{i}\cdots\ket{i}$ for arbitrary amplitudes $\alpha_i$. Our results have the following surprising consequence: \emph{classical} three-player XOR games do not follow an XOR parallel repetition theorem, even a very weak one. Besides this, we discuss implications of our results for communication complexity and hardness of approximation. Our proofs are based on novel applications of extensions of Grothendieck's inequality, due to Blei and Tonge, and Carne, generalizing Tsirelson's use of Grothendieck's inequality to bound the bias of two-player XOR games.

Quantum Information and Computation•Mar 1, 2013•17 citations

Multipartite entanglement in XOR games

Jop Briët, Harry Buhrman, Troy Lee +1 more

We study multipartite entanglement in the context of XOR games. In particular, we study the ratio of the entangled and classical biases, which measure the maximum advantage of a quantum or classical strategy over a uniformly random strategy. For the case of two-player XOR games, Tsirelson proved that this ratio is upper bounded by the celebrated Grothendieck constant. In contrast, Pérez-García et al. proved the existence of entangled states that give quantum players an unbounded advantage over classical players in a three-player XOR game. We show that the multipartite entangled states that are most often seen in today's literature can only lead to a bias that is a constant factor larger than the classical bias. These states include GHZ states, any state local-unitarily equivalent to combinations of GHZ and maximally entangled states shared between different subsets of the players (e.g., stabilizer states), as well as generalizations of GHZ states of the form Σiαi|i〉... |i〉 for arbitrary amplitudes αi. Our results have the following surprising consequence: classical three-player XOR games do not follow an XOR parallel repetition theorem, even a very weak one. Besides this, we discuss implications of our results for communication complexity and hardness of approximation. Our proofs are based on novel applications of extensions of Grothendieck's inequality, due to Blei and Tonge, and Carne, generalizing Tsirelson's use of Grothendieck's inequality to bound the bias of two-player XOR games.

Quantum Information Processing•Mar 1, 2013•1 citation

Global vs. Product Observables in Bipartite Quantum Systems: The Sharp Bound

Zhi Li, Xiaofei Shi

To probe a bipartite quantum system, one may use arbitrary global operators or restrict to product operators acting separately on the two subsystems. We determine the sharp universal comparison between the resulting norms. For every $z\in M_n\otimes M_m$, we prove $\|z\|_1\leq\sqrt{2}\min\{n,m\}\|z\|_\varepsilon$, where $\|\cdot\|_1$ is the trace norm and $\|\cdot\|_\varepsilon$ is the injective tensor norm associated with the trace norms on $M_n$ and $M_m$. To prove the upper bound, we establish an $L_1$ noncommutative Khintchine inequality whose random coefficients are the entries of a Haar unitary. We also show that the coefficient $\sqrt{2}$ is sharp. As applications, we show that the same sharp constant governs the gap between bipartite correlation measured in trace norm and that measured by a correlation function, and obtain an improved universal upper bound for quantum data hiding. The upper bound has also been formalized and machine-checked in Lean.

quant-pharXiv:2608.06235•Aug 7, 2026•0 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

Connecting xor and xor * games

Lorenzo Catani, Ricardo Faleiro, Pierre-Emmanuel Emeriau +2 more

In this work we focus on two classes of games: xor nonlocal games and xor* sequential games with monopartite resources. xor games have been widely studied in the literature of nonlocal games, and we introduce xor* games as their natural counterpart within the class of games where a resource system is subjected to a sequence of controlled operations and a final measurement. Examples of xor* games are $2\ensuremath{\rightarrow}1$ quantum random access codes (QRAC) and the chsh* game introduced by Henaut et al. [Phys. Rev. A 98, 060302 (2018)]. We prove, using the diagrammatic language of process theories, that under certain assumptions these two classes of games can be related via an explicit theorem that connects their optimal strategies, and so their classical (Bell) and quantum (Tsirelson) bounds. We also show that two of such assumptions, the reversibility of transformations and the bidimensionality of the resource system in the xor* games, are strictly necessary for the theorem to hold by providing explicit counterexamples. We conclude with several examples of pairs of xor/xor* games and by discussing in detail the possible resources that power the quantum computational advantages in xor* games.

arXiv:2210.00397•Physical Review A•Jan 23, 2024•13 citations

Algorithms, Bounds, and Strategies for Entangled XOR Games

Adam Bene Watts, Aram W. Harrow, Gurtej Kanwar +1 more

Entangled games are a quantum analog of constraint satisfaction problems and have had important applications to quantum complexity theory, quantum cryptography, and the foundations of quantum mechanics. Given a game, the basic computational problem is to compute its entangled value: the supremum success probability attainable by a quantum strategy. We study the complexity of computing the (commuting-operator) entangled value omega^* of entangled XOR games with any number of players. Based on a duality theory for systems of operator equations, we introduce necessary and sufficient criteria for an XOR game to have omega^* = 1, and use these criteria to derive the following results: 1) An algorithm for symmetric games that decides in polynomial time whether omega^* = 1 or omega^* < 1, a task that was not previously known to be decidable, together with a simple tensor-product strategy that achieves value 1 in the former case. The only previous candidate algorithm for this problem was the Navascués-Pironio-Acín (also known as noncommutative Sum of Squares or ncSoS) hierarchy, but no convergence bounds were known. 2) A family of games with three players and with omega^* < 1, where it takes doubly exponential time for the ncSoS algorithm to witness this. By contrast, our algorithm runs in polynomial time. 3) Existence of an unsatisfiable phase for random (non-symmetric) XOR games. We show that there exists a constant C_k^{unsat} depending only on the number k of players, such that a random k-XOR game over an alphabet of size n has omega^* < 1 with high probability when the number of clauses is above C_k^{unsat} n. 4) A lower bound of Omega(n log(n)/log log(n)) on the number of levels in the ncSoS hierarchy required to detect unsatisfiability for most random 3-XOR games. This is in contrast with the classical case where the (3n)^{th} level of the sum-of-squares hierarchy is equivalent to brute-force enumeration of all possible solutions.

arXiv:1801.00821•Leibniz international proceedings in informatics•Jan 2, 2018•12 citations
Abstract We define and study XOR games in the framework of general probabilistic theories, which encompasses all physical models whose predictive power obeys minimal requirements. The bias of an XOR game under local or global strategies is shown to be given by a certain injective or projective tensor norm, respectively. The intrinsic (i.e. model-independent) advantage of global over local strategies is thus connected to a universal functionr(n, m) called ‘projective–injective ratio’. This is defined as the minimal constant ρ\rho ρ ρ such that ∥⋅∥X⊗πY⩽ρ ∥⋅∥X⊗εY\Vert \cdot \Vert _{X\otimes _\pi Y}\leqslant \rho \,\Vert \cdot \Vert _{X\otimes _\varepsilon Y}∥⋅∥X⊗π​Y​⩽ρ∥⋅∥X⊗ε​Y​ ‖·‖X⊗πY⩽ρ‖·‖X⊗εY holds for all Banach spaces of dimensions dim⁡X=n\dim X=ndimX=n dimX=n and dim⁡Y=m\dim Y=mdimY=m dimY=m , where X⊗πYX\otimes _\pi YX⊗π​Y X⊗πY and X⊗εYX \otimes _\varepsilon YX⊗ε​Y X⊗εY are the projective and injective tensor products. By requiring that X=YX=YX=Y X=Y , one obtains a symmetrised version of the above ratio, denoted by rs(n)r_s(n)rs​(n) rs(n) . We prove that r(n,m)⩾19/18r(n,m)\geqslant 19/18r(n,m)⩾19/18 r(n,m)⩾19/18 for all n,m⩾2n,m\geqslant 2n,m⩾2 n,m⩾2 , implying that injective and projective tensor products are never isometric. We then study the asymptotic behaviour ofr(n, m) and rs(n)r_s(n)rs​(n) rs(n) , showing that, up to log factors: rs(n)r_s(n)rs​(n) rs(n) is of the order n\sqrt{n}n​ n (which is sharp);r(n, n) is at least of the order n1/6n^{1/6}n1/6 n1/6 ; andr(n, m) grows at least as min⁡{n,m}1/8\min \{n,m\}^{1/8}min{n,m}1/8 min{n,m}1/8 . These results constitute our main contribution to the theory of tensor norms. In our proof, a crucial role is played by an ‘ ℓ1/ℓ2/ℓ∞\ell _1/\ell _2/\ell _{\infty }ℓ1​/ℓ2​/ℓ∞​ ℓ1/ℓ2/ℓ∞ trichotomy theorem’ based on ideas by Pisier, Rudelson, Szarek, and Tomczak-Jaegermann. The main operational consequence we draw is that there is a universal gap between local and global strategies in general XOR games, and that this grows as a power of the minimal local dimension. In the quantum case, we are able to determine this gap up to universal constants. As a corollary, we obtain an improved bound on the scaling of the maximal quantum data hiding efficiency against local measurements.
We study multipartite entanglement in the context of XOR games. In particular, we study the ratio of the entangled and classical \emph{biases}, which measure the maximum advantage of a quantum or classical strategy over a uniformly random strategy. For the case of two-player XOR games, Tsirelson proved that this ratio is upper bounded by the celebrated Grothendieck constant. In contrast, \PG proved the existence of entangled states that give quantum players an unbounded advantage over classical players in a three-player XOR game. We show that the multipartite entangled states that are most often seen in today's literature can only lead to a bias that is a constant factor larger than the classical bias. These states include GHZ states, any state local-unitarily equivalent to combinations of GHZ and maximally entangled states shared between different subsets of the players (e.g., stabilizer states), as well as generalizations of GHZ states of the form ∑iαi∣i⟩⋯∣i⟩\sum_i \alpha_i \ket{i}\cdots\ket{i}∑i​αi​∣i⟩⋯∣i⟩ for arbitrary amplitudes αi\alpha_iαi​. Our results have the following surprising consequence: \emph{classical} three-player XOR games do not follow an XOR parallel repetition theorem, even a very weak one. Besides this, we discuss implications of our results for communication complexity and hardness of approximation. Our proofs are based on novel applications of extensions of Grothendieck's inequality, due to Blei and Tonge, and Carne, generalizing Tsirelson's use of Grothendieck's inequality to bound the bias of two-player XOR games.
We study multipartite entanglement in the context of XOR games. In particular, we study the ratio of the entangled and classical biases, which measure the maximum advantage of a quantum or classical strategy over a uniformly random strategy. For the case of two-player XOR games, Tsirelson proved that this ratio is upper bounded by the celebrated Grothendieck constant. In contrast, Pérez-García et al. proved the existence of entangled states that give quantum players an unbounded advantage over classical players in a three-player XOR game. We show that the multipartite entangled states that are most often seen in today's literature can only lead to a bias that is a constant factor larger than the classical bias. These states include GHZ states, any state local-unitarily equivalent to combinations of GHZ and maximally entangled states shared between different subsets of the players (e.g., stabilizer states), as well as generalizations of GHZ states of the form Σiαi|i〉... |i〉 for arbitrary amplitudes αi. Our results have the following surprising consequence: classical three-player XOR games do not follow an XOR parallel repetition theorem, even a very weak one. Besides this, we discuss implications of our results for communication complexity and hardness of approximation. Our proofs are based on novel applications of extensions of Grothendieck's inequality, due to Blei and Tonge, and Carne, generalizing Tsirelson's use of Grothendieck's inequality to bound the bias of two-player XOR games.
To probe a bipartite quantum system, one may use arbitrary global operators or restrict to product operators acting separately on the two subsystems. We determine the sharp universal comparison between the resulting norms. For every z∈Mn⊗Mmz\in M_n\otimes M_mz∈Mn​⊗Mm​, we prove ∥z∥1≤2min⁡{n,m}∥z∥ε\|z\|_1\leq\sqrt{2}\min\{n,m\}\|z\|_\varepsilon∥z∥1​≤2​min{n,m}∥z∥ε​, where ∥⋅∥1\|\cdot\|_1∥⋅∥1​ is the trace norm and ∥⋅∥ε\|\cdot\|_\varepsilon∥⋅∥ε​ is the injective tensor norm associated with the trace norms on MnM_nMn​ and MmM_mMm​. To prove the upper bound, we establish an L1L_1L1​ noncommutative Khintchine inequality whose random coefficients are the entries of a Haar unitary. We also show that the coefficient 2\sqrt{2}2​ is sharp. As applications, we show that the same sharp constant governs the gap between bipartite correlation measured in trace norm and that measured by a correlation function, and obtain an improved universal upper bound for quantum data hiding. The upper bound has also been formalized and machine-checked in Lean.
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.
In this work we focus on two classes of games: xor nonlocal games and xor* sequential games with monopartite resources. xor games have been widely studied in the literature of nonlocal games, and we introduce xor* games as their natural counterpart within the class of games where a resource system is subjected to a sequence of controlled operations and a final measurement. Examples of xor* games are $2\ensuremath{\rightarrow}1$ quantum random access codes (QRAC) and the chsh* game introduced by Henaut et al. [Phys. Rev. A 98, 060302 (2018)]. We prove, using the diagrammatic language of process theories, that under certain assumptions these two classes of games can be related via an explicit theorem that connects their optimal strategies, and so their classical (Bell) and quantum (Tsirelson) bounds. We also show that two of such assumptions, the reversibility of transformations and the bidimensionality of the resource system in the xor* games, are strictly necessary for the theorem to hold by providing explicit counterexamples. We conclude with several examples of pairs of xor/xor* games and by discussing in detail the possible resources that power the quantum computational advantages in xor* games.
Entangled games are a quantum analog of constraint satisfaction problems and have had important applications to quantum complexity theory, quantum cryptography, and the foundations of quantum mechanics. Given a game, the basic computational problem is to compute its entangled value: the supremum success probability attainable by a quantum strategy. We study the complexity of computing the (commuting-operator) entangled value omega^* of entangled XOR games with any number of players. Based on a duality theory for systems of operator equations, we introduce necessary and sufficient criteria for an XOR game to have omega^* = 1, and use these criteria to derive the following results: 1) An algorithm for symmetric games that decides in polynomial time whether omega^* = 1 or omega^* < 1, a task that was not previously known to be decidable, together with a simple tensor-product strategy that achieves value 1 in the former case. The only previous candidate algorithm for this problem was the Navascués-Pironio-Acín (also known as noncommutative Sum of Squares or ncSoS) hierarchy, but no convergence bounds were known. 2) A family of games with three players and with omega^* < 1, where it takes doubly exponential time for the ncSoS algorithm to witness this. By contrast, our algorithm runs in polynomial time. 3) Existence of an unsatisfiable phase for random (non-symmetric) XOR games. We show that there exists a constant C_k^{unsat} depending only on the number k of players, such that a random k-XOR game over an alphabet of size n has omega^* < 1 with high probability when the number of clauses is above C_k^{unsat} n. 4) A lower bound of Omega(n log(n)/log log(n)) on the number of levels in the ncSoS hierarchy required to detect unsatisfiability for most random 3-XOR games. This is in contrast with the classical case where the (3n)^{th} level of the sum-of-squares hierarchy is equivalent to brute-force enumeration of all possible solutions.