YoVDO

MIP Equals RE - Putting Everything Together

Offered By: Simons Institute via YouTube

Tags

Quantum Computing Courses Turing Machines Courses Theoretical Computer Science Courses Quantum PCPs Courses

Course Description

Overview

Explore a comprehensive lecture on quantum protocols, focusing on testing and quantum probabilistically checkable proofs (PCPs). Delve into key concepts such as distance measures, entanglement, compression, and the gap between classical and quantum systems. Learn how these elements come together in the MIP* = RE theorem, which relates to multi-prover interactive proofs with entangled provers. Examine the organization of quantum protocols, compression techniques, and the role of Turing machines in this context. Gain insights from speaker Zhengfeng Ji of the University of Technology Sydney as he presents this complex topic at the Simons Institute.

Syllabus

Introduction
Distance measures
Entanglement
Questions
Compression
Gap
Putting Everything Together
Organization
Compression Serum
Turing Machine
Compress
QA


Taught by

Simons Institute

Related Courses

Automata Theory
Stanford University via edX
Intro to Theoretical Computer Science
Udacity
Computing: Art, Magic, Science
ETH Zurich via edX
理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX
Quantitative Formal Modeling and Worst-Case Performance Analysis
EIT Digital via Coursera