{"http:\/\/dx.doi.org\/10.14288\/1.0388286":{"http:\/\/vivoweb.org\/ontology\/core#departmentOrSchool":[{"value":"Non UBC","type":"literal","lang":"en"}],"http:\/\/www.europeana.eu\/schemas\/edm\/dataProvider":[{"value":"DSpace","type":"literal","lang":"en"}],"http:\/\/purl.org\/dc\/terms\/creator":[{"value":"Anand Natarajan","type":"literal","lang":"en"}],"http:\/\/purl.org\/dc\/terms\/issued":[{"value":"2020-01-13T09:50:35Z","type":"literal","lang":"en"},{"value":"2019-07-16T10:47","type":"literal","lang":"en"}],"http:\/\/purl.org\/dc\/terms\/description":[{"value":"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\nnon-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\ncomplexity 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.","type":"literal","lang":"en"}],"http:\/\/www.europeana.eu\/schemas\/edm\/aggregatedCHO":[{"value":"https:\/\/circle.library.ubc.ca\/rest\/handle\/2429\/73308?expand=metadata","type":"literal","lang":"en"}],"http:\/\/purl.org\/dc\/terms\/extent":[{"value":"70.0 minutes","type":"literal","lang":"en"}],"http:\/\/purl.org\/dc\/elements\/1.1\/format":[{"value":"video\/mp4","type":"literal","lang":"en"}],"http:\/\/www.w3.org\/2009\/08\/skos-reference\/skos.html#note":[{"value":"","type":"literal","lang":"en"},{"value":"Author affiliation: Caltech","type":"literal","lang":"en"}],"http:\/\/purl.org\/dc\/terms\/spatial":[{"value":"Banff (Alta.)","type":"literal","lang":"en"}],"http:\/\/www.europeana.eu\/schemas\/edm\/isShownAt":[{"value":"10.14288\/1.0388286","type":"literal","lang":"en"}],"http:\/\/purl.org\/dc\/terms\/language":[{"value":"eng","type":"literal","lang":"en"}],"https:\/\/open.library.ubc.ca\/terms#peerReviewStatus":[{"value":"Unreviewed","type":"literal","lang":"en"}],"http:\/\/www.europeana.eu\/schemas\/edm\/provider":[{"value":"Vancouver : University of British Columbia Library","type":"literal","lang":"en"}],"http:\/\/purl.org\/dc\/terms\/publisher":[{"value":"Banff International Research Station for Mathematical Innovation and Discovery","type":"literal","lang":"en"}],"http:\/\/purl.org\/dc\/terms\/rights":[{"value":"Attribution-NonCommercial-NoDerivatives 4.0 International","type":"literal","lang":"en"}],"https:\/\/open.library.ubc.ca\/terms#rightsURI":[{"value":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/","type":"literal","lang":"en"}],"https:\/\/open.library.ubc.ca\/terms#scholarLevel":[{"value":"Postdoctoral","type":"literal","lang":"en"}],"http:\/\/purl.org\/dc\/terms\/isPartOf":[{"value":"BIRS Workshop Lecture Videos (Banff, Alta)","type":"literal","lang":"en"}],"http:\/\/purl.org\/dc\/terms\/subject":[{"value":"Mathematics","type":"literal","lang":"en"},{"value":"Functional Analysis, Quantum Theory","type":"literal","lang":"en"}],"http:\/\/purl.org\/dc\/terms\/title":[{"value":"You must have n qubits or more to win: efficient self-tests for high-dimensional entanglement","type":"literal","lang":"en"}],"http:\/\/purl.org\/dc\/terms\/type":[{"value":"Moving Image","type":"literal","lang":"en"}],"https:\/\/open.library.ubc.ca\/terms#identifierURI":[{"value":"http:\/\/hdl.handle.net\/2429\/73308","type":"literal","lang":"en"}]}}