University Awards
Recognising Excellence
  • Information theory
  • Quantum computation
  • Communication complexity
  • Computational complexity theory
  • Cryptography
  • Addressed a decade-old challenge in quantum complexity theory by showing that quantum interactive proofs do not have extra power over classical interactive proofs, and that quantum verification efficiently in time equates classical solution efficiently in space
  • Established that an important class QIP (the class of decision problems solved by an efficient quantum verifier using interaction with an all powerful prover) is contained in PSPACE (the class of all decision problems which can be solved using polynomial space), introducing new ideas for providing fast parallel algorithms for specific semi-definite programmes
  • Developed a fast parallel algorithm for positive semi-definite programmes that is heavily used in optimisation, approximation and complexity theory
  • Out-of-the-box thinking that is not confined by existing frameworks
  • Contributed over 35 papers, with over 390 citations received
  • Member, Programme Committee, Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2012, Indian Association for Research in Computing Science (IARCS) Annual Conference on Foundations of Software Technology and Theoretical Computer Science
  • Member, Programme Committee, TQC 2010, 5th Conference on Theory of Quantum Computation, Communication and Cryptography
  • Serves as referee for leading international journals such as Society for Industrial and Applied Mathematics (SIAM) Journal of Computing, Physical Review Letters and Quantum Information and Computation
  • Referees major international conferences such as Association for Computing Machinery (ACM) Symposium on Theory of Computing and the Institute of Electrical and Electronics Engineers (IEEE) Conference on Foundations of Computer Science
  • Best Paper, 42nd ACM Symposium on Theory of Computing (2010)
  • Tata Institute of Fundamental Research Alumni Association (TAA)-Sasken Best Thesis Award (2005/2006)
  • IBM Distinguished Dissertation Award (2005)
"I aim to further explore the still nascent but growing field of quantum complexity theory and algorithms. I aim to further investigate the use of information theory in different aspects of theoretical computer science."