All tight correlation Bell inequalities have quantum violations

It is by now well-established that there exist non-local games for which the best entanglement-assisted performance is not better than the best classical performance. Here we show in contrast that any two-player XOR game, for which the corresponding Bell inequality is tight, has a quantum advantage. In geometric terms, this means that any correlation Bell inequality for which the classical and quantum maximum values coincide, does not define a facet, i.e. a face of maximum dimension, of the local Bell polytope. Indeed, using semidefinite programming duality, we prove upper bounds on the dimension of these faces, bounding it far away from the maximum. In the special case of non-local computation games, it had been shown before that they are not facet-defining; our result generalises and improves this. As a by-product of our analysis, we find a similar upper bound on the dimension of the faces of the convex body of quantum correlation matrices, showing that (except for the trivial ones expressing the non-negativity of probability) it does not have facets.

It is by now well-established that there exist non-local games for which the best entanglementassisted performance is not better than the best classical performance. Here we show in contrast that any two-player XOR game, for which the corresponding Bell inequality is tight, has a quantum advantage. In geometric terms, this means that any correlation Bell inequality for which the classical and quantum maximum values coincide, does not define a facet, i.e. a face of maximum dimension, of the local (Bell) polytope. Indeed, using semidefinite programming duality, we prove upper bounds on the dimension of these faces, bounding it far away from the maximum. In the special case of non-local computation games, it had been shown before that they are not facet-defining; our result generalises and improves this. As a by-product of our analysis, we find a similar upper bound on the dimension of the faces of the convex body of quantum correlation matrices, showing that (except for the trivial ones expressing the non-negativity of probability) it does not have facets.
Introduction.-In 1964, Bell [1] proved that some predictions of quantum theory regarding the correlations between distant events cannot be explained by any classical, i.e. local realistic theory. He derived a simple observable criterion that any classical theory must obey, and showed that particular measurements performed by two parties on a maximally entangled state could violate it. What we now call a Bell inequality was introduced in [2], as an upper bound on a single linear function of observable probabilities, i.e. an operational expectation value. This quantity has been experimentally measured [3,4] and shown to exceed the classical upper bound, and thereby elevated Bell's theorem to one of the deepest results in science, with a momentous impact on the way we understand the physical world. Quantum entanglement is responsible for these observed correlations and it is also the key ingredient in most of the quantum informational advantage in computation, communication, and sensing applications. Non-locality on its own has also been identified as a valuable resource in applications such as secure key distribution [5], certified randomness [6], reduced communication complexity [7], self-testing [8,9], and computation [10].
In order to advance in the fundamental understanding of the perplexing features of non-local correlations and their technological spin-offs, in the last decades important efforts have been devoted to their characterisation and exploitation (see [11] for a recent review). Tsirelson [12] computed the maximal violation of the CHSH inequality [2] attainable by quantum mechanics; later, Popescu and Rohrlich [13] (see also [14]) showed that although quantum correlations belong to the set of no-signalling correlations -they do not allow for instantaneous communication-, they do not attain the full strength allowed in principle by the no-signalling condition. These results reveal astonishing features of the convex sets of classical (C), quantum (Q) and no-signalling (N S) correlations, in particular the strict inclusion C ⊂ Q ⊂ N S. However, a lot remains to be understood, both at the concep-tual and mathematical level. For instance, the fact that Q ⊂ N S spurred the search for underlying operational principles that would single out quantum correlations among general no-signalling ones [15][16][17]. An approach that may assist in identifying such operationally defined principles and that may unveil new applications of non-locality is based on cooperative games of incomplete information [18], where two (or more) remote parties cooperate to win a probabilistic game against a referee. Indeed, an increased winning probability when the two parties use quantum resources (quantum entanglement) instead of classical ones (which includes shared randomness), is equivalent to the violation of a Bell inequality. Gill [19,20] asked the fruitful question whether all tight Bell inequalities are violated by quantum mechanics. Here, tightness means that the inequality cannot be expressed as a positive linear combination of other Bell inequalities, or in geometric terms, that the Bell inequality defines a facet of the polytope of classical correlations (see below). Linden et al. [21] (motivated by [22]) found the first class of two-player games, called non-local computation (NLC), that have no quantum advantage; the tightness of their Bell inequalities was posed as an open question in [21]. Almeida et al. [23] presented another case, the multi-party guess your neighbour's input (GYNI) game, shown to define a tight Bell inequality without quantum violation. Around the same time, it was understood that NLC games never define facets of the Bell polytope [24], though this result was never written up; a proof was eventually published by Ramanathan et al. [25].
In this Letter we prove that XOR games never define a facet of the Bell polytope (thus extending the result for NLC), answering Gill's question in the affirmative for the correlation polytope: all nontrivial tight correlation Bell inequalities have quantum violations. The remainder of this Letter is structured as follows: i) we first introduce the general formalism to describe the set of no-signalling, local classical and quantum correlations; ii) we briefly present the XOR FIG. 1. Three-dimensional schematic of a local correlation polytope and the convex body of quantum correlations, illustrating different types of regions where local and quantum boundaries coincide (corresponding to XOR games without quantum advantage): the green-striped region is a facet (face of dimension 2) of the Bell polytope, while the red line is a face (not a facet). Theorem 1 excludes the former, and hence implies that tight Bell inequalities (all facets) have quantum violations. Theorem 3 implies that all facets of the set of quantum correlations are trivial.
games and give general expressions for the winning probabilities under different locality scenarios; iii) we present our main theorem and the main ideas of its proof; iv) we extend our result to the quantum set of correlations, and conclude with a discussion and outlook. In the Supplementary Material we give the full proofs of our result, and present a simplified analysis in the particular case of NLC, reconstructing the argument alluded to in [24], and improving [25] by giving a bound on the dimension of the face.
No-signalling behaviours.-Consider a bipartite system where two parties, Alice and Bob, can perform measurements x ∈ [m A ] and y ∈ [m B ], respectively, obtaining the respective outcomes a and b, which are binary. The event of obtaining a and b when the local measurements x and y are performed, is given according a conditional probability p(a, b|x, y). In order to avoid instantaneous communication between the distant parties, forbidden by special relativity, this probability p must satisfy the no-signalling property, i.e. b p(a, b|x, y) = b p(a, b|x, y ) ∀a, x, y, y and analogously summing Alice's outcomes, which in physical terms excludes that any party signals to another party by their choice of input.
The set of all probabilities satisfying the above nosignalling property, called the no-signalling set (N S), constitutes a polytope of dimension D = m A m B + m A + m B [26]. In an attempt to explain phenomena locally, one may consider the existence of classical local (hidden) variables λ ∈ Λ, distributed according a probability law ρ(λ), such that the probability of an observed event can be written as p(a, b|x, y) = Λ dλρ(λ)p(a|x, λ)p(b|y, λ). The set of all probabilities of this form is called the local set, which is also a polytope, the so-called Bell or local polytope, of the same dimension as the no-signalling polytope [26], and denoted C. A polytope P can equivalently be defined as the convex hull of a finite set of points, P = conv{v j : j = 1, . . . , k}, or as a bounded intersection of finitely many closed half-spaces, P = { v : ∀i = 1, . . . , u i · v ≤ w i } [27]. A linear inequality for P is a u · v ≤ w that holds for all v ∈ P; in geometry, H = { v : u · v = w} is also called a supporting hyperplane of P. For a given supporting hyperplane, the set of point v ∈ P achieving the equality is called a face of the polytope P, F = P ∩ H. In the case of C, its corresponding inequalities are precisely the Bell inequalities. The faces of maximum dimension D − 1 are called facets; when dealing with C, the corresponding inequalities are called tight, or facet, Bell inequalities. Facet inequalities give the minimal characterisation of the polytope in terms of half-spaces in the sense that any other inequality that holds for the polytope can be written as a positive linear combination of the facet inequalities.
To state and prove our results, we use a convenient minimal parametrisation of the nosignalling polytopes. Any no-signalling behaviour p(a, b|x, y) is fully characterised by the first moments α x = (−1) a x,y = a,b (−1) a p(a, b|x, y) and β y = (−1) b x,y = a,b (−1) b p(a, b|x, y) (which, due to no-signaling property, are independent of y and x, resp.); and the correlators c xy = (−1) a+b x,y = a,b (−1) a+b p(a, b|x, y). Indeed, from these D = m A m B + m A + m B values we recover 4p(a, b|x, y) = 1 + (−1) a α x + (−1) b β y + (−1) a+b c xy . The polytope of N S distributions can hence be described by the tuple (|α , |β , C) ∈ R D , where |α = x α x |x ∈ R m A and |β = y β y |y ∈ R m B are the local moment vectors, and C = x,y c xy |x y| is the correlation matrix. The local, or Bell, polytope arises when restricting the strategies to convex combinations of local deterministic ones [28]. We use the subscript c to label such extremal classical strategies |α c ∈ {−1, 1} m A , |β c ∈ {−1, 1} m B , for which we note that c xy = α x β y , that is C = |α c β c |. The Bell polytope is then given by the convex hull (1) Finally, there are at least two definitions of sets of quantum behaviours that we have to consider: the most general setting is of a state |ψ in a Hilbert space H, together with Alice's and Bob's observablesâ x andb y , respectively, with eigenvalues 0 and 1 (i.e. they are projectors), and such that for all x, y, [â x ,b y ] = 0. Then, p(a, b|x, y) = ψ|â xby |ψ , and hence in the above parametrisation for N S, we have α x = ψ| (−1)â x |ψ , β x = ψ| (−1)b y |ψ and c xy = ψ| (−1)â x (−1)b y |ψ . The set of such behaviours is denoted Q com , the subscript standing for "commuting" strategies, and it is known to be a closed convex set contained in N S. The other, traditionally considered setting is that H = H A ⊗ H B is a tensor product Hilbert space, and thatâ x =â A x ⊗ 1 1 B andb y = 1 1 A ⊗b B y , with observablesâ A x on H A and b B y on H B . The corresponding set of behaviours is convex, but recently has been shown not to be closed [29] for m A , m B ≥ 5 [30], which is why we define Q ⊗ to be its closure. By definition, Q ⊗ ⊆ Q com , and while it is open whether the two sets are equal, this would be equivalent to Connes' long-standing Embedding Problem in the theory of von Neumann algebras [31,32]. The sets of quantum behaviours are convex sets, but unlike the classical and no-signalling sets, they are not polytopes: they have uncountably many extremal points, and part of their boundary is curved.
The study of non-local correlations is often carried out in a simplified scenario, the so-called correlation polytope, which is given by the set of correlators C (without including the local terms). The corresponding linear criteria that define the set of classical/local correlations C 0 are called correlation Bell inequalities [28,33,34]. The projection of quantum and no-signalling behaviours onto the correlator subspace are the quantum Q 0 and no-signalling N S 0 correlations respectively. Note that by Tsirelson's results [12], both Q com and Q ⊗ give rise to the same quantum correlator set, realized in fact with local Hilbert spaces H A and H B of bounded dimension.
XOR games.-Non-local games provide an intuitive operational setting in which to cast Bell inequalities, and relate those to the well-established field of interactive proofs in computer science. Here we will focus on the particular class of two-player XOR games [18], where the outcomes of each party are binary and the winning condition depends on the exclusive disjunction (XOR) of the outcomes. XOR games have a prominent role in non-locality: the paradigmatic CHSH inequality [2], the GHZ paradox [35] and NLC [21] can all be phrased as XOR games; and most importantly, they provide a characterisation of the correlation Bell polytope as will become apparent below. In an XOR game, see Fig. 2, the referee provides queries x ∈ [m A ] to one player (Alice) and y ∈ [m B ] to the second player (Bob), with the promise that queries are sampled from some prior probability distribution q(x, y) known to both players. In order to win the game, upon receiving their inputs x and y, Alice and Bob must produce a binary output a, b ∈ {0, 1}, respectively, such that a ⊕ b = f (x, y), where f is a given Boolean function also known to both players. The performance of Alice and Bob's strategy is quantified by the average winning probability where ξ = x,y q(x, y)(−1) f (x,y) c xy is the gain (or bias). Note that XOR games can always be won with at least probability 1 2 if Alice (or Bob) produces a random output independently of the input. Since q(x, y) and f (x, y) are a given, we can characterise the game by the so-called game matrix Φ = x,y (−1) f (x,y) q(x, y)|x y|, so that the gain can be written in terms of the correlation matrix as ξ = tr CΦ T . Every correlation Bell inequality, as it is based on a linear function of the correlators C, can be written in the form tr CΦ T ≤ ξ, and by rescaling if necessary, Φ can be chosen as the game matrix of a suitable XOR game. The optimal classical success probability can always be attained by extremal (i.e. deterministic) strategies |α c and |β c , with C = |α c β c |. Hence the gain of the local classical average winning probability can be written as: (3) In the Supplementary Material (A) we present various useful ways to write the quantum gain, which are employed in the proofs of our main results. It is easy to see that no-signalling behaviours allow to win XOR games with ω N S = 1 [36], and therefore any XOR game with ω c < 1 will correspond to a nontrivial Bell inequality, i.e. one that can potentially be violated quantumly. See the Supplementary Material (B) for further discussion of this point.
Observe finally that without loss of generality, we may restrict ourselves to XOR games with game matrices Φ that have no all-zero rows or columns. Indeed, because such a row or column of zeros imply that the marginal q(x) or q(y) are zero for some inputs, we can redefine the set of possible queries (decreasing m A or m B accordingly) to obtain an equivalent game without all-zero rows or columns in its game matrix. We refer to such games with q(x) > 0 and q(y) > 0 for all x ∈ [m A ] and y ∈ [m B ] as exhaustive games.
Results.-For a long time, it was implicitly assumed that if Alice and Bob use entangled strategies, they can attain a greater success probability than if they are limited to classical resources, for any nontrivial Bell inequality. As explained in the introduction, it took a while to find examples of nontrivial games that do not show any quantum advantage.
Here we show that XOR games (which characterise the correlation polytope) without quantum advantage never define a facet of the Bell polytope (full behaviours or correlations). This in turn implies that all (nontrivial) tight correlation Bell inequalities have quantum violations.
In [36] Ramanathan et al. derived a necessary and sufficient condition for a two-player XOR game to have no quantum advantage, which will turn out to be fundamental for the proof of our first result.
Theorem 1. If an exhaustive XOR game has no quantum advantage, the corresponding Bell inequality does not define a facet of the Bell polytope, nor of the correlation Bell polytope.
The proof -see the Supplementary Material (C) for full details -proceeds by bounding the dimension of the face F in the Bell polytope corresponding to the maximum classical bias ξ c of the given XOR game: The first ingredient is the characterisation of the maximum quantum bias ξ Q by semidefinite programming (SDP) [37], which by SDP duality leads to strong constraints on any optimal strategy via complementary slackness. From the assumption that ξ Q = ξ c , this leads to the second, and key, insight of the proof, namely that in any pair (|α c , |β c ) of optimal classical strategies, Alice's and Bob's local answers uniquely determine each other linearly: as we show in the proof, |β c = F |α c for a certain matrix F .
and its dimension can be upper bounded by that of In the case of the correlation polytope, the dimension is similarly Theorem 2. All nontrivial tight correlation Bell inequalities for bipartite systems with binary outcomes have a quantum violation.
Proof. Consider a (non-exhaustive) XOR game with M A (Alice) and M B (Bob) inputs. W.l.o.g. the first m A (m B ) inputs of Alice (Bob) have non-zero probability, the rest are never asked, so we can apply Theorem 1 to the reduced exhaustive game, which relates the optimal strategies for the indices x ∈ [m A ] and y ∈ [m B ], but leaves completely unconstrained the remaining ones. Hence, given a strategy by Alice |α c ⊕ |α c , Bob's strategy must be ( That is, XOR games with quantum equal to classical value do not define a facet of the full Bell polytope. Following the same argument for the correlation polytope leads to the codimension ∆ 0 ≥ M A (m B − m A ) + 1 2 m A (m A + 1), and this is greater than 1 unless m A = m B = 1, corresponding precisely to the trivial inequalities |c xy | ≤ 1.
In the Supplementary Material (D) we give a different proof of the above result for non-local computation games, showing also that the dimension bounds are asymptotically attained for nontrivial games.
From the proof of Theorem 1 we learn that the optimal extremal behaviours in an exhaustive XOR game with no quantum advantage are fully determined by the strategy of one of the parties. We will now show that this feature actually extends to all optimal quantum behaviours of arbitrary XOR games.
To understand the following theorem, we recall the definition of a face F ⊂ Q of a general compact convex set Q: namely, that whenever F p = t q + (1 − t) r, 0 < t < 1, then both q, r ∈ F. An exposed face is obtained as F = Q ∩ H with a supporting hyperplane H of Q; all exposed faces are faces of Q, but not vice versa. However, for polytopes every face is an exposed face [27,38]. Also, facets, and more generally maximal faces, are always exposed.
Note that this result explains the previous two theorems on the classical behaviours as being due to broader properties of the quantum sets.
Theorem 3. Nontrivial XOR games, or equivalently nontrivial correlation Bell inequalities, never define a facet of the quantum sets of behaviours Q com and Q ⊗ . As a consequence, the set Q 0 of quantum correlations has no nontrivial facets.
See the Supplementary Material (C) for the complete proof. To give the broad outline, we start with an exhaustive XOR game. The complementary slackness condition in the proof of Theorem 1 for the optimal quantum strategy leads to |β y = x F yx |α x , with the same matrix F as before. In other words, once again Alice's optimal quantum strategy uniquely determines Bob's, and vice versa.
Thus, we get for an optimal quantum correlation matrix C xy = α x |β y = x F yx α x |α x , and hence the dimension of their affine span is bounded by that of the Gram matrices [ α x |α x ] xx , with dimension 1 2 m A (m A − 1), leading to the same dimension bound as in the proof of Theorem 1. Non-exhaustive XOR games are treated as in the proof of Theorem 2.
Discussion and outlook.-We have shown that a two-party correlation Bell inequality (XOR game) with no quantum violation (quantum advantage) cannot define a facet of the Bell polytope. The contrapositive of this statement has deep physical implications: all tight correlation Bell inequalities exhibit a quantum violation. In fact, we have proven lower bounds on the codimension of the defined face (increasing with the number of inputs). As a consequence, when the codimension is lower bounded by ∆ > 1, not only all tight correlation inequalities will have quantum violations, but also those corresponding to faces F with dim F ≥ D − ∆.
On the way, we have proved that this in fact is due to a broader property of the convex set of quantum correlations, namely that it does not have any nontrivial facets, only lower-dimensional faces. It remains to be seen what the physical meaning of this curious geometric observation is.
Our results appear very much tied to the world of two-player, binary outcome XOR games. This leaves open the questions whether XOR games for more than two players can define common facets of the quantum and classical sets (note that GYNI defines such a facet, but it is not an XOR game), and whether for two players there are any tight Bell inequalities at all without quantum violations. It might be possible to extend our results at least two two-players MOD-q games where each player has a q-ary outcome.
Acknowledgements.-We thank Mafalda Almeida, Nicolas Brunner and Paul Skrzypczyk for discussions on non-local computation, and Dardo Goyeneche for rekindling our interest in Bell inequalities without quantum violation. Support from the Spanish MINECO, project FIS2016-80681-P with the support of AEI/FEDER funds, and from the Generalitat de Catalunya, project CIRIT 2017-SGR-1127, is acknowledged. *

A. Quantum bias
If Alice and Bob use quantum resources, i.e. a (possibly) entangled state |ψ ∈ H, with with observableŝ a x andb y depending on their respective inputs x and y, to produce their measurement outcomes a and b, then, using the expression given in the main text for the quantum correlations c xy , the quantum gain can be written as with |α x = (−1)â x |ψ and |β y = (−1)b y |ψ unit vectors in H. Vice versa, given any set of unit vectors in any complex Hilbert space, there exists an equivalent set, i.e. with the same pairwise inner products α x | β y , of the above form, on a tensor product Hilbert space [12]. It will prove convenient to define the following states on an extended vector space, With this, the expression for the optimal quantum gain reads which resembles the expression (3) for its classical counterpart.

B. XOR games can always be won using no-signalling behaviours
It is easy to understand the previous observation of ω N S = 1 for every XOR game, by realising that an XOR game can always be won with certainty using a behaviour that outputs uniformly random local bits a and b, and so is evidently no-signalling: This behaviour has |α = |β = 0, but its correlator term is remarkably c xy = (−1) f (x,y) , i.e. an arbitrary ±1-matrix. In geometric terms, this says that N S 0 is the ∞ unit ball (aka hypercube), in other words N S 0 is entirely characterised by the inequalities −1 ≤ c xy ≤ 1. These are indeed the trivial Bell inequalities, since they follow from the non-negativity of the probabilities p(a, b|x, y).
To back up the definite article in the previous statement, it is in fact known that they not only define facets of N S 0 , but also of C 0 and thus of Q 0 ; namely, for every pair (x 0 , y 0 ), the behaviour C 0 = |x 0 y 0 | is in C 0 , and so is an entire sufficiently small neighbourhood of C 0 of correlators C in the supporting hyperplane H = {C : C x0y0 = 1} (and analogously for −C 0 ). Again, this is easy to see: consider local classical strategies |α c = x α x |x and |β c = y β y |y with α x0 = β y0 = 1, so that we can write |α c = |x 0 + |α and |β c = |y 0 + |β . Then, By taking convex combinations over |β = |y 1 + y =y0,y1 β y |y , with uniformly random β y = ±1 (y = y 0 , y 1 ) and uniformly random |α , we annihilate all terms except one, showing that C 0 + |x 0 y 1 | ∈ C 0 , for = ±1. Similarly, we find C 0 + |x 1 y 0 | ∈ C 0 . Finally, by taking convex combinations over |α = x =x0 α x |x and |β = α x1 |y 1 + y =y0,y1 β y |y , with uniformly random |α and uniformly random β y = ±1 (y = y 0 , y 1 ), we get that C 0 + |x 1 y 1 | ∈ C 0 . The convex hull of all these points, a hyperoctahedron, contains a small neighbourhood of C 0 in the hyperplane H.

C. Proofs
Here, we give the complete proofs of Theorems 1 and 3 in the main text.
Proof of Theorem 1. Our aim is to bound the dimension of the face F defined by the maximum classical bias ξ of a given XOR game: In particular, we want to show that its dimension dim F is strictly lower than the dimension of a facet, D−1, or equivalently that the codimension of the face in the classical polytope is ∆ = D − dim F > 1. We start by considering the consequences of assuming no quantum advantage, i.e. ξ c = ξ Q . The optimal quantum gain can be written as ξ Q = max C tr CΦ T , where C = x,y α x |β y |x y| is the quantum correlator matrix, which is fully characterised [12] by the inner products of an arbitrary set of unit vectors in R m A +m B . In terms of the characterisation in (5), |α x = x|α Q = (−1)â x |ψ , and analogously for Bob's strategy. In order to write this optimisation problem as a semidefinite program [18,37] we define the following Gram matrix with R xx = α x |α x and S yy = β y |β y . An equivalent characterisation of a Gram matrix of unit vectors isQ 0 andQ ii = 1 for all i ∈ [m A + m B ], and consequently we can write the maximum quantum gain as: Consider now the Lagrangian, where t i ∈ R are the Lagrange multipliers. Therefore, and thus the original SDP (11) can be written in its dual form, This holds because the primal and dual SDPs satisfy the condition for strong duality. From the above construction it follows that trQΦ ≤ ξ Q ≤ i t i for any pair of primal and dual feasible solutions. Furthermore, by strong duality, the maximum primal value ξ Q equals the solution of the dual (14). That is, the optimal value is attained if and only if trQΦ = i t i , or equivalently if the spurious term in the Lagrangian vanishes: tr Q i t i |i i| −Φ = 0 (complementary slackness). Note that by the form of the dual problem (14), the t i are non-negative numbers; indeed, by our assumption that Φ has no all-zero rows or columns, we even can conclude that all t i > 0. Now, our hypothesis of no quantum advantage implies that ξ Q coincides with its classical counterpart ξ c = β c |Φ|α c = tr |s s|Φ T , where we have defined |s = |α c ⊕ |β c . In other words, ξ Q can be reached with a classical correlation matrixQ = |s s|. Letting Γ = i t i |i i| = 1 2 Σ ⊕ Λ 0, where Σ and Λ are diagonal positive definite matrices, the slackness condition reads tr (Γ −Φ) |s s| = 0, which in turn implies that (Γ −Φ) |s = 0, since both Γ −Φ and |s s| are positive semidefinite. Therefore, Σ|α c = Φ|β c and Λ|β c = Φ T |α c , or equivalently This means that once Alice's optimal strategy is fixed, Bob's best strategy is uniquely determined by her choice and vice versa. Assuming w.l.o.g. m A ≤ m B , the dimension of the face F generated by such strategies is then where aff denotes the affine span, and where the second term in the dimension comes from the fact that the affine span of the matrices |α c α c | consists precisely of the real symmetric matrices with 1's along the diagonal. This leads to a codimension of the face in the Bell polytope of ∆ ≥ m B + m A m B − 1 2 m A (m A − 1) > 1. Similarly, we can bound the codimension of this facet in the correlation polytope, which is solely generated by the correlators |α c α c | F T , leading to ∆ 0 ≥ m A m B − 1 2 m A (m A − 1) > 1, unless m A = m B = 1, which is a trivial case.
Therefore, we see that the defined face is not a facet in either setting.
Proof of Theorem 3. Starting from the definition |q = |α Q ⊕ |β Q , we can write the quantum bias as ξ Q = Q β|Φ|α Q = q|1 1 ⊗Φ|q . It is straightforward to check, following the steps in the proof of Theorem 1, that the complementary slackness condition translates into (1 1 ⊗ Γ − 1 1 ⊗Φ) |q = 0, which in the case of exhaustive games leads to or equivalently |β y = x F yx |α x , with the same matrix F as in the proof of Theorem 1. This shows that Bob's optimal quantum strategy (as encoded in the vectors {|β y }) is fully determined by Alice optimal strategy (the vectors {|α x }).
In order to bound the dimensionality of the behaviours that determine the corresponding face we note that c xy = α x |β y = x F yx α x |α x . The dimension of the affine span of the optimal behaviours C is clearly bounded by that of the Gram matrices [ α x |α x ] xx , which we recall to be real symmetric matrices with diagonal elements α x |α x = 1, thus the dimension is bounded by 1 2 m A (m A −1) and therefore the codimension of the face of Q 0 is bounded by the classical bound derived in Theorem 1. To get the same for Q com and Q ⊗ , we need to control also the marginal parts of the behaviours, which can be written as α x = ψ|α x and β y = ψ|β y = x F yx α x . In other words, |β = F |α is fully determined by |α , just as we had seen for the deterministic classical strategies, hence only m A is added to the dimension of the face.
For non-exhaustive XOR games we then proceed as in Theorem 2. In particular, XOR games do not define facets of either Q com or Q ⊗ . In the quantum correlation set Q 0 , the XOR games that can define facets have only one input each for Alice and Bob, and that leaves only |c xy | ≤ 1, which are indeed facet defining inequalities, but they are trivial, as they correspond to the non-negativity of probability.
To arrive at the conclusion for Q 0 having no facets at all, note that any purported facet is exposed, so it has to be defined by an XOR game, and for those we just showed that only the trivial inequalities define facets.

D. Dimension bound for non-local computation and (asymptotic) attainability
In [21], Linden et al. introduced the cooperative games of non-local computation (NLC) and showed that quantum strategies provide no advantage over classical ones, although stronger forms of nonsignaling correlations allowed perfect success. In the problem of non-local computation Alice and Bob need to collaborate in order to compute to a boolean function f (z) of a string of n bits, z = z 1 z 2 . . . z n , without communicating with each other during the computation, and without individually learning anything about the input string z. The inputs are promised to be given with an arbitrary probability distributioñ q(z) known to Alice and Bob and are split in two correlated signals x = x 1 x 2 . . . x n and y = y 1 y 2 . . . y n so that z = x ⊕ y (meaning x i ⊕ y i = z i for all i = 1, . . . , n) which are given to Alice and Bob respectively. In order to enforce that Alice and Bob do not learn anything about z, it is necessary that p(x i = 0) = p(x i = 1) = 1 2 for all x i and idem for y i . It is hence clear that NLC is a particular instance of an XOR game with q(x, y) = 1 2 nq (x ⊕ y) and a ⊕ b = f (z = x ⊕ y).The corresponding game matrix is given by Φ N LC = x,y (−1) f (x⊕y)q (x ⊕ y)|x y|.
In [21], it is proved that the game matrix is diagonal in the Fourier (Hadamard) basis, |ũ = x (−1) u·x |x , where u · x is the inner product modulo 2 of the bit strings u and x. As a consequence, ξ Q ≤ 2 n−1 Φ N LC := ξ * , where · denotes the operator norm. Moreover, it was shown that the upper bound is attained by a classical local strategy with ξ c = ξ * , i.e. by a suitably chosen pair of vectors |α c , |β c , and one concludes that NLC games present no quantum advantage. Since the inequality ξ ≤ ξ * (18) holds for any classical local and quantum average success probability, this Bell inequality is neither violated by classical physics nor quantum mechanics and thus we have that the Bell polytope and the quantum set share a region of their boundary. The result stated below as Corollary 4 (because it follows from Theorem 1) was first proved in [25]. It says that an NLC Bell inequality is never tight for any number of inputs. Here we present an alternative proof, based on directly bounding the dimension of the face defined by the Bell inequality. This is a reconstruction of the earlier unpublished proof referenced in [24].
Corollary 4. For any number n of input bits, an NLC game never defines a facet of the Bell polytope, nor of the correlation polytope.
Proof. As m A = m B = 2 n , the dimension of the Bell polytope is D = 4 n + 2 n+1 . In order to see that the NLC Bell inequality does not define a facet, we show that the dimension of the affine space generated by the optimal classical strategies is strictly smaller than D − 1. The local classical success probability is bounded by ω * = 1 2 (1 + ξ * ), which only depends on λ = Φ N LC . Let |u 0 be a corresponding eigenvector of ±λ. Now, ξ achieves the maximum value when |α c and |β c are both proportional to |u 0 , i.e. |α c = ±|β c = ±|u 0 . Thus, we consider the eigenspaces of the two eigenvalues ±λ, which we denote by Eig(λ) and Eig(−λ), respectively. There are two cases: either |α c = |β c ∈ Eig(λ) or |α c = −|β c ∈ Eig(−λ). These we can write in a single equation as |β c = F |α c , with F = 2Π λ − 1 1 and Π λ the projector onto the eigenspace Eig(λ). Therefore, the face F N LC that these optimal strategies define, is contained in the following affine subspace: whose dimension we have already bounded before, in the proof of Theorem 1, Eq. (16), and so dim F N LC ≤ 2 n + 2 n−1 (2 n − 1), (20) and codimension ∆ ≥ 2 n + 2 n−1 (2 n + 1) > 1. For the correlation polytope, we get similarly that the dimension of the face is upper bounded by 2 n−1 (2 n − 1), resulting in a bound of ∆ C ≥ 2 n−1 (2 n + 1) > 1 for the codimension of the face.
The bound Eq. (20) is achievable with equality for Φ = 2 −n 1 1; this describes a game where x is uniformly distributed, and y = x, and to win, Alice and Bob have to output the same bit a = b. This is evidently possible with probability 1, using any local strategy |α c for Alice and |β c = |α c for Bob, i.e. α x = β x for all x ∈ {0, 1} n , so that F = 1 1 above. Thus, the resulting face attains Eq. (20) with equality; likewise, the corresponding face in the correlation polytope has dimension dim F C = 2 n−1 (2 n − 1). Of course, one might object that this game has winning probability ω c = 1, equal to the no-signalling bound, so in some sense it is trivial, but it is worth noting that the Bell inequality is not a trivial one (|c xy | ≤ 1).
We can get a slightly better bound, sometimes much better depending on the game matrix Φ, by exploiting the fact that the latter is Hermitian and that the optimal local strategies must lie either in Eig(λ) or in Eig(−λ); denote their dimensions by k and , respectively, so that k + ≤ 2 n . In the following we can discard the extreme cases k = 2 n and = 2 n , since those correspond to Φ ∝ 1 1, which we have just discussed.
Among the pairs with k + ≤ 2 n , and -as explained before -excluding Φ ∝ 1 1, i.e. imposing k, < 2 n , the r.h.s. is maximised at k = 2 n − 1, = 1, for which values it reproduces the previously obtained bound 2 n + 2 n−1 (2 n − 1). Note that this restricts the game severely, since the game matrix has only the two possible eigenvalues ±λ, w.l.o.g. with multiplicities 2 n − 1 and 1, respectively: this means Φ = λF = λ(2Π λ − 1 1) and 1 1 − Π λ has rank 1. In all other cases, Eq. (24) is strictly better than the bound (20). For the correlation polytope, we get similarly that the dimension of the face is upper bounded by k(k+1) 2 + ( +1) 2 − 1 ≤ 2 n−1 (2 n − 1). These bounds can be attained, if not exactly, then asymptotically, as we will show on the example k = 2 n − 1, = 1. By the analysis of [24], this essentially leaves only the game matrix Φ = λ(1 1 − 2 −n J) − λ2 −n J, where J = |1 1 | is the all-one-matrix, and |1 = 2 n x=1 |x . Since the sum of the absolute values of the entries of Φ has be to 1, this fixes the value of λ = 1 3·2 n −4 , corresponding to the winning probability (classical and quantum) ω * = 1 2 1 + 2 n 3·2 n −4 ≈ 2 3 < 1 for n ≥ 2. I.e. the game, and with it its Bell inequality, is nontrivial. The game can be described as follows: x and y are jointly distributed according to q(x, y) > 0, and to win, Alice and Bob have to output the same bit a = b if x = y, and different bits a = b if x = y. The optimal classical local strategies are on the one hand |α c = |1 = − |β c (corresponding to the single negative eigenvalue −λ of Φ), and |α c = |β c ⊥ |1 (corresponding to the (2 n − 1)-fold eigenvalue λ). The latter means that |α c = |β c has to have exactly 2 n−1 entries +1 and 2 n−1 entries −1, of which there are 2 n 2 n−1 . With this, we determine the dimension of the corresponding face of the correlation Bell polytope as dim F = 1 + dim aff |α c α c | : |α c ⊥ (|0 + |1 ) ⊗n , where it is understood that |α c ∈ {±1} 2 n . The affine span on the r.h.s. is precisely the space G 0 of real symmetric matrices with 1's along the diagonal and with the property that all row and column sums are 0. By parameter counting, it is straightforward to see that dim G 0 = 2 n−1 (2 n − 3), and so we get dim F =