Non UBC
DSpace
Anand Natarajan
2020-01-13T09:50:35Z
2019-07-16T10:47
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 wish to play almost optimally must share a quantum state that is close to a specific entangled state. In this talk I'll present a self-test for high-dimensional maximally entangled states that is *efficient* and *robust*: to test n qubits of entanglement requires a game of poly(n) size, and the test gives guarantees even for strategies that are constant far from optimal. These properties are motivated by the complexity-theoretic goal of showing that the entangled value of a nonlocal game is strictly harder to approximate than the classical value. Based on joint work with Thomas Vidick.
https://circle.library.ubc.ca/rest/handle/2429/73308?expand=metadata
70.0 minutes
video/mp4
Author affiliation: Caltech
Banff (Alta.)
10.14288/1.0388286
eng
Unreviewed
Vancouver : University of British Columbia Library
Banff International Research Station for Mathematical Innovation and Discovery
Attribution-NonCommercial-NoDerivatives 4.0 International
http://creativecommons.org/licenses/by-nc-nd/4.0/
Postdoctoral
BIRS Workshop Lecture Videos (Banff, Alta)
Mathematics
Functional Analysis, Quantum Theory
You must have n qubits or more to win: efficient self-tests for high-dimensional entanglement
Moving Image
http://hdl.handle.net/2429/73308