Author

S. Ben-David

2 papers indexed here

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

Distributional Quantum Query Complexity

Quantum query complexity enjoys a variety of pleasing joint computation properties: for example, a composition theorem asserting $Q(f\circ g)=\Theta(Q(f)Q(g))$ for all Boolean functions $f$ and $g$; a direct sum theorem asserting that computing $k$ copies of a function (or search problem) costs $\Omega(k)$ times as muc...

S. Ben-David, M. H. Ebtehaj · 0 citations

Preprint Sep 2026

Randomized query complexity can beat certificate complexity

A long-standing open question in query complexity asks whether there is a total Boolean function f with R(f)<<C(f), where R(f) and C(f) denote its bounded-error randomized query complexity and certificate complexity, respectively. We construct a function with R(f) = O~(sqrt{C(f)}), which is optimal up to log factors. T...

S. Ben-David, Robin Kothari · 1 citation · ⚡1