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