5 citations · 12 across the 9 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.CC2020★ 5 cited
An Optimal Separation of Randomized and Quantum Query Complexity
Alexander A. Sherstov, Andrey A. Storozhenko, Pei Wu
We prove that for every decision tree, the absolute values of the Fourier coefficients of a given order sum to at most $c^{\ell}\sqrt{\binom{d}{\ell}(1+\log n)^{\ell-1}…
cs.CC2020★ 1 cited
Quantum Communication Complexity of Distribution Testing
Aleksandrs Belovs, Arturo Castellanos, François Le Gall +2
The classical communication complexity of testing closeness of discrete distributions has recently been studied by Andoni, Malkin and Nosatzki (ICALP'19). In this problem, two play…