Under the auspices of the Computational Complexity Foundation (CCF)
We give a classification of block-wise symmetric signaturesin the theory of matchgate computations. The main proof techniqueis matchgate identities, a.k.a. useful Grassmann-Pl\"{u}ckeridentities.