The stabilizer rank of a quantum state ψ is the minimal r such that | iψ = Σrj =1 cj |ji for cj 2 C and stabilizer states 'j . The running time of several classical simulation methods for quantum circuits is determined by the stabilizer rank of the n-th tensor power of single-qubit magic states. We prove a lower bound of Ω (n) on the stabilizer rank of such states, improving a previous lower bound of Ω (p √n) of Bravyi, Smith and Smolin . Further, we prove that for a sufficiently small constant δ, the stabilizer rank of any state which is δclose to those states is Ω(p √n/ log n). This is the first non-trivial lower bound for approximate stabilizer rank. Our techniques rely on the representation of stabilizer states as quadratic functions over affine subspaces of Fn2 , and we use tools from analysis of boolean functions and complexity theory. The proof of the first result involves a careful analysis of directional derivatives of quadratic polynomials, whereas the proof of the second result uses Razborov-Smolensky low degree polynomial approximations and correlation bounds against the majority function.