Non-local Games Research Articles

Bell Inequalities and Group Symmetry

Recently the method based on irreducible representations of finite groups has been proposed as a tool for investigating the more sophisticated versions of Bell inequalities (V. Ugǔr Gűney, M. Hillery, Phys. Rev. A90, 062121 ([2014]) and Phys. Rev. A91, 052110 ([2015])). In the present paper an example based on the symmetry group S4 is considered. The Bell inequality violation due to the symmetry properties of regular tetrahedron is described. A nonlocal game based on the inequalities derived is described and it is shown that the violation of Bell inequality implies that the quantum strategies outperform their classical counterparts.

Tightness of correlation inequalities with no quantum violation

We study the faces of the set of quantum correlations, i.e., the Bell and noncontextuality inequalities without any quantum violation. First, we investigate the question whether every proper (tight) Bell inequality for two parties, other than the trivial ones from positivity, normalization and no-signaling can be violated by quantum correlations, i.e., whether the classical Bell polytope or the smaller correlation polytope share any facets with their respective quantum sets. To do this, we develop a recently derived bound on the quantum value of linear games based on the norms of game matrices to give a simple sufficient condition to identify linear games with no quantum advantage. Additionally we show how this bound can be extended to the general class of unique games, illustrating it for the case of three outcomes. We then show as a main result that the paradigmatic examples of correlation Bell inequalities with no quantum violation, namely the non-local computation games do not constitute tight Bell inequalities, not even for the correlation polytope. We also extend this to an arbitrary prime number of outcomes for a specific class of these games. We then study the faces in the simplest CHSH Bell scenario of binary dichotomic measurements, and identify edges in the set of quantum correlations in this scenario. Finally, we relate the non-contextual polytope of single-party correlation inequalities with the cut polytope $CUT(\nabla G)$, where $G$ denotes the compatibility graph of observables in the contextuality scenario and $\nabla G$ denotes the suspension graph of $G$. We observe that there exist tight non-contextuality inequalities with no quantum violation, and furthermore that this set of inequalities is beyond those implied by the Consistent Exclusivity principle.

Perfect embezzlement of entanglement

Van Dam and Hayden introduced a concept commonly referred to as embezzlement, where, for any entangled quantum state ϕ, there is an entangled catalyst state ψ, from which a high fidelity approximation of ϕ ⊗ ψ can be produced using only local operations. We investigate a version of this where the embezzlement is perfect (i.e., the fidelity is 1). We prove that perfect embezzlement is impossible in a tensor product framework, even with infinite-dimensional Hilbert spaces and infinite entanglement entropy. Then we prove that perfect embezzlement is possible in a commuting operator framework. We prove this using the theory of C*-algebras and we also provide an explicit construction. Next, we apply our results to analyze perfect versions of a nonlocal game introduced by Regev and Vidick. Finally, we analyze the structure of perfect embezzlement protocols in the commuting operator model, showing that they require infinite-dimensional Hilbert spaces.

Violation of Bell inequalities from S_4 symmetry: the three orbits case

The recently proposed (Güney and Hillery in Phys Rev A 90:062121, 2014; Phys Rev A 91:052110, 2015) group theoretical approach to the problem of violating the Bell inequalities is applied to S_4 group. The Bell inequalities based on the choice of three orbits in the representation space corresponding to standard representation of S_4 are derived and their violation is described. The corresponding nonlocal games are analyzed.

Reducing the number of questions in nonlocal games

We show how a vector-valued version of Schechtman’s empirical method can be used to reduce the number of questions in a nonlocal game G while preserving the quotient β∗(G)/β(G) of the quantum over the classical bias. We apply our method to the Khot-Vishnoi game, with exponentially many questions per player, to produce a family of games indexed in n with polynomially many (N ≈ n8) questions and n answers per player so that the ratio of the quantum over the classical bias is Ω(n/log2 n).

The structure of nearly-optimal quantum strategies for the non-local XOR games

We consider the infinite family of non-local games CHSH(n). We consider nearly-optimal strategies for CHSH(n). We introduce a notion of approximate homomorphism for strategies and show that any nearly-optimal strategy for CHSH(n) is approximately homomorphic to the canonical optimal CHSH(n) strategy. This demonstrates that any nearly-optimal CHSH(n) strategy must approximately contain the algebraic structure of the canonical optimal strategy.

Publisher's Note: Nonlocal games and optimal steering at the boundary of the quantum set [Phys. Rev. A94, 022116 (2016)

Received 13 September 2016DOI:https://doi.org/10.1103/PhysRevA.94.039902©2016 American Physical SocietyPhysics Subject Headings (PhySH)Research AreasNonlocalityQuantum entanglementGeneral Physics

Tight bound on the classical value of generalized Clauser-Horne-Shimony-Holt games

Non-local games are an important part of quantum information processing. Recently there has been an increased interest in generalizing non-local games beyond the basic setup by considering games with multiple parties and/or with large alphabet inputs and outputs. In this paper we consider another interesting generalization -- games with non-uniform inputs. Here we derive a tight upper bound for the classical winning probability for a specific family of non-local games with non-uniform input distribution, known as $\mathrm{CHSH}_q(p)$ which was introduced recently in the context of relativistic bit-commitment protocols by [Chakraborty et. al., PRL 115, 250501, 2015].

Nonlocal games and optimal steering at the boundary of the quantum set

The boundary between classical and quantum correlations is well characterised by linear constraints called Bell inequalities. It is much harder to characterise the boundary of the quantum set itself in the space of no-signaling correlations. For the points on the quantum boundary that violate maximally some Bell inequalities, Oppenheim and Wehner [Science 330, 1072 (2010)] pointed out a complex property: the optimal measurements of Alice steer Bob's local state to the eigenstate of an effective operator corresponding to its maximal eigenvalue. This effective operator is the linear combination of Bob's local operators induced by the coefficients of the Bell inequality, and it can be interpreted as defining a fine-grained uncertainty relation. It is natural to ask whether the same property holds for other points on the quantum boundary, using the Bell expression that defines the tangent hyperplane at each point. We prove that this is indeed the case for a large set of points, including some that were believed to provide counterexamples. The price to pay is to acknowledge that the Oppenheim-Wehner criterion does not respect equivalence under the no-signaling constraint: for each point, one has to look for specific forms of writing the Bell expressions.

Violation of Bell inequality based onS4symmetry

In two recent papers (Phys. Rev. A90 (2014), 062121 and Phys. Rev. A91 (2015), 052110) an interesting method of analyzing the violation of Bell inequalities has been proposed which is based on the theory of finite group representations. We apply here this method to more complicated example of $S_4$ symmetry. We show how the Bell inequality can be related to the symmetries of regular tetrahedron. By choosing the orbits of threedimensional representation of $S_4$ determined by the geometry of tetrahedron we find that the Bell inequality under consideration is violated in quantum theory. The corresponding nonlocal game is analyzed.

Linear conic formulations for two-party correlations and values of nonlocal games

In this work we study the sets of two-party correlations generated from a Bell scenario involving two spatially separated systems with respect to various physical models. We show that the sets of classical, quantum, no-signaling and unrestricted correlations can be expressed as projections of affine sections of appropriate convex cones. As a by-product, we identify a spectrahedral outer approximation to the set of quantum correlations which is contained in the first level of the Navascu\'es, Pironio and Ac\'in (NPA) hierarchy and also a sufficient condition for the set of quantum correlations to be closed. Furthermore, by our conic formulations, the value of a nonlocal game over the sets of classical, quantum, no-signaling and unrestricted correlations can be cast as a linear conic program. This allows us to show that a semidefinite programming upper bound to the classical value of a nonlocal game introduced by Feige and Lov\'asz is in fact an upper bound to the quantum value of the game and moreover, it is at least as strong as optimizing over the first level of the NPA hierarchy. Lastly, we show that deciding the existence of a perfect quantum (resp. classical) strategy is equivalent to deciding the feasibility of a linear conic program over the cone of completely positive semidefinite matrices (resp. completely positive matrices). By specializing the results to synchronous nonlocal games, we recover the conic formulations for various quantum and classical graph parameters that were recently derived in the literature.

No Quantum Realization of Extremal No-Signaling Boxes.

The study of quantum correlations is important for fundamental reasons as well as for quantum communication and information processing tasks. On the one hand, it is of tremendous interest to derive the correlations produced by measurements on separated composite quantum systems from within the set of all correlations obeying the no-signaling principle of relativity, by means of information-theoretic principles. On the other hand, an important ongoing research program concerns the formulation of device-independent cryptographic protocols based on quantum nonlocal correlations for the generation of secure keys, and the amplification and expansion of random bits against general no-signaling adversaries. In both these research programs, a fundamental question arises: Can any measurements on quantum states realize the correlations present in pure extremal no-signaling boxes? Here, we answer this question in full generality showing that no nontrivial (not local realistic) extremal boxes of general no-signaling theories can be realized in quantum theory. We then explore some important consequences of this fact.

Extended non-local games and monogamy-of-entanglement games.

We study a generalization of non-local games-which we call extended non-local games-in which the players, Alice and Bob, initially share a tripartite quantum state with the referee. In such games, the winning conditions for Alice and Bob may depend on the outcomes of measurements made by the referee, on its part of the shared quantum state, in addition to Alice and Bob's answers to randomly selected questions. Our study of this class of games was inspired by the monogamy-of-entanglement games introduced by Tomamichel, Fehr, Kaniewski and Wehner, which they also generalize. We prove that a natural extension of the Navascués-Pironio-Acín hierarchy of semidefinite programmes converges to the optimal commuting measurement value of extended non-local games, and we prove two extensions of results of Tomamichel et al.concerning monogamy-of-entanglement games.

Optimal bounds for parity-oblivious random access codes

Random access coding is an information task that has been extensively studied and found many applications in quantum information. In this scenario, Alice receives an n-bit string x, and wishes to encode x into a quantum state , such that Bob, when receiving the state , can choose any bit and recover the input bit xi with high probability. Here we study two variants: parity-oblivious random access codes (RACs), where we impose the cryptographic property that Bob cannot infer any information about the parity of any subset of bits of the input apart from the single bits xi; and even-parity-oblivious RACs, where Bob cannot infer any information about the parity of any even-size subset of bits of the input. In this paper, we provide the optimal bounds for parity-oblivious quantum RACs and show that they are asymptotically better than the optimal classical ones. Our results provide a large non-contextuality inequality violation and resolve the main open problem in a work of Spekkens et al (2009 Phys. Rev. Lett.102 010401). Second, we provide the optimal bounds for even-parity-oblivious RACs by proving their equivalence to a non-local game and by providing tight bounds for the success probability of the non-local game via semidefinite programming. In the case of even-parity-oblivious RACs, the cryptographic property holds also in the device independent model.

Self-testing in parallel

Self-testing allows us to determine, through classical interaction only, whether some players in a non-local game share particular quantum states. Most work on self-testing has concentrated on developing tests for small states like one pair of maximally entangled qubits, or on tests where there is a separate player for each qubit, as in a graph state. Here we consider the case of testing many maximally entangled pairs of qubits shared between two players. Previously such a test was shown where testing is sequential, i.e., one pair is tested at a time. Here we consider the parallel case where all pairs are tested simultaneously, giving considerably more power to dishonest players. We derive sufficient conditions for a self-test for many maximally entangled pairs of qubits shared between two players and also two constructions for self-tests where all pairs are tested simultaneously.

Generalized xor games withdoutcomes and the task of nonlocal computation

A natural generalization of the binary XOR games to the class of XOR-d games with $d > 2$ outcomes is studied. We propose an algebraic bound to the quantum value of these games and use it to derive several interesting properties of these games. As an example, we re-derive in a simple manner a recently discovered bound on the quantum value of the CHSH-d game for prime $d$. It is shown that no total function XOR-d game with uniform inputs can be a pseudo-telepathy game, there exists a quantum strategy to win the game only when there is a classical strategy also. We then study the principle of lack of quantum advantage in the distributed non-local computation of binary functions which is a well-known information-theoretic principle designed to pick out quantum correlations from amongst general no-signaling ones. We prove a large-alphabet generalization of this principle, showing that quantum theory provides no advantage in the task of non-local distributed computation of a restricted class of functions with $d$ outcomes for prime $d$, while general no-signaling boxes do. Finally, we consider the question whether there exist two-party tight Bell inequalities with no quantum advantage, and show that the binary non-local computation game inequalities for the restricted class of functions are not facet defining for any number of inputs.

Optimality of semiquantum nonlocality in the presence of high inconclusive rates

Quantum nonlocality is a counterintuitive phenomenon that lies beyond the purview of causal influences. Recently, Bell inequalities have been generalized to the case of quantum inputs, leading to a powerful family of semi-quantum Bell inequalities that are capable of detecting any entangled state. Here, we focus on a different problem and investigate how the local-indistinguishability of quantum inputs and postselection may affect the requirements to detect semi-quantum nonlocality. To this end, we consider a semi-quantum nonlocal game based on locally-indistinguishable qubit inputs and derive its postselected local and quantum bounds by using a novel connection to the local-distinguishability of quantum states. Interestingly, we find that the postselected local bound is independent of the measurement efficiency and that the Bell violation increases with lower measurement efficiencies.

Quantum homomorphisms

A homomorphism from a graph X to a graph Y is an adjacency preserving map f:V(X)→V(Y). We consider a nonlocal game in which Alice and Bob are trying to convince a verifier with certainty that a graph X admits a homomorphism to Y. This is a generalization of the well-studied graph coloring game. Via systematic study of quantum homomorphisms we prove new results for graph coloring. Most importantly, we show that the Lovász theta number of the complement is a lower bound on the quantum chromatic number, the latter of which is not known to be computable. We also show that some of our newly introduced graph parameters, namely quantum independence and clique numbers, can differ from their classical counterparts while others, namely quantum odd girth, cannot. Finally, we show that quantum homomorphisms closely relate to zero-error channel capacity. In particular, we use quantum homomorphisms to construct graphs for which entanglement-assistance increases their one-shot zero-error capacity.

Survey on nonlocal games and operator space theory

This review article is concerned with a recently uncovered connection between operator spaces, a noncommutative extension of Banach spaces, and quantum nonlocality, a striking phenomenon which underlies many of the applications of quantum mechanics to information theory, cryptography, and algorithms. Using the framework of nonlocal games, we relate measures of the nonlocality of quantum mechanics to certain norms in the Banach and operator space categories. We survey recent results that exploit this connection to derive large violations of Bell inequalities, study the complexity of the classical and quantum values of games and their relation to Grothendieck inequalities, and quantify the nonlocality of different classes of entangled states.

Parallel repetition and concentration for (sub-)no-signalling games via a flexible constrained de Finetti reduction

We use a recently discovered constrained de Finetti reduction (aka "Post-Selection Lemma") to study the parallel repetition of multi-player non-local games under no-signalling strategies. Since the technique allows us to reduce general strategies to independent plays, we obtain parallel repetition (corresponding to winning all rounds) in the same way as exponential concentration of the probability to win a fraction larger than the value of the game. Our proof technique leads us naturally to a relaxation of no-signalling (NS) strategies, which we dub sub-no-signalling (SNOS). While for two players the two concepts coincide, they differ for three or more players. Our results are most complete and satisfying for arbitrary number of sub-no-signalling players, where we get universal parallel repetition and concentration for any game, while the no-signalling case is obtained as a corollary, but only for games with "full support".