Thesis. A version of my PhD thesis can be found here.
All my papers and preprints are available at DBLP or Google Scholar.
List of papers. Publications and preprints are listed in reverse chronological order by the latest publication year. Journal and conference versions of the same paper are grouped together.
Fourier Entropy Bounds via Approximations
with Nitin Saurabh.
Preprint, 2026 · arXiv:2611.06451.
Improved Exact and Approximate Quantum Fourier Transforms from Multiplication
with Chandrima Kayal, Rajat Mittal and Nitin Saurabh.
Preprint, 2026 · arXiv:2611.06341.
Optimal Compression with Quantum Retrieval
with Shyam Dhamapurkar, Mohit Garg and Jaikumar Radhakrishnan.
Preprint, 2026 · arXiv:2610.06702.
Spectral Shadows: When Communication Complexity Meets Linear Invariance Testing
with Swarnalipa Datta, Arijit Ghosh, Chandrima Kayal and Manmatha Roy.
Preprint, 2026 · arXiv:2601.06828.
Bounds for Hardness Condensation in the Query Model
with Chandrima Kayal, Rajat Mittal, Sai Soumya Nalli, Karthikeya Polisetty, Jayalal Sarma and Nitin Saurabh.
Spectral Norm, Economical Sieve, and Linear Invariance Testing of Boolean Functions
with Swarnalipa Datta, Arijit Ghosh, Chandrima Kayal and Manmatha Roy.
STACS, 2026 · arXiv:2308.02662.
On the Composition of Randomized Query Complexity and Approximate Degree
with Sourav Chakraborty, Chandrima Kayal, Rajat Mittal, Swagato Sanyal and Nitin Saurabh.
Computational Complexity, 2026 · RANDOM, 2023.
Testing Isomorphism of Boolean Functions over Finite Abelian Groups
with Swarnalipa Datta, Arijit Ghosh, Chandrima Kayal and Manmatha Roy.
Low Degree Local Correction Over the Boolean Cube
with Prashanth Amireddy, Amik Raj Behera, Srikanth Srinivasan and Madhu Sudan.
Separations Between Combinatorial Measures for Transitive Functions
with Sourav Chakraborty and Chandrima Kayal.
Discrete Mathematics & Theoretical Computer Science, 2025 · ICALP, 2022.
Quantum Advantage with Faulty Oracle
with David Rasmussen Lolck and Laura Mančinska.
Preprint, 2024 · arXiv:2411.04931.
Approximate Degree Composition for Recursive Functions
with Sourav Chakraborty, Chandrima Kayal, Rajat Mittal and Nitin Saurabh.
On the Communication Complexity of Finding a King in a Tournament
with Nikhil S. Mande, Swagato Sanyal and Nitin Saurabh.
Local Correction of Linear Functions over the Boolean Cube
with Prashanth Amireddy, Amik Raj Behera, Srikanth Srinivasan and Madhu Sudan.
Randomized and Quantum Query Complexities of Finding a King in a Tournament
with Nikhil S. Mande and Nitin Saurabh.
Counting and Sampling from Substructures Using Linear Algebraic Queries
with Arijit Bishnu, Arijit Ghosh and Gopinath Mishra.
Symmetry and Quantum Query-to-Communication Simulation
with Sourav Chakraborty, Arkadev Chattopadhyay, Peter Høyer, Nikhil S. Mande and Ronald de Wolf.
STACS, 2022 · Combined full version with the CCC 2020 paper: arXiv:2012.05233 (revised September 2026).
Disjointness Through the Lens of Vapnik–Chervonenkis Dimension: Sparsity and Beyond
with Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh and Gopinath Mishra.
Computational Complexity, 2022 · RANDOM, 2020.
Query Complexity of Global Minimum Cut
with Arijit Bishnu, Arijit Ghosh and Gopinath Mishra.
Tight Chang’s-Lemma-Type Bounds for Boolean Functions
with Sourav Chakraborty, Nikhil S. Mande, Rajat Mittal, Tulasimohan Molli and Swagato Sanyal.
Two New Results about Quantum Exact Learning
with Srinivasan Arunachalam, Sourav Chakraborty, Troy Lee and Ronald de Wolf.
Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead
with Sourav Chakraborty, Arkadev Chattopadhyay and Nikhil S. Mande.
CCC, 2020. A preliminary version was presented at QIP 2020.
Technical reports
Computational Complexity of Discrete Problems (Dagstuhl Seminar 23111)
with Anna Gál, Meena Mahajan, Rahul Santhanam and Till Tantau.