Скачать или смотреть TCS+ talk: Shravas Rao (Courant Institute of Mathematical Sciences)

Title: Degree vs. Approximate Degree and Quantum Implications of Huang's
Sensitivity Theorem

Abstract: Based on the recent breakthrough of Huang (2019), we show that
for any total Boolean function f,

The degree of f is at most quadratic in the approximate degree of f.
This is optimal as witnessed by the OR function.
The deterministic query complexity of f is at most quartic in the
quantum query complexity of f. This matches the known separation (up to
log factors) due to Ambainis, Balodis, Belovs, Lee, Santha, and Smotrovs
(2017).

We apply these results to resolve the quantum analogue of the
Aanderaa--Karp--Rosenberg conjecture. We show that if f is a nontrivial
monotone graph property of an n-vertex graph specified by its adjacency
matrix, then Q(f)=Ω(n), which is also optimal. We also show that the
approximate degree of any read-once formula on n variables is Θ(\sqrt(n)).

Based on joint work with Scott Aaronson, Shalev Ben-David, Robin
Kothari, and Avishay Tal.