Uma Girish

PhD Student
Computer Science, Princeton University
ugirish (at) princeton (dot) edu
CV.

About Me

I am a third year PhD student at Princeton University. I am broadly interested in Computational Complexity and Algorithms, especially in the areas of Quantum Computing and Boolean Function Analysis.

I am extremely fortunate to be advised by Professor Ran Raz. Previously, I was a visiting student at the School of Technology and Computer Science TIFR, Mumbai, thanks to the generous support of Professor Jaikumar Radhakrishnan. I was fortunate to be advised by Piyush Srivastava for my M.Sc. thesis. I obtained an M.Sc. in Computer Science and B.Sc. Hons. in Mathematics and Computer science from Chennai Mathematical Institute.


Publications

Eliminating Intermediate Measurements using Pseudorandom Generators

with Ran Raz.

ECCC, Arxiv.

Parallel Repetition for the GHZ Game: A Simpler Proof

with Justin Holmgren, Kunal Mittal, Ran Raz and Wei Zhan.

In APPROX/RANDOM 2021. ECCC, Arxiv.

Fourier Growth of Parity Decision Trees

with Avishay Tal and Kewen Wu.

In CCC 2021. ECCC, Arxiv.

Lower Bounds for XOR of Forrelations

with Ran Raz and Wei Zhan.

In APPROX/RANDOM 2021. ECCC, Arxiv.

Quantum Logspace Algorithm for Powering Matrices with Bounded Norm

with Ran Raz and Wei Zhan.

In QIP 2021, ICALP 2021. ECCC, Arxiv.

Quantum versus Randomized Communication Complexity, with Efficient Players

with Ran Raz and Avishay Tal.

In QIP 2020, ITCS 2021. ECCC, Arxiv.


Older Manuscripts

Deterministic Approximation Schemes for Permanents of Laplacians

Master's Thesis under the guidance of Piyush Srivastava.

Maximising Subdeterminants Subject to Partition Constraints - Towards Derandomization

Project report on work done during my internship at EPFL, Lausanne under the guidance of Professor Nisheeth Vishnoi.


Teaching

  • TA in COS340: Reasoning about Computation, Fall 2020.
  • TA in COS585: Information Theory and Applications, Fall 2019.