The Quantum Games PCP - Results and Confessions
Offered By: Simons Institute via YouTube
Course Description
Overview
Explore a 48-minute lecture on quantum complexity theory, focusing on the quantum PCP conjecture and its relationship to multiprover interactive proof systems. Delve into the current state of knowledge regarding MIP* and QMA, and learn about a correction to the "quantum games PCP conjecture" previously claimed by the speaker and Thomas Vidick. Discover potential implications for "baby versions" of the Hamiltonian quantum PCP conjecture, based on joint work with Chinmay Nirkhe. Gain insights into the challenges and progress in quantum complexity theory, presented by Anand Natarajan from MIT at the Simons Institute.
Syllabus
The Quantum Games PCP: Results and Confessions
Taught by
Simons Institute
Related Courses
Quantum Information Science II: Quantum states, noise and error correctionMassachusetts Institute of Technology via edX Quantum Information Science II: Efficient Quantum Computing - fault tolerance and complexity
Massachusetts Institute of Technology via edX Panel on Quantum Machine Learning and Barren Plateaus
Simons Institute via YouTube Summer Cluster in Quantum Computation - Polylogues
Simons Institute via YouTube QMA and the Power of Positivity
Simons Institute via YouTube