Uma Girish

The Power of Adaptivity in Quantum Query Algorithms

with Makrand Sinha, Avishay Tal and Kewen Wu.

In STOC 2024, QIP 2024. Arxiv

Trade-offs between Entanglement and Communication

with Srinivasan Arunachalam.

In CCC 2023, QIP 2024. Arxiv

One Clean Qubit Suffices for Quantum Communication Advantage

with Srinivasan Arunachalam and Noam Lifshitz.

In TQC 2024. Arxiv

Fourier Growth of Communication Protocols for XOR Functions

with Makrand Sinha, Avishay Tal and Kewen Wu.

In FOCS 2023. 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 versus Randomized Communication Complexity, with Efficient Players

with Ran Raz and Avishay Tal.

In QIP 2020, ITCS 2021. ECCC, Arxiv.

Quantum Logspace Computations are Verifiable

with Ran Raz and Wei Zhan.

In SOSA 2024. Arxiv

Is Untrusted Randomness Helpful?

with Ran Raz and Wei Zhan.

In ITCS 2023. Proceedings

Eliminating Intermediate Measurements using Pseudorandom Generators

with Ran Raz.

In ITCS 2022. ECCC, Arxiv.

Quantum Logspace Algorithm for Powering Matrices with Bounded Norm

with Ran Raz and Wei Zhan.

In QIP 2021, ICALP 2021. ECCC, Arxiv.

Polynomial Bounds On Parallel Repetition For All 3-Player Games With Binary Inputs

with Kunal Mittal, Ran Raz and Wei Zhan.

APPROX/RANDOM 2022. ECCC

Parallel Repetition For All 3-Player Games Over Binary Alphabet

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

In STOC 2022. 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.