Quantum Complexity of Clique Homology

Channel:

Simons Institute for the Theory of Computing

Subscribers:

68,800

Published on April 15, 2024 4:22:09 PM ● Video Link: https://www.youtube.com/watch?v=xOYqi0m6IyM

Category:

Vlog

Duration: 44:05

113 views

0

Robbie King (Caltech)
https://simons.berkeley.edu/talks/robbie-king-caltech-2024-03-19
Quantum Complexity: Quantum PCP, Area Laws, and Quantum Gravity

In this talk we'll examine a problem in topology, and we will uncover quantum mechanical structure in this seemingly classical setting. The connection can be formalized by complexity theory: the hardness of deciding whether or not a space has a hole is characterized by QMA. We will look at implications in quantum algorithms, supersymmetric quantum mechanics, and quantum PCPs. We will also see some of the key ideas behind the quantum hardness proof, which involves a tool from algebraic topology known as spectral sequences.