Noncommutative Analysis, Computational Complexity, and Quantum Information
CMSA 20 Garden Street, Cambridge, MA, United StatesOn October 16-18, 2019 the CMSA hosted a workshop on Noncommutative Analysis, Computational Complexity, and Quantum Information. This workshop focuses on linking three different rapidly developing areas: noncommutative real algebraic geometry (RAG), theory of computation and quantum information theory. This mix of overlapping but independently developing topics should lead to a stimulating flow of tools and important […]
Monogamy of entanglement and convex geometry
CMSA 20 Garden Street, Cambridge, MA, United StatesSpeaker: 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 […]
Compactification for cluster varieties without frozen variables of finite type
Speaker: Man-Wai Cheung Title: Compactification for cluster varieties without frozen variables of finite type Abstract: Cluster varieties are blow up of toric varieties. They come in pairs $(A,X)$, with $A$ and $X$ built from dual tori. Compactifications of $A$, studied by Gross, Hacking, Keel, and Kontsevich, generalize the polytope construction of toric varieties while […]
2019 Ding Shum Lecture
CMSA 20 Garden Street, Cambridge, MA, United Stateshttps://youtu.be/WEpgH5Anjdg?si=U1LMgvou7OAGE8K8 On October 22, 2019, the CMSA held the third annual Ding Shum lecture. Speaker: Ronald L. Rivest (MIT) Title: Election Security Ronald L. Rivest is an Institute Professor at the Massachusetts Institute of Technology. He is a member of the Electrical Engineering and Computer Science Department and the Computer Science and Artificial Intelligence Laboratory […]