It is well known that the upper bound on the number of quadratic residues mod n is approximately n/2 and it reaches this bound for n prime.

Is there any similar lower bound on the number of quadratic residues mod n?

Some numerical experiments indicate that it would be somewhere at n^0.65 for highly composite n with many small factors, but can you point me at any more rigorous treatment of the subject?