Video URL

https://simons.berkeley.edu/talks/tbd-145

MIP* = RE: Putting Everything Together

(2020). MIP* = RE: Putting Everything Together. The Simons Institute for the Theory of Computing. https://simons.berkeley.edu/talks/tbd-145

MIP* = RE: Putting Everything Together. The Simons Institute for the Theory of Computing, Apr. 01, 2020, https://simons.berkeley.edu/talks/tbd-145 

          @misc{ scivideos_15585,
            doi = {},
            url = {https://simons.berkeley.edu/talks/tbd-145},
            author = {},
            keywords = {},
            language = {en},
            title = {MIP* = RE: Putting Everything Together},
            publisher = {The Simons Institute for the Theory of Computing},
            year = {2020},
            month = {apr},
            note = {15585 see, \url{https://scivideos.org/Simons-Institute/15585}}
          }
Zhengfeng Ji (University of Technology Sydney)
Source Repository Simons Institute
Subject

Abstract

In this talk, we will discuss the overall framework for combining many of the techniques established in previous talks of this workshop, including the quantum low-degree test, question reduction by introspection, and answer reduction by the PCP technique. Building upon these techniques, we will construct a recursive gap-preserving compression procedure for quantum two-prover interactive proofs in the normal form and use it to give a proof of MIP* = RE.