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• 19 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

Connes’ embedding problem and winning strategies for quantum XOR games

Samuel J. Harris

We consider quantum XOR games, defined in the work of Regev and Vidick [ACM Trans. Comput. Theory 7, 43 (2015)], from the perspective of unitary correlations defined in the work of Harris and Paulsen [Integr. Equations Oper. Theory 89, 125 (2017)]. We show that the winning bias of a quantum XOR game in the tensor product model (respectively, the commuting model) is equal to the norm of its associated linear functional on the unitary correlation set from the appropriate model. We show that Connes’ embedding problem has a positive answer if and only if every quantum XOR game has entanglement bias equal to the commuting bias. In particular, the embedding problem is equivalent to determining whether every quantum XOR game G with a winning strategy in the commuting model also has a winning strategy in the approximate finite-dimensional model.

arXiv:1706.02349•Journal of Mathematical Physics•Dec 1, 2017•5 citations

Algorithms, Bounds, and Strategies for Entangled XOR Games

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

We study the complexity of computing the commuting-operator value $ω^*$ of entangled XOR games with any number of players. We introduce necessary and sufficient criteria for an XOR game to have $ω^* = 1$, and use these criteria to derive the following results: 1. An algorithm for symmetric games that decides in polynomial time whether $ω^* = 1$ or $ω^* < 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 $ω^* < 1$, where it takes doubly exponential time for the ncSoS algorithm to witness this (in contrast with our algorithm which runs in polynomial time). 3. A family of games achieving a bias difference $2(ω^* - ω)$ arbitrarily close to the maximum possible value of $1$ (and as a consequence, achieving an unbounded bias ratio), answering an open question of Briët and Vidick. 4. Existence of an unsatisfiable phase for random (non-symmetric) XOR games: that is, we show that there exists a constant $C_k^{\text{unsat}}$ depending only on the number $k$ of players, such that a random $k$-XOR game over an alphabet of size $n$ has $ω^* < 1$ with high probability when the number of clauses is above $C_k^{\text{unsat}} n$. 5. A lower bound of $Ω(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 $n$-th level of the sum-of-squares hierarchy is equivalent to brute-force enumeration of all possible solutions.

arXiv:1801.00821•ITCS•Jan 2, 2018•3 citations

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

Troy Lee, Bannink, T, Briët, J +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 1/m + (m-1)/m t^{1-t}. Secondly, for free XOR games, in which the input distribution is of product form, we show beta(G) >= beta^*(G)^{2^t} where beta(G) and beta^*(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-epsilon then the classical value is at least 1-O(sqrt{epsilon 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.

•Jan 1, 2019•1 citation

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•2 citations

A moment-based approach to the injective norm of random tensors

Stephane Dartois, Benjamin McKenna

In this paper, we present a technically simple method to establish upper bounds on the expected injective norm of real and complex random tensors. Our approach is somewhat analogous to the moment method in random matrix theory, and is based on a deterministic upper bound on the injective norm of a tensor which might be of independent interest. Compared to previous approaches to these problems (spin-glass methods, epsilon-net techniques, Sudakov-Fernique arguments, and PAC-Bayesian proofs), our method has the benefit of being nonasymptotic, relatively elementary, and applicable to non-Gaussian models. We illustrate our approach on various models of random tensors, recovering some previously known (and conjecturally tight) bounds with simpler arguments, and presenting new bounds, some of which are provably tight. From the perspective of statistical physics, our results yield rigorous estimates on the ground-state energy of real and complex, possibly non-Gaussian, spin glass models. From the perspective of quantum information, they establish bounds on the geometric entanglement of random bosonic states and of random states with bounded multipartite Schmidt rank, both in the thermodynamic limits as well as the regimes of large local dimensions.

math.PRCross-listedarXiv:2603.01342•Mar 3, 2026•0 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 consider quantum XOR games, defined in the work of Regev and Vidick [ACM Trans. Comput. Theory 7, 43 (2015)], from the perspective of unitary correlations defined in the work of Harris and Paulsen [Integr. Equations Oper. Theory 89, 125 (2017)]. We show that the winning bias of a quantum XOR game in the tensor product model (respectively, the commuting model) is equal to the norm of its associated linear functional on the unitary correlation set from the appropriate model. We show that Connes’ embedding problem has a positive answer if and only if every quantum XOR game has entanglement bias equal to the commuting bias. In particular, the embedding problem is equivalent to determining whether every quantum XOR game G with a winning strategy in the commuting model also has a winning strategy in the approximate finite-dimensional model.
We study the complexity of computing the commuting-operator value ω∗ω^*ω∗ of entangled XOR games with any number of players. We introduce necessary and sufficient criteria for an XOR game to have ω∗=1ω^* = 1ω∗=1, and use these criteria to derive the following results: 1. An algorithm for symmetric games that decides in polynomial time whether ω∗=1ω^* = 1ω∗=1 or ω∗<1ω^* < 1ω∗<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 ω∗<1ω^* < 1ω∗<1, where it takes doubly exponential time for the ncSoS algorithm to witness this (in contrast with our algorithm which runs in polynomial time). 3. A family of games achieving a bias difference 2(ω∗−ω)2(ω^* - ω)2(ω∗−ω) arbitrarily close to the maximum possible value of 111 (and as a consequence, achieving an unbounded bias ratio), answering an open question of Briët and Vidick. 4. Existence of an unsatisfiable phase for random (non-symmetric) XOR games: that is, we show that there exists a constant CkunsatC_k^{\text{unsat}}Ckunsat​ depending only on the number kkk of players, such that a random kkk-XOR game over an alphabet of size nnn has ω∗<1ω^* < 1ω∗<1 with high probability when the number of clauses is above CkunsatnC_k^{\text{unsat}} nCkunsat​n. 5. A lower bound of Ω(nlog⁡(n)/log⁡log⁡(n))Ω(n \log(n)/\log\log(n))Ω(nlog(n)/loglog(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 nnn-th level of the sum-of-squares hierarchy is equivalent to brute-force enumeration of all possible solutions.
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 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 1/m + (m-1)/m t^{1-t}. Secondly, for free XOR games, in which the input distribution is of product form, we show beta(G) >= beta^*(G)^{2^t} where beta(G) and beta^*(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-epsilon then the classical value is at least 1-O(sqrt{epsilon 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.
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 paper, we present a technically simple method to establish upper bounds on the expected injective norm of real and complex random tensors. Our approach is somewhat analogous to the moment method in random matrix theory, and is based on a deterministic upper bound on the injective norm of a tensor which might be of independent interest. Compared to previous approaches to these problems (spin-glass methods, epsilon-net techniques, Sudakov-Fernique arguments, and PAC-Bayesian proofs), our method has the benefit of being nonasymptotic, relatively elementary, and applicable to non-Gaussian models. We illustrate our approach on various models of random tensors, recovering some previously known (and conjecturally tight) bounds with simpler arguments, and presenting new bounds, some of which are provably tight. From the perspective of statistical physics, our results yield rigorous estimates on the ground-state energy of real and complex, possibly non-Gaussian, spin glass models. From the perspective of quantum information, they establish bounds on the geometric entanglement of random bosonic states and of random states with bounded multipartite Schmidt rank, both in the thermodynamic limits as well as the regimes of large local dimensions.