During this time of lockdown, the centre for quantum software and information (QSI) at the University of Technology Sydney has launched an online seminar series. With talks once or twice a week from leading researchers in the field, meQuanics is supporting this series by mirroring the audio from each talk. I would encourage if you listen to this episode, to visit and subscribe to the UTS:QSI YouTube page to see each of these talks with the associated slides to help it make more sense.
https://youtu.be/8Cmw5u8fazk
TITLE: Spooky complexity at a distance
SPEAKER: Prof Zhengfeng Ji
AFFILIATION: UTS Centre for Quantum Software and Information, Sydney, Australia
HOSTED BY: Prof Sven Rogge, Centre for Quantum Computation & Communication Technology (CQC2T)
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. 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.
RELATED ARTICLES: MIP*=RE: https://arxiv.org/abs/2001.04383
