Quantum Complexity of Clique Homology
Offered By: Simons Institute via YouTube
Course Description
Overview
Explore the intersection of topology and quantum mechanics in this 44-minute lecture by Robbie King from Caltech. Delve into the complexity theory behind determining the presence of holes in topological spaces, and discover how this problem relates to QMA (Quantum Merlin Arthur) complexity. Examine the implications for quantum algorithms, supersymmetric quantum mechanics, and quantum PCPs (Probabilistically Checkable Proofs). Gain insights into the quantum hardness proof, focusing on the application of spectral sequences, a tool from algebraic topology. Uncover the unexpected quantum mechanical structures within this seemingly classical topological problem, bridging the gap between quantum complexity theory and topology.
Syllabus
Quantum Complexity of Clique Homology
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