filmov
tv
Spooky complexity at a distance
Показать описание
CQT Online Talks
Speaker: Zhengfeng Ji, University of Technology Sydney
Abstract: In this talk, I will discuss the recent result on the characterisation of the power of quantum multi-prover interactive proof systems, MIP*=RE (arXiv:2001.04383). After a brief setup of the problem, we will highlight its rich connections and implications to problems in computer science, quantum physics, and mathematics, including the Tsirelson's problem and Connes' embedding problem. In the second half of the talk, we will outline the overall proof strategy and introduce several key techniques employed in the proof.
Speaker: Zhengfeng Ji, University of Technology Sydney
Abstract: In this talk, I will discuss the recent result on the characterisation of the power of quantum multi-prover interactive proof systems, MIP*=RE (arXiv:2001.04383). After a brief setup of the problem, we will highlight its rich connections and implications to problems in computer science, quantum physics, and mathematics, including the Tsirelson's problem and Connes' embedding problem. In the second half of the talk, we will outline the overall proof strategy and introduce several key techniques employed in the proof.
1:07:41
0:10:34
1:17:01
0:01:22
0:08:35
0:00:48
0:00:45
0:13:31
0:03:18
0:01:00
0:01:00
0:15:49
0:03:16
0:06:29
0:00:48
0:00:44
0:03:34
0:05:08
0:01:18
0:05:18
0:00:52
0:09:05
0:01:00