R. Servedio

activity

20002023

most citedImproved Bounds on Quantum Learning Algorithms

72 citations · 264 across the 33 of their papers we have counts for

collaborators

Showing 2021 · cs.DSShow all

2 papers · 2 filters

cs.DS2021

Near-Optimal Average-Case Approximate Trace Reconstruction from Few Traces

Xi Chen, Anindya De, Chin Ho Lee +2

In the standard trace reconstruction problem, the goal is to \emph{exactly} reconstruct an unknown source string $x \in {0, 1}^{n}$ from independent "traces", which are cop…

cs.DS2021

Approximating Sumset Size

Anindya De, Shivam Nadimpalli, Rocco A. Servedio

Given a subset $A$ of the $n$ -dimensional Boolean hypercube $F_{2}^{n}$ , the sumset $A + A$ is the set ${a + a^{'} : a, a^{'} \in A}$ where addition is in $F_{2}^{n}$ . Sumsets pla…