Uma Girish

According to our database, Uma Girish authored at least 21 papers between 2021 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Magic and communication complexity.

Uma Girish, Alex May, Natalie Parham, Henry Yuen

CoRR, October, 2025

Fourier Spectrum of Noisy Quantum Algorithms.

Uma Girish

CoRR, October, 2025

Comparing classical and quantum conditional disclosure of secrets.

Uma Girish, Alex May, Leo Orshansky, Chris Waddell

IACR Cryptol. ePrint Arch., 2025

Forrelation is Extremally Hard.

Uma Girish, Rocco A. Servedio

Electron. Colloquium Comput. Complex., 2025

2024

Quantum versus Classical Communication and Query Complexity

Uma Girish

PhD thesis, 2024

The Power of Adaptivity in Quantum Query Algorithms.

Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Quantum Logspace Computations are Verifiable.

Uma Girish, Ran Raz, Wei Zhan

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

2023

Trade-offs between Entanglement and Communication.

A. Srinivasan, Uma Girish

Electron. Colloquium Comput. Complex., 2023

One Clean Qubit Suffices for Quantum Communication Advantage.

Srinivasan Arunachalam, Uma Girish, Noam Lifshitz

Electron. Colloquium Comput. Complex., 2023

Is Untrusted Randomness Helpful?

Uma Girish, Ran Raz, Wei Zhan

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Fourier Growth of Communication Protocols for XOR Functions.

Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Trade-Offs Between Entanglement and Communication.

Srinivasan Arunachalam, Uma Girish

Proceedings of the 38th Computational Complexity Conference, 2023

2022

Parallel repetition for all 3-player games over binary alphabet.

Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Eliminating Intermediate Measurements Using Pseudorandom Generators.

Uma Girish, Ran Raz

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Polynomial Bounds on Parallel Repetition for All 3-Player Games with Binary Inputs.

Uma Girish, Kunal Mittal, Ran Raz, Wei Zhan

Proceedings of the Approximation, 2022

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

Quantum Versus Randomized Communication Complexity, with Efficient Players.

Uma Girish, Ran Raz, Avishay Tal

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Quantum Logspace Algorithm for Powering Matrices with Bounded Norm.

Uma Girish, Ran Raz, Wei Zhan

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Fourier Growth of Parity Decision Trees.

Uma Girish, Avishay Tal, Kewen Wu

Proceedings of the 36th Computational Complexity Conference, 2021

Lower Bounds for XOR of Forrelations.

Uma Girish, Ran Raz, Wei Zhan

Proceedings of the Approximation, 2021

Parallel Repetition for the GHZ Game: A Simpler Proof.

Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan

Proceedings of the Approximation, 2021