CS395T: Advanced Quantum Complexity Theory
This course will cover recent advances in quantum complexity theory. Possible topics will likely include:
Nonlocal games, self-testing, and MIP* = RE
QMA(2) and the proof that QMA(2) = QMA(k)
Urmila Mahadev's protocol for classical verification of quantum computation
The quantum PCP conjecture
A prior course in quantum computing (e.g., UT Austin's CS378),
along with a strong background in linear algebra, discrete probability, and theory of computation.
CS395T (Quantum Complexity Theory) is recommended.