On the Randomized Complexity of Minimizing a Convex Quadratic Function