On Blockwise Symmetric Matchgate Signatures and Higher Domain #CSP

07/03/2017

∙

by   Zhiguo Fu, et al.

∙

0

∙

share

For any n≥ 3 and q≥ 3, we prove that the Equality function (=_n) on n variables over a domain of size q cannot be realized by matchgates under holographic transformations. This is a consequence of our theorem on the structure of blockwise symmetric matchgate signatures. the rank of the matrix form of the blockwise symmetric standard signatures, has the implication that the standard holographic algorithms based on matchgates, a methodology known to be universal for #CSP over the Boolean domain, cannot produce P-time algorithms for planar #CSP over any higher domain q≥ 3.