Related papers: Tsirelson's problem and an embedding theorem for g…
We study no-signalling correlations over Cantor spaces, placing the product of infinitely many copies of a finite non-local game in a unified general setup. We define the subclasses of local, quantum spatial, approximately quantum and…
Nonlocal games are a foundational tool for understanding entanglement and constructing quantum protocols in settings with multiple spatially separated quantum devices. In this work, we continue the study initiated by Kalai et al. (STOC '23)…
The aim of this paper is to indicate possible applications of operator systems in qualitative description of varoius scenarios while studying non-locality. To this end we study in details the notion of generalized non-commuting cube.…
First, we consider the problem of deciding whether a nonlocal game admits a perfect entangled strategy that uses projective measurements on a maximally entangled shared state. Via a polynomial-time Karp reduction, we show that independent…
We study tensor norms over Banach spaces and their relations to quantum information theory, in particular their connection with two-prover games. We consider a version of the Hilbertian tensor norm $\gamma_2$ and its dual $\gamma_2^*$ that…
The set $\mathcal{Q}$ of quantum correlations is the collection of all possible probability distributions on measurement outcomes achievable by space-like separated parties sharing a quantum state. Since the original work of Tsirelson…
In this paper, we consider a class of $n$-person noncooperative games, where the utility function of every player is given by a homogeneous polynomial defined by the payoff tensor of that player, which is a natural extension of the bimatrix…
Games are natural models for multi-agent machine learning settings, such as generative adversarial networks (GANs). The desirable outcomes from algorithmic interactions in these games are encoded as game theoretic equilibrium concepts, e.g.…
Completely determining the relationship between quantum correlation sets is a long-standing open problem, known as Tsirelson's problem. Following recent progress by Slofstra [arXiv:1606.03140 (2016), arXiv:1703.08618 (2017)] only two…
Tensor network states constitute an important variational set of quantum states for numerical studies of strongly correlated systems in condensed-matter physics, as well as in mathematical physics. This is specifically true for finitely…
Nonlocal games provide a unified framework for studying the distinction between classical, quantum, and more general no-signaling correlations. In this work, we develop this perspective by connecting the Bell-locality framework to several…
We establish approximate rigidity results for several well-known families of nonlocal games. In particular, we show that near-perfect quantum strategies for boolean constraint system (BCS) games are approximate representations of the…
We define and study a collection of matroid isomorphism games corresponding to various axiomatic characterizations of matroids. These are nonlocal games played between two cooperative players. Each game is played on two matroids, and the…
By results of Dantzig (1951) and Adler (2013), computing the optimal solutions of a linear program is equivalent to finding optimal strategies in zero-sum bimatrix games. Dantzig's original result was incomplete, in the sense that the…
We study no-signalling correlations, defined over a quadruple of second countable compact Hausdorff spaces. Using operator-valued information channels over abstract alphabets, we define the subclasses of local, quantum spatial and quantum…
We study the classical and quantum values of one- and two-party linear games, an important class of unique games that generalizes the well-known XOR games to the case of non-binary outcomes. We introduce a ``constraint graph" associated to…
We introduce a simple single-system game inspired by the Clauser-Horne-Shimony-Holt (CHSH) game. For qubit systems subjected to unitary gates and projective measurements, we prove that any strategy in our game can be mapped to a strategy in…
An attempt is made to find a comprehensive mathematical framework in which to investigate the problems of well-posedness and asymptotic analysis for fully nonlinear evolutionary game theoretic models. The model should be rich enough to…
We give an explicit family of XOR games with O(n)-bit questions requiring 2^n ebits to play near-optimally. More generally we introduce a new technique for proving lower bounds on the amount of entanglement required by an XOR game: we show…
This paper investigates the non-zero-sum linear-quadratic stochastic Stackelberg differential games with affine constraints, which depend on both the follower's response and the leader's strategy. With the help of the stochastic Riccati…