NEXP is Contained in MIP* - Complexity Theory Breakthrough
Offered By: IEEE via YouTube
Course Description
Overview
Explore groundbreaking research in computational complexity theory as Anand Natarajan and John Wright present their findings on the containment of NEXP in MIP* in this 22-minute IEEE conference talk. Delve into the implications of this result for interactive proof systems and quantum computing, gaining insights into the power of multiple provers and entanglement in computational models.
Syllabus
NEXP is contained in MIP*
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
Intro to Computer ScienceUniversity of Virginia via Udacity Quantum Mechanics for IT/NT/BT
Korea University via Open Education by Blackboard Emergent Phenomena in Science and Everyday Life
University of California, Irvine via Coursera Quantum Information and Computing
Indian Institute of Technology Bombay via Swayam Quantum Computing
Indian Institute of Technology Kanpur via Swayam