Two Prover Perfect Zero Knowledge for MIP* - Theory of Quantum Computation

Explore a technical conference talk that delves into proving every language in MIP* (multiprover proof systems with entangled provers) has a two-prover one-round perfect zero knowledge (PZK) MIP* protocol. Learn how the MIP*=RE theorem's implications enable the transformation of MIP* protocols into boolean constraint system (BCS) nonlocal games, building upon previous work by Grilo, Slofstra, and Yuen. Discover a new methodology that adapts Dwork, Feige, Kilian, Naor, and Safra's classical MIP protocol construction for 3SAT with perfect zero knowledge. Examine the development of a toolkit for analyzing quantum soundness of reductions between BCS games, applicable to commuting operator strategies, demonstrating that languages with commuting operator BCS protocols can achieve two-prover PZK commuting operator protocols. Presented at the 19th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2024), this talk advances theoretical quantum information science by addressing fundamental questions about perfect zero knowledge protocols in quantum computing.