William Slofstra:Tsirelson’s problem & an embedding theorem for groups arising from non-local games

Channel:
Microsoft Research
Subscribers:
344,000
Published on ● Video Link: https://www.youtube.com/watch?v=RR_7Y00klK0


Duration: 51:05
1,047 views
23

"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 Connes embedding problem, remains open.

The examples we construct are instances of (binary) linear system games. For such games, previous results state that the existence of perfect strategies is controlled by the solution group of the linear system. Our main result is that every finitely-presented group embeds in some solution group. As an additional consequence, we show that the problem of determining whether a linear system game has a perfect commuting-operator strategy is undecidable."



Other Videos By Microsoft Research


2017-01-31Dave Touchette:Exponential separation quantum communication & classical information complexity
2017-01-31Sam Roberts: Symmetry protected topological order at nonzero temperature
2017-01-31Anthony Leverrier: SU(p,q) coherent states and Gaussian de Finetti theorems
2017-01-31Michael Kastoryano: Finite correlation length implies efficient preparation quantum thermal states
2017-01-31Xin Wang: Semidefinite programming strong converse bounds for quantum channel capacities
2017-01-31Li Gao: Capacity estimates for TRO channels
2017-01-31Anna Vershynina: Geometric inequalities and contractivity of bosonic semigroups
2017-01-31Rotem Arnon-Friedman: Entropy accumulation in device-independent protocols
2017-01-31Giacomo De Palma: Gaussian optimizers in quantum information
2017-01-31Sergey Bravyi: Improved classical simulation of quantum circuits dominated by Clifford gates
2017-01-31William Slofstra:Tsirelson’s problem & an embedding theorem for groups arising from non-local games
2017-01-31Keisuke Fujii: Threshold theorem for quantum supremacy
2017-01-31Kai-Min Chung: General randomness amplification with non-signaling security
2017-01-31Anand Natarajan: Robust self-testing of many qubit states
2017-01-31Andras Gilyen: On preparing ground states of gapped Hamiltonians
2017-01-31David Gosset: Complexity of quantum impurity problems
2017-01-31Thomas Vidick: Rigorous RG algorithms and area laws for low energy eigenstates in 1D
2017-01-31Giulio Chiribella: Optimal compression for identically prepared qubit states
2017-01-31James Lee: Spectrahedral lifts and quantum learning
2017-01-31Optimal Hamiltonian simulation by quantum signal processing
2017-01-31Shalev Ben-David: Sculpting quantum speedups


Tags:
microsoft research