9 papers
Separating quantum circuits from classical LLMs
Srinivasan Arunachalam, Arkopal Dutt, Hari Krovi +1
Modern large language models - transformers and diffusion language models - are built around two canonical algorithmic tasks: prediction and generation. We prove unconditional sepa…
No low-degree tests for quantum states
Omar Alrabiah, Srinivasan Arunachalam, Sabee Grewal +1
We study the problem of testing low-degree phase states, namely m-qudit quantum states of the form , where is a degree- p…
Optimal Stabilizer Testing and Learning with Limited Quantum Memory
Srinivasan Arunachalam, Louis Schatzki
We study stabilizer state testing and learning with limited coherent quantum memory. Here an algorithm sequentially receives copies of an unknown -qubit state, but may keep only…
Tomography of quantum states with bounded extent
Srinivasan Arunachalam, Arkopal Dutt
We give a general framework for tomography of states that have bounded-extent with respect to a structured class of states. Let be a family of -qubit states such th…
An algorithmic Polynomial Freiman-Ruzsa theorem
Davi Castro-Silva, Jop Briët, Srinivasan Arunachalam +2
We provide algorithmic versions of the Polynomial Freiman-Ruzsa theorem of Gowers, Green, Manners, and Tao (Ann. of Math., 2025). In particular, we give a polynomial-time algorithm…
Learning depth-3 circuits via quantum agnostic boosting
Srinivasan Arunachalam, Arkopal Dutt, Alexandru Gheorghiu +1
We initiate the study of quantum agnostic learning of phase states with respect to a function class : given copies of an unk…