Skip to content

Author

Srinivasan Arunachalam

We have 5 of 19 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Quantum impurity models: easy at equilibrium, universal in motion

A quantum impurity model describes a small interacting subsystem embedded into a large bath of free fermions. Here we study the computational complexity of calculating the ground energy, thermal equilibrium, and dynamical properties of these models. Our work reveals a sharp contrast: equilibrium properties can be effic...

Srinivasan Arunachalam, S. Bravyi, Anirban Narayan Chowdhury et al. · 1 citation

Optimal Stabilizer Testing and Learning with Limited Quantum Memory

The main results identify coherent quantum memory as the resource enabling the usual separation between stabilizer testing and learning, and prove an exponential lower bound for purity testing even when the memory may be left coherent throughout the protocol.

Srinivasan Arunachalam, L. Schatzki · 8 citations
Sep 2026

Learning Random Quantum Circuits and the Emergence of Pseudorandomness

The main idea behind the algorithm is a local correlation criterion that identifies gates in the final layer without learning their entire backward light cones, avoiding a bottleneck in the previous approaches.

Srinivasan Arunachalam, Qi-Zhao Huang, Makrand Sinha · 0 citations
Preprint Aug 2026

Separating quantum circuits from classical LLMs

This work proves unconditional separations between low-depth quantum computation and the corresponding bounded-resource classical language-model architectures in both regimes, and initiates the study of quantum advantage in the era of large language models.

Srinivasan Arunachalam, Arkopal Dutt, H. Krovi et al. · 2 citations
Preprint Sep 2026

Marton's conjecture in polynomial time

Gowers, Green, Manners, and Tao (Annals'25) recently resolved Marton's polynomial Freiman-Ruzsa conjecture. We give an algorithmic counterpart to their result: given uniform sampling and membership-oracle access to a set $A \subseteq \mathbb{F}_2^n$ with doubling constant at most $K$, our algorithm outputs a subspace o...

Srinivasan Arunachalam, Arkopal Dutt, Sabee Grewal et al. · 3 citations · ⚡1

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.