You must have n qubits or more to win: efficient self-tests for high-dimensional entanglement

Anand Natarajan
How much, and what sort of entanglement is needed to win a non-local game In many ways this is the central question in the study of non-local games, and as we've seen in the previous talks, a full understanding of this question could resolve such conundrums as Tsirelson's problem, the complexity of MIP*, and Connes' embedding conjecture. One approach to this question which has proved fruitful is to design *self-tests*: games for which players who...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.