In this paper, we study linear and quadratic Boolean functions in the context of property testing. We do this by observing that the query complexity of testing properties of linear and quadratic functions can be characterized in terms of the complexity in another model of computation called parity decision trees.

The observation allows us to characterize the testable properties of linear functions in terms of the approximate l1 norm of the Fourier spectrum of an associated function. It also allows us to reprove the (k) lower bound for testing k-linearity due to Blais et al. More interestingly, it rekindles the hope of closing the gap of (k) vs O(klogk) for testing k-linearity by analyzing the randomized parity decision tree complexity of a fairly simple function called Ek that evaluates to 1 if and only if the number of 1s in the input is exactly k. The approach of Blais et al. using communication complexity fails to give anything better than (k) as a lower bound.

In the case of quadratic functions, we prove an adaptive, two-sided (n2) lower bound for testing affine isomorphism to the inner product function. We remark that this bound is tight and furnishes an example of a function for which the trivial algorithm for testing affine isomorphism is the best possible. As a corollary, we obtain an (n2) lower bound for testing the class of Bent functions.