匹配门区域大小不超过4的全息算法的崩溃定理
A Collapse Theorem for Holographic Algorithms with Matchgates on Domain Size at Most 4
摘要:
匹配门全息算法是设计多项式时间计算的一种新方法。它使用Kasteleyn的算法进行完美匹配,更重要的是全息还原。全息归约的两个基本参数是基础问题的域尺寸$k$和基尺寸$\ell$。全息归约通过映射到维度为$2^{\ell}$的线性空间(的张量积空间)的线性变换将计算变换为匹配门。我们证明了一个尖锐的基坍缩定理,它表明,对于区域大小为3和4,所有非平凡的全息约化的基大小$\ell$分别坍缩为1和2。主要的证明技术是匹配门恒等式和匹配门签名的群性质。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。