• Monogamy of entanglement and convex geometry

    CMSA 20 Garden Street, Cambridge, MA, United States

    Speaker: Aram Harrow (MIT) Title: Monogamy of entanglement and convex geometry Abstract: The SoS (sum of squares) hierarchy is a flexible algorithm that can be used to optimize polynomials and to test whether a quantum state is entangled or separable.  (Remarkably, these two problems are nearly isomorphic.)  These questions lie at the boundary of P, NP and the unique games […]