We provide a graphical treatment of SAT and \#SAT on equal footing. Instances of \#SAT can be represented as tensor networks in a standard way. These tensor networks are interpreted by diagrams of the ZH-calculus: a system to reason about tensors over $\mathbb{C}$ in terms of diagrams built from simple generators, in which computation may be carried out by \emph{transformations of diagrams alone}. In general, nodes of ZH diagrams take parameters over $\mathbb{C}$ which determine the tensor coefficients; for the standard representation of \#SAT instances, the coefficients take the value $0$ or $1$. Then, by choosing the coefficients of a diagram to range over $\mathbb B$, we represent the corresponding instance of SAT. Thus, by interpreting a diagram either over the boolean semiring or the complex numbers, we instantiate either the \emph{decision} or \emph{counting} version of the problem. We find that for classes known to be in P, such as $2$SAT and \#XORSAT, the existence of appropriate rewrite rules allows for efficient simplification of the diagram, producing the solution in polynomial time. In contrast, for classes known to be NP-complete, such as $3$SAT, or \#P-complete, such as \#$2$SAT, the corresponding rewrite rules introduce hyperedges to the diagrams, in numbers which are not easily bounded above by a polynomial. This diagrammatic approach unifies the diagnosis of the complexity of CSPs and \#CSPs and shows promise in aiding tensor network contraction-based algorithms.
翻译:我们平等地提供SAT 和 {QSAT 的图形处理 。 ⁇ SAT 的节点可以用标准的方式以 Exor 网络的形式表示 。 这些 Exor 网络可以用 ZH 计算器的图表来解释 : 一个系统来解释 $\ mathbb{C} $ 的 Exronor, 这个系统可以解释 $ mathbb{C$, 这个系统可以用简单的发电机建造的图表来解释 $, 计算方法可以用 emph{ transferations 来进行。 一般来说, ZH 图表的节点取参数超过 $\ mathb{C}, 用来确定 ARor 系数; 对于 ZSAT 的标准表达器, 系数取 $ $ 或$ 美元 ; 然后, 通过选择 图表的系数来解释 $ 。 因此, 通过一个图表来解释一个图表, ===xxxxx 的 。