标题：A complexity-theoretic solution to Connes' Embedding Problem
报告人：季铮锋（悉尼科技大学）
时间：7月6日，15:00-16:00
地点：腾讯会议，会议 ID：741 785 636
摘要：This talk aims to introduce how ideas and techniques from quantum information theory and complexity theory help to resolve Tsirelson's problem in physics and Connes' embedding problem in mathematics. In this complexity-theoretic approach, the central problem is to understand the complexity of approximating the entangled value of nonlocal games, a model used to study constraint satisfaction problems and interactive proofs in computer science and Bell inequalities in quantum mechanics. The problem is shown to be as hard as the Halting problem and this implies a negative answer to Tsirelson's problem via known connections. At the core of the proof is a recursive gap-preserving compression lemma, which in turn leverages many recent ideas from the study of nonlocal games.
会议链接：https://meeting.tencent.com/s/CMVthX9Fkg65
视频链接：https://www.bilibili.com/video/BV1cT4y1E7vn
报告PPT:
Complexity-Connes.pdf
