Tensor network rewriting strategies for satisfiability and counting

10Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

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 C in terms of diagrams built from simple generators, in which computation may be carried out by transformations of diagrams alone. In general, nodes of ZH diagrams take parameters over 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 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 decision or counting version of the problem. We find that for classes known to be in P, such as 2SAT 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 3SAT, or #P-complete, such as #2SAT, 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.

References Powered by Scopus

The complexity of theorem-proving procedures

4115Citations
N/AReaders
Get full text

Tensor renormalization group approach to two-dimensional classical lattice models

465Citations
N/AReaders
Get full text

Interacting quantum observables: Categorical algebra and diagrammatics

261Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Hyperoptimized Approximate Contraction of Tensor Networks with Arbitrary Geometry

13Citations
N/AReaders
Get full text

Completeness for arbitrary finite dimensions of ZXW-calculus, a unifying calculus

10Citations
N/AReaders
Get full text

Circuit Extraction for ZX-Diagrams Can Be #P-Hard

10Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

de Beaudrap, N., Kissinger, A., & Meichanetzidis, K. (2021). Tensor network rewriting strategies for satisfiability and counting. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 340, pp. 46–59). Open Publishing Association. https://doi.org/10.4204/EPTCS.340.3

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 5

63%

Researcher 3

38%

Readers' Discipline

Tooltip

Physics and Astronomy 4

57%

Computer Science 3

43%

Save time finding and organizing research with Mendeley

Sign up for free