In this work we compare numerically different families of nested quadrature points, i.e. the classic Clenshaw{Curtis and various kinds of Leja points, in the context of the quasi-optimal sparse grid approximation of random elliptic PDEs. Numerical evidence suggests that the performances of both families are essentially comparable within such framework.