We prove that the integrality gap of the Goemans--Linial semidefinite programming relaxation for the Sparsest Cut Problem is $Ω(\sqrt{\log n})$ on inputs with $n$ vertices.