Title	A complexity-theoretic approach to disproving Connes' Embedding Problem
Creator	Vidick, Thomas
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2019-07-15T14:23
Description	Tsirelson's problem asks a question about modeling locality in quantum mechanics; roughly speaking, whether the tensor product and commuting models for specifying bipartite correlations are equivalent. Ozawa showed that Tsirelson's problem is equivalent to Connes' Embedding Problem In the talk I will start from Tsirelson's problem and outline a possible approach to its resolution that goes through the theory of nonlocal games in quantum information and interactive proofs in complexity theory. The talk will be introductory and largely based on the work of others, including Navascues, Pironio and Acin, and Doherty, Liang, Toner, and Wehner. I will not assume any background in complexity theory.
Extent	61.0 minutes
Subject	Mathematics; Functional analysis; Quantum theory
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: California Institute of Technology
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2020-01-12
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0388283
URI	http://hdl.handle.net/2429/73306
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Faculty
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos

A complexity-theoretic approach to disproving Connes' Embedding Problem Vidick, Thomas

Description

Item Metadata

Item Media

Item Citations and Data

Rights