BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:The quantum games PCP: results and confessions - Anand Natarajan (
 MIT)
DTSTART:20240820T130000Z
DTEND:20240820T140000Z
UID:TALK219889@talks.cam.ac.uk
CONTACT:Tom Gur
DESCRIPTION:In classical complexity theory\, the PCP theorem arose directl
 y from Babai\, Fortnow\, and Lund’s seminal result that multiprover inte
 ractive proof systems can decide NEXP. In the quantum case\, the connectio
 n is less clear\, but researchers have hoped that insights into the quantu
 m PCP conjecture can arise from the study of succinct MIP* interactive pro
 ofs for QMA. In this talk\, I will present the current state of knowledge 
 regarding MIP* and QMA\,  explain a mistake in the proof of the “quantum
  games PCP conjecture” claimed by myself and Thomas Vidick in 2018\, and
  discuss how these ideas may point the way towards interesting “baby ver
 sions” of the Hamiltonian quantum PCP conjecture. I will also discuss re
 cent progress in setting of cryptographically sound argument systems\, whi
 ch a relaxed notion of interactive proof: here\, recent work on “compile
 d” nonlocal games has led to succinct interactive arguments for QMA. Bas
 ed on joint works with Chinmay Nirkhe\, Tony Metger\, and Tina Zhang.
LOCATION:Computer Laboratory\, William Gates Building\, Room FW26
END:VEVENT
END:VCALENDAR