Based on the recent breakthrough of Huang (2019), we show that for any total\nBoolean function $f$,\n $\\bullet \\quad \\mathrm{deg}(f) = O(\\widetilde{\\mathrm{deg}}(f)^2)$: The\ndegree of $f$ is at most quadratic in the approximate degree of $f$. This is\noptimal as witnessed by the OR function.\n $\\bullet \\quad \\mathrm{D}(f) = O(\\mathrm{Q}(f)^4)$: The deterministic query\ncomplexity of $f$ is at most quartic in the quantum query complexity of $f$.\nThis matches the known separation (up to log factors) due to Ambainis, Balodis,\nBelovs, Lee, Santha, and Smotrovs (2017).\n We apply these results to resolve the quantum analogue of the\nAanderaa--Karp--Rosenberg conjecture. We show that if $f$ is a nontrivial\nmonotone graph property of an $n$-vertex graph specified by its adjacency\nmatrix, then $\\mathrm{Q}(f)=\\Omega(n)$, which is also optimal. We also show\nthat the approximate degree of any read-once formula on $n$ variables is\n$\\Theta(\\sqrt{n})$.\n