A Collapse Theorem for Holographic Algorithms with Matchgates on Domain Size at Most 4

Abstract

Holographic algorithms with matchgates are a novel approach to design polynomial time computation. It uses Kasteleyn's algorithm for perfect matchings, and more importantly a holographic reduction . The two fundamental parameters of a holographic reduction are the domain size $k$ of the underlying problem, and the basis size $\ell$. A holographic reduction transforms the computation to matchgates by a linear transformation that maps to (a tensor product space of) a linear space of dimension $2^{\ell }$. We prove a sharp basis collapse theorem, that shows that for domain size 3 and 4, all non-trivial holographic reductions have basis size $\ell$ collapse to 1 and 2 respectively. The main proof techniques are Matchgates Identities, and a Group Property of matchgates signatures.

24 pages, 2 figures

References in corpus (2)

• A Complete Dichotomy Rises from the Capture of Vanishing Signatures
• The Complexity of Planar Boolean #CSP with Complex Weights