CQC2T Colloquium/QSI Seminar: Prof Zhengfeng Ji, QSI, Spooky Complexity at a Distance, 26/03/2020

preview_player
Показать описание
Characterisation of the power of quantum multi-prover interactive proof systems, MIP*=RE.

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:

OTHER LINKS:

Рекомендации по теме
Комментарии
Автор

FATHI FES MEDOS AZIZA1 SAID THANK YOU SO MUCH

assahrasoumasahboou