Leonid Gurvits

Leonid Gurvits is a Professor of Computer Science at The City College of New York, part of the City University of New York (CUNY) system. His career spans institutions like Los Alamos National Laboratory (lanl.gov) and collaborations with leading researchers in mathematics and computer science, including Ankit Garg and Rafael Oliveira. He has held visiting scientist roles at programs such as the Simons Institute's Geometry of Polynomials (Spring 2019) and Bridging Continuous and Discrete Optimization (Fall 2017).

• Fields of Interest: Quantum computing, hyperbolic polynomials, operator scaling, and computational complexity.
• Key Contributions: Pioneering deterministic polynomial-time algorithms, solving problems in mixed discriminants, and advancing understanding of quantum entanglement and matrix stability.

His work is deeply rooted in the interplay between mathematics and theoretical computer science, with applications to optimization, control theory, and quantum information. Notably, he resolved conjectures related to the permanent of matrices and developed capacity-preserving operators for combinatorial applications.

Publications include groundbreaking articles on the complexity of quantum entanglement (2003), stability of switched linear systems (2007), and operator scaling for Brascamp-Lieb inequalities (2017). These works have been cited extensively, reflecting their impact on theoretical computer science and mathematical optimization.