Quantum Logspace Algorithm for Powering Matrices with Bounded Norm. - Uma Girish; Ran Raz; Wei Zhan (Electron. Colloquium Comput. Complex., 2020)

Lower Bounds for XOR of Forrelations. - Uma Girish; Ran Raz; Wei Zhan (Electron. Colloquium Comput. Complex., 2020)

Parallel Repetition for the GHZ Game: A Simpler Proof. - Uma Girish; Justin Holmgren; Kunal Mittal; Ran Raz; Wei Zhan (APPROX-RANDOM, 2021)

A Parallel Repetition Theorem for the GHZ Game: A Simpler Proof. - Uma Girish; Justin Holmgren; Kunal Mittal; Ran Raz; Wei Zhan (Electron. Colloquium Comput. Complex., 2021)

Eliminating Intermediate Measurements using Pseudorandom Generators. - Uma Girish; Ran Raz (Electron. Colloquium Comput. Complex., 2021)

Fourier Growth of Parity Decision Trees. - Uma Girish; Avishay Tal; Kewen Wu 001 (Electron. Colloquium Comput. Complex., 2021)

Quantum versus Randomized Communication Complexity, with Efficient Players. - Uma Girish; Ran Raz; Avishay Tal (Comput. Complex., 2022)

Parallel Repetition For All 3-Player Games Over Binary Alphabet. - Uma Girish; Justin Holmgren; Kunal Mittal; Ran Raz; Wei Zhan (Electron. Colloquium Comput. Complex., 2022)

Polynomial Bounds On Parallel Repetition For All 3-Player Games With Binary Inputs. - Uma Girish; Kunal Mittal; Ran Raz; Wei Zhan (Electron. Colloquium Comput. Complex., 2022)

Trade-Offs Between Entanglement and Communication. - Srinivasan Arunachalam; Uma Girish (CCC, 2023)

Fourier Growth of Communication Protocols for XOR Functions. - Uma Girish; Makrand Sinha; Avishay Tal; Kewen Wu 001 (FOCS, 2023)

Is Untrusted Randomness Helpful? - Uma Girish; Ran Raz; Wei Zhan (ITCS, 2023)

One Clean Qubit Suffices for Quantum Communication Advantage. - Srinivasan Arunachalam; Uma Girish; Noam Lifshitz (Electron. Colloquium Comput. Complex., 2023)

Quantum Logspace Computations are Verifiable. - Uma Girish; Ran Raz; Wei Zhan (Electron. Colloquium Comput. Complex., 2023)

Trade-offs between Entanglement and Communication. - A. Srinivasan; Uma Girish (Electron. Colloquium Comput. Complex., 2023)

The Power of Adaptivity in Quantum Query Algorithms. - Uma Girish; Makrand Sinha; Avishay Tal; Kewen Wu 001 (STOC, 2024)

Quantum versus Classical Communication and Query Complexity - Uma Girish (2024)

Forrelation is Extremally Hard. - Uma Girish; Rocco A. Servedio (Electron. Colloquium Comput. Complex., 2025)

Comparing classical and quantum conditional disclosure of secrets. - Uma Girish; Alex May 003; Leo Orshansky; Chris Waddell (IACR Cryptol. ePrint Arch., 2025)