Speaker
Yuming Zhao, University of Copenhagen
Abstract
The NPA hierarchy gives a sequence of semidefinite programming relaxations that converges to the commuting operator value of a nonlocal game. A natural question is whether this value can ever be attained at a finite level of the hierarchy. In this talk, I will discuss recent results showing that, in general, the answer is no.
I will focus on the techniques behind the results: how algebraic relations can be “played” by optimal strategies of nonlocal games, either exactly or through embeddings. Based on joint work with Marco Fanizza, Larissa Kroell, Arthur Mehta, Connor Paddock, Denis Rochette, and William Slofstra.