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

Показать описание
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:
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:
CQC2T Colloquium/QSI Seminar: Prof Zhengfeng Ji, QSI, Spooky Complexity at a Distance, 26/03/2020
The Role of Proofs in MIP* = RE | Quantum Colloquium
[QCrypt2018] 8.30 Zhengfeng Ji
AQIS '20: Zhengfeng Ji, Spooky complexity at a distance
QSI Seminar: Dr Joe Fitzsimons, Horizon Quantum Computing, Abstracting Quantum Computation 28/04/&ap...
Zhengfeng Ji: Compression of quantum multi-prover interactive proofs
Jan 11 Zhengfeng Ji. 'Classical Verification of Quantum Proofs'
Pseudorandom Quantum States
Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier | Quantum Colloquium
QSI Seminar: Prof. Rodney Van Meter, Keio University, Engineering the Quantum Internet, 30/06/2020
Zhengfeng Ji, Approximating Permanent of Random Matrices with Vanishing Mean
MIP* = RE: Putting Everything Together
Daniel Gottesman | April 28, 2020 | Graphical Proofs for Fault-Tolerant Quantum Computation
QSI Seminar: Guillaume Verdon, X, Quantum-probabilistic Generative Models, 19/06/2020
Can Quantum Physics hide your secrets?
Quantum Mechanics
TCS+ Talk: Henry Yuen
Mission Quantum Field - Geh Nicht Mein Herz
MScIISem Quantum Mechanics ByYajvendra kumar
Fermion Sampling: a robust quantum computational advantage scheme [..] - TQC 2021
Physics 9th Chapter One Branches of Modern Physics
The measurement problem of Quantum Mechanics - a culinary consideration
Bill Janeshak | Use Quantum Energy, Nutrition to Create health
Super Power of America: CoronaVirus Vaccine via Quantum Physics Theory, REJOICE!!!
Комментарии