Semidefinite programming and computational aspects of entanglement
Instructors: Aram Harrow and Anand Natarajan
Lectures:
- Fri, 3 Nov:
Introduction to convex optimization, separable states and nonlocal games.
- Thu, 9 Nov: Computational hardness of optimizing over separable states
- Fri, 10 Nov: Computational hardness of estimating the value
of nonlocal games
- Fri, 17 Nov: The Sum-of-Squares SDP hierarchy.
Application to separable states and entangled games.
- Thu, 23 Nov: Limitations on SoS and other SDP relaxations.
- Fri, 24 Nov: quantum de Finetti theorems, monogamy of entanglement and accuracy bounds on the SoS approximation for separable states.
- Thu, 30 Nov. Fri, 1 Dec. Proof of quantum de Finetti theorems. No notes available.