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
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· arXiv.org· 8 citations
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.
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
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...