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

@article{Sikora2017LinearCF,
  title={Linear conic formulations for two-party correlations and values of nonlocal games},
  author={Jamie Sikora and Antonios Varvitsiotis},
  journal={Mathematical Programming},
  year={2017},
  volume={162},
  pages={431-463}
}
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és… 
Quantum entanglement: insights via graph parameters and conic optimization
TLDR
This thesis proposes a novel approach to the study of these quantum graph parameters using the paradigm of conic optimization, and introduces and study the completely positive semidefinite cone, a new matrix cone consisting of all symmetric matrices that admit a Gram representation by positive semidfinite matrices.
Quantum Bilinear Optimization
TLDR
An asymptotically converging hierarchy of efficiently computable semidefinite programming (SDP) relaxations for this quantum optimization of entangled value of two-prover games, entanglement-assisted coding for classical channels, and quantum-proof randomness extractors is introduced.
THE SET OF QUANTUM CORRELATIONS IS NOT CLOSED
We construct a linear system nonlocal game which can be played perfectly using a limit of finite-dimensional quantum strategies, but which cannot be played perfectly on any finite-dimensional Hilbert
Tilburg University On the closure of the completely positive semidefinite cone and linear approximations to quantum
The structural properties of the completely positive semidefinite cone CS+, consisting of all the n×n symmetric matrices that admit a Gram representation by positive semidefinite matrices of any
Relaxations of Graph Isomorphism
TLDR
It is shown that both classical and quantum isomorphism can be reformulated as feasibility programs over the completely positive and completely positive semidefinite cones respectively, and that DNN-isomorphism is equivalent to the previous defined notion of graph equivalence, a polynomialtime decidable relation that is related to coherent algebras.
76 : 2 Relaxations of Graph Isomorphism 1
We introduce a nonlocal game that captures and extends the notion of graph isomorphism. This game can be won in the classical case if and only if the two input graphs are isomorphic. Thus, by
On the Closure of the Completely Positive Semidefinite Cone and Linear Approximations to Quantum Colorings
TLDR
A hierarchy of polyhedral cones is constructed which covers the interior of the completely positive semidefinite cone $\mathcal{CS}_+^n$, which is used for computing some variants of the quantum chromatic number by way of a linear program.
Graph isomorphism: Physical resources, optimization models, and algebraic characterizations
In the $(G,H)$-isomorphism game, a verifier interacts with two non-communicating players (called provers) by privately sending each of them a random vertex from either $G$ or $H$, whose aim is to
Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone
TLDR
This new cone is investigated, a new matrix cone consisting of all $n\times n$ matrices that admit a Gram representation by positive semidefinite matrices (of any size) and is used to model quantum analogues of the classical independence and chromatic graph parameters.
Semidefinite games
We introduce and study the class of semidefinite games, which generalizes bimatrix games and finite N -person games, by replacing the simplex of the mixed strategies for each player by a slice of the
...
...

References

SHOWING 1-10 OF 57 REFERENCES
A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
TLDR
It is shown that in some cases it is possible to conclude that a given set of correlations is quantum after performing only a finite number of tests, and used in particular to bound the quantum violation of various Bell inequalities.
Quantum Bilinear Optimization
TLDR
An asymptotically converging hierarchy of efficiently computable semidefinite programming (SDP) relaxations for this quantum optimization of entangled value of two-prover games, entanglement-assisted coding for classical channels, and quantum-proof randomness extractors is introduced.
Polyhedral duality in Bell scenarios with two binary observables
For the Bell scenario with two parties and two binary observables per party, it is known that the no-signaling polytope is the polyhedral dual (polar) of the Bell polytope. Computational evidence
On the Closure of the Completely Positive Semidefinite Cone and Linear Approximations to Quantum Colorings
TLDR
A hierarchy of polyhedral cones is constructed which covers the interior of the completely positive semidefinite cone $\mathcal{CS}_+^n$, which is used for computing some variants of the quantum chromatic number by way of a linear program.
Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone
TLDR
This new cone is investigated, a new matrix cone consisting of all $n\times n$ matrices that admit a Gram representation by positive semidefinite matrices (of any size) and is used to model quantum analogues of the classical independence and chromatic graph parameters.
Binary Constraint System Games and Locally Commutative Reductions
TLDR
This paper shows that several concepts including the quantum chromatic number and the Kochen-Specker sets that arose from different contexts fit naturally in the binary constraint system framework, and provides a simple parity constraint game that requires $\Omega(\sqrt{n})$ EPR pairs in perfect strategies.
On deciding the existence of perfect entangled strategies for nonlocal games
TLDR
This work considers the problem of deciding whether a nonlocal game admits a perfect entangled strategy that uses projective measurements on a maximally entangled shared state and shows that independent set games are the hardest instances of this problem.
Approximation of the Stability Number of a Graph via Copositive Programming
TLDR
This paper shows how the stability number can be computed as the solution of a conic linear program (LP) over the cone of copositive matrices of a graph by solving semidefinite programs (SDPs) of increasing size (lift-and-project method).
On the minimum dimension of a Hilbert space needed to generate a quantum correlation
TLDR
This Letter identifies an easy-to-compute lower bound on the smallest Hilbert space dimension needed to generate a given two-party quantum correlation and shows that the bound is tight on many well-known correlations and discusses how it can rule out correlations of having a finite-dimensional quantum representation.
Unique Games with Entangled Provers are Easy
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are `unique' constraints (i.e.,
...
...