Sotabase

Career

· Postdoctoral Research Scientist, Columbia University2024–
· Bachelor's in Mathematics and Computer Science, Chennai Mathematical Institute
· Master's in Computer Science, Chennai Mathematical Institute
· PhD Student, Princeton University

Publications (23)

Quantum versus Randomized Communication Complexity, with Efficient Players
Computational Complexity · 2019
18
cited
Fourier growth of parity decision trees
Empirical Software Engineering · 2021
16
cited
Quantum Logspace Algorithm for Powering Matrices with Bounded Norm
Electron. Colloquium Comput. Complex. · 2020
16
cited
Lower Bounds for XOR of Forrelations
Electron. Colloquium Comput. Complex. · 2020
13
cited
Eliminating Intermediate Measurements using Pseudorandom Generators
Electron. Colloquium Comput. Complex. · 2021
9
cited
Parallel Repetition for the GHZ Game: A Simpler Proof
International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques · 2021
9
cited
Parallel repetition for all 3-player games over binary alphabet
Symposium on the Theory of Computing · 2022
8
cited
Polynomial Bounds On Parallel Repetition For All 3-Player Games With Binary Inputs
Electron. Colloquium Comput. Complex. · 2022
8
cited
One Clean Qubit Suffices for Quantum Communication Advantage
Electron. Colloquium Comput. Complex. · 2023
7
cited
The Power of Adaptivity in Quantum Query Algorithms
Symposium on the Theory of Computing · 2023
6
cited
Quantum Logspace Computations are Verifiable
Electron. Colloquium Comput. Complex. · 2023
5
cited
Comparing classical and quantum conditional disclosure of secrets
IACR Cryptology ePrint Archive · 2025
4
cited
Fourier Growth of Communication Protocols for XOR Functions
IEEE Annual Symposium on Foundations of Computer Science · 2023
4
cited
Is Untrusted Randomness Helpful?
Information Technology Convergence and Services · 2023
4
cited
Trade-offs between Entanglement and Communication
Electron. Colloquium Comput. Complex. · 2023
3
cited
Asia's First Lady of Coffee
2007
1
cited
Forrelation is Extremally Hard
Electron. Colloquium Comput. Complex. · 2025
1
cited
Fourier Spectrum of Noisy Quantum Algorithms
Electron. Colloquium Comput. Complex. · 2025
1
cited
Magic and communication complexity
arXiv.org · 2025
1
cited
Expansion in the Johnson Graph
2019
Sotabase
Uma Girish | Researcher Profile | Sotabase | Sotabase