Tsirelson’s problem and an embedding theorem for groups arising from non-local games

@article{Slofstra2019TsirelsonsPA,
  title={Tsirelson’s problem and an embedding theorem for groups arising from non-local games},
  author={William Slofstra},
  journal={Journal of the American Mathematical Society},
  year={2019}
}
  • William Slofstra
  • Published 9 June 2016
  • Mathematics
  • Journal of the American Mathematical Society
Tsirelson’s problem asks whether the commuting operator model for two-party quantum correlations is equivalent to the tensor-product model. We give a negative answer to this question by showing that there are non-local games which have perfect commuting-operator strategies, but do not have perfect tensor-product strategies. The weak Tsirelson problem, which is known to be equivalent to the Connes embedding problem, remains open. The examples we construct are instances of (binary) linear system… 
Quantum correlation matrices and Tsirelson’s problem
Tsirelson once claimed that the set of quantum correlations, defined by strategies of non-local two-player games, does not depend on which of two possible models is chosen: the tensor product model
Tsirelson's problems and entanglement breaking rank
TLDR
This thesis shows that the quantum correlation set is not closed hence solving one of Tsirelson’s problem and also improves the results of Slofstra by reducing the number of experiments and outcomes to five and two, respectively.
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
3XOR Games with Perfect Commuting Operator Strategies Have Perfect Tensor Product Strategies and are Decidable in Polynomial Time
TLDR
It is shown that for perfect 3XOR games the advantage of a quantum strategy over a classical strategy (defined by the quantum-classical bias ratio) is bounded, in contrast to the general3XOR case where the optimal quantum strategies can require high dimensional states and there is no bound on the quantum advantage.
Noncommutative Nullstellens\"atze and Perfect Games
The foundations of classical Algebraic Geometry and Real Algebraic Geometry are the Nullstellensatz and Positivstellensatz. Over the last two decades the basic analogous theorems for matrix and
Arkhipov's theorem, graph minors, and linear system nonlocal games
. The perfect quantum strategies of a linear system game correspond to certain representations of its solution group. We study the solution groups of graph incidence games, which are linear system
Perfect Strategies for Non-Local Games
TLDR
A new class of non-local games, called imitation games, in which the players display linked behaviour, and which contain as subclasses the classes of variable assignment games, binary constraint system games, synchronous games, many games based on graphs, and unique games.
Algebraic and combinatorial aspects of incidence groups and linear system non-local games arising from graphs
TLDR
This work describes a graph-LinBCS game by a 2-coloured graph and calls the corresponding solution group a graph incidence group, and it is shown that computing the classical value, a problem that is NP-hard for general LinBCS games can be done efficiently.
Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision
TLDR
Lower bounds are given on the complexity class PZK-MIPcoδ (2, 1,1, s) of perfect zero-knowledge multi-prover proofs with approximately-commuting operator strategies, as the gap 1 --- s gets arbitrarily small.
Classification and Computability for Nonlocal Games
TLDR
This work attempts to relate the two models, namely XOR games and linear system games, by studying the relationships between their strategies and refutations, and tries to understand when results for one model can be transferred to the other.
...
...

References

SHOWING 1-10 OF 55 REFERENCES
TSIRELSON'S PROBLEM AND KIRCHBERG'S CONJECTURE
Tsirelson's problem asks whether the set of nonlocal quantum correlations with a tensor product structure for the Hilbert space coincides with the one where only commutativity between observables
Connes' embedding problem and Tsirelson's problem
We show that Tsirelson's problem concerning the set of quantum correlations and Connes' embedding problem on finite approximations in von Neumann algebras (known to be equivalent to Kirchberg's QWEP
Perfect Commuting-Operator Strategies for Linear System Games
Linear system games are a generalization of Mermin's magic square game introduced by Cleve and Mittal. They show that perfect strategies for linear system games in the tensor-product model of
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
Characterization of Binary Constraint System Games
TLDR
This work investigates a simple class of multi-prover interactive proof systems, called binary constraint system (BCS) games, and characterize those that admit a perfect entangled strategy (i.e., a strategy with value 1 when the provers can use shared entanglement) in terms of a system of matrix equations.
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 non-semisplit extensions, tensor products and exactness of groupC*-algebras
SummaryWe show the existence of a block diagonal extensionB of the suspensionS(A) of the reduced groupC*-algebraA = Cr*(SL2(ℤ)), such that there is only oneC*-norm on the algebraic tensor
The Quantum Moment Problem and Bounds on Entangled Multi-prover Games
TLDR
It is proved that a hierarchy of semidefinite programs similar to the one given by Navascues, Pironioand Acin converges to the entangled value of the game and it would follow that the languages recognized by a multi-prover interactive proof system where the provers share entanglement are recursive.
Synchronous correlation matrices and Connes' embedding conjecture
In a recent paper, the concept of synchronous quantum correlation matrices was introduced and these were shown to correspond to traces on certain C*-algebras. In particular, synchronous correlation
Consequences and limits of nonlocal strategies
TLDR
This paper investigates various aspects of the nonlocal effects that can arise when entangled quantum information is shared between two parties, and establishes limits on nonlocal behavior by upper-bounding the values of several of these games.
...
...