One of complexity theory’s “greatest hits” is Håstad‘s Fourier-analytic proof that constant-depth Boolean circuits cannot approximate the Parity function. We extend this argument to the case of constant-depth quantum circuits. Connections to other open questions in Analysis of Boolean Functions, such as the approximate degree of AC0, are highlighted.