  By means of a Fourier optimization framework, we improve the current
asymptotic bounds under GRH for two classical problems in number theory: the
problem of estimating the least quadratic non-residue modulo a prime, and the
problem of estimating the least prime in an arithmetic progression.
