Some structural properties of low-rank matrices related to computational complexity

We consider the conjecture stating that a matrix with rank o(n) and ones on the main diagonal must contain nonzero entries on a 2 2 submatrix with one entry on the main diagonal. We show that a slightly stronger conjecture implies that an explicit linear transformation cannot be computed by linear size and logarithmic depth circuits. We prove some partial results supporting the conjecture.