Uma Girish

Publication Activity (10 Years)

Years Active: 2019-2024
Publications (10 Years): 38

Top Topics

Communication Protocols

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Uma Girish, Ran Raz, Wei Zhan
Quantum Logspace Computations are Verifiable. SOSA (2024)
Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu
The Power of Adaptivity in Quantum Query Algorithms. STOC (2024)
Uma Girish, Ran Raz, Wei Zhan
Quantum Logspace Computations are Verifiable. CoRR (2023)
Uma Girish, Ran Raz, Wei Zhan
Is Untrusted Randomness Helpful? ITCS (2023)
Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu
The Power of Adaptivity in Quantum Query Algorithms. CoRR (2023)
Uma Girish, Ran Raz, Wei Zhan
Quantum Logspace Computations are Verifiable. Electron. Colloquium Comput. Complex. (2023)
Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu
Fourier Growth of Communication Protocols for XOR Functions. CoRR (2023)
Srinivasan Arunachalam, Uma Girish
Trade-offs between Entanglement and Communication. CoRR (2023)
Srinivasan Arunachalam, Uma Girish
Trade-Offs Between Entanglement and Communication. CCC (2023)
A. Srinivasan, Uma Girish
Trade-offs between Entanglement and Communication. Electron. Colloquium Comput. Complex. (2023)
Srinivasan Arunachalam, Uma Girish, Noam Lifshitz
One Clean Qubit Suffices for Quantum Communication Advantage. CoRR (2023)
Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu
Fourier Growth of Communication Protocols for XOR Functions. FOCS (2023)
Srinivasan Arunachalam, Uma Girish, Noam Lifshitz
One Clean Qubit Suffices for Quantum Communication Advantage. Electron. Colloquium Comput. Complex. (2023)
Uma Girish, Ran Raz, Avishay Tal
Quantum versus Randomized Communication Complexity, with Efficient Players. Comput. Complex. 31 (2) (2022)
Uma Girish, Ran Raz
Eliminating Intermediate Measurements Using Pseudorandom Generators. ITCS (2022)
Uma Girish, Kunal Mittal, Ran Raz, Wei Zhan
Polynomial Bounds On Parallel Repetition For All 3-Player Games With Binary Inputs. Electron. Colloquium Comput. Complex. (2022)
Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan
Parallel Repetition For All 3-Player Games Over Binary Alphabet. Electron. Colloquium Comput. Complex. (2022)
Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan
Parallel Repetition For All 3-Player Games Over Binary Alphabet. CoRR (2022)
Uma Girish, Kunal Mittal, Ran Raz, Wei Zhan
Polynomial Bounds On Parallel Repetition For All 3-Player Games With Binary Inputs. CoRR (2022)
Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan
Parallel repetition for all 3-player games over binary alphabet. STOC (2022)
Uma Girish, Kunal Mittal, Ran Raz, Wei Zhan
Polynomial Bounds on Parallel Repetition for All 3-Player Games with Binary Inputs. APPROX/RANDOM (2022)
Uma Girish, Ran Raz
Eliminating Intermediate Measurements using Pseudorandom Generators. Electron. Colloquium Comput. Complex. 28 (2021)
Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan
Parallel Repetition for the GHZ Game: A Simpler Proof. APPROX-RANDOM (2021)
Uma Girish, Avishay Tal, Kewen Wu
Fourier Growth of Parity Decision Trees. Computational Complexity Conference (2021)
Uma Girish, Ran Raz, Wei Zhan
Quantum Logspace Algorithm for Powering Matrices with Bounded Norm. ICALP (2021)
Uma Girish, Ran Raz, Avishay Tal
Quantum Versus Randomized Communication Complexity, with Efficient Players. ITCS (2021)
Uma Girish, Avishay Tal, Kewen Wu
Fourier Growth of Parity Decision Trees. Electron. Colloquium Comput. Complex. 28 (2021)
Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan
A Parallel Repetition Theorem for the GHZ Game: A Simpler Proof. Electron. Colloquium Comput. Complex. 28 (2021)
Uma Girish, Avishay Tal, Kewen Wu
Fourier Growth of Parity Decision Trees. CoRR (2021)
Uma Girish, Ran Raz
Eliminating Intermediate Measurements using Pseudorandom Generators. CoRR (2021)
Uma Girish, Ran Raz, Wei Zhan
Lower Bounds for XOR of Forrelations. APPROX-RANDOM (2021)
Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan
Parallel Repetition for the GHZ Game: A Simpler Proof. CoRR (2021)
Uma Girish, Ran Raz, Wei Zhan
Quantum Logspace Algorithm for Powering Matrices with Bounded Norm. Electron. Colloquium Comput. Complex. 27 (2020)
Uma Girish, Ran Raz, Wei Zhan
Lower Bounds for XOR of Forrelations. Electron. Colloquium Comput. Complex. 27 (2020)
Uma Girish, Ran Raz, Wei Zhan
Quantum Logspace Algorithm for Powering Matrices with Bounded Norm. CoRR (2020)
Uma Girish, Ran Raz, Wei Zhan
Lower Bounds for XOR of Forrelations. CoRR (2020)
Uma Girish, Ran Raz, Avishay Tal
Quantum versus Randomized Communication Complexity, with Efficient Players. CoRR (2019)
Uma Girish, Ran Raz, Avishay Tal
Quantum versus Randomized Communication Complexity, with Efficient Players. Electron. Colloquium Comput. Complex. 26 (2019)