We study circuits for linear maps defined by n times n Boolean matrices.

We consider three circuit models: OR-circuits, SUM-circuits, and XOR-circuits.

Our focus is on separating these models in terms of their circuit complexities.

We obtain matrices with OR-circuits of size O(n) which require large SUM-circuits.

We prove a conditional quadratic lower bound for an OR–XOR circuit rewriting task.