Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore how to construct succinct classical interactive arguments for QMA using only standard cryptographic assumptions in this 51-minute conference talk from the Simons Institute. Learn about building on Kalai, Lombardi, and Vaikuntanathan's compiler to convert two-prover interactive proofs in the MIP* model into one-prover interactive arguments, achieving succinctness by combining MIP* literature ideas with post-quantum succinct arguments of knowledge. Discover why this construction notably does not yield quantum PCPs—neither Hamiltonian nor games PCPs—contrasting with the classical world where PCPs seem inherent to succinct arguments for NP. Understand the technical foundations based on Learning With Errors (LWE) assumptions and examine the implications for quantum complexity theory through research findings from joint work with Tony Metger and Tina Zhang.
