Associate Professor, Department of Computer Science and Engineering
Computational Complexity, Quantum Computing and Semidefinite Programming.
Office
RM 202,
Department of Computer Science and Engineering
IIT Kanpur,
Kanpur 208016
Theoretical computer science, Complexity (Computer Science)
PhD, Department of Computer Science, Rutgers University, Jan 2011.
Thesis Title:Application of semidefinite programming in query complexity and product rules
Thesis Supervisor: Mario Szegedy
Btech., Department of Computer Science and Engineering, IIT Bombay, Aug 2004.
Applications of semidefinite programming in complexity theory
Topics in linear programming
Characterization of binary constraint games; with R. Cleve; ICALP 2014 and QIP2014.
Quantum query complexity of state conversion; with T. Lee, B. Reichardt, R. Spalek and M. Szegedy; FOCS 2011 and QIP 2012.
Product theorems via semidefinite programming; with T. Lee;ICALP 2008.