Search Menu
DOE PAGES title logo U.S. Department of Energy
Office of Scientific and Technical Information
Search Scholarly Publications

Title: Fast counting with tensor networks

Journal Article · · SciPost Physics
 [1];  [1];  [2];  [1]
  1. Boston University
  2. University of Central Florida
+ Show Author Affiliations

We introduce tensor network contraction algorithms for counting satisfying assignments of constraint satisfaction problems (#CSPs). We represent each arbitrary #CSP formula as a tensor network, whose full contraction yields the number of satisfying assignments of that formula, and use graph theoretical methods to determine favorable orders of contraction. We employ our heuristics for the solution of #P-hard counting boolean satisfiability (#SAT) problems, namely monotone #1-in-3SAT and #Cubic-Vertex-Cover, and find that they outperform state-of-the-art solvers by a significant margin.

Research Organization:
Boston Univ., MA (United States)
Sponsoring Organization:
USDOE; USDOE Office of Science (SC)
Grant/Contract Number:
FG02-06ER46316
OSTI ID:
1574034
Journal Information:
SciPost Physics, Journal Name: SciPost Physics Journal Issue: 5 Vol. 7; ISSN 2542-4653
Publisher:
Stichting SciPostCopyright Statement
Country of Publication:
Netherlands
Language:
English

References (58)

Survey propagation: An algorithm for satisfiability journal January 2005
Edge Separators of Planar and Outerplanar Graphs With Applications journal March 1993
Planar Separators and Parallel Polygon Triangulation journal December 1995
The complexity of counting colourings and independent sets in sparse graphs and hypergraphs journal November 2000
The complexity of tensor calculus journal June 2002
On the Theory of Matchgate Computations journal October 2007
Tensor Network Contractions for #SAT journal June 2015
The node-deletion problem for hereditary properties is NP-complete journal April 1980
The statistics of dimers on a lattice journal December 1961
A separator theorem for graphs of bounded genus journal September 1984
A practical introduction to tensor networks: Matrix product states and projected entangled pair states journal October 2014
ASlib: A benchmark library for algorithm selection journal August 2016
A massively parallel tensor contraction framework for coupled-cluster computations journal December 2014
Community detection in graphs journal February 2010
Quantum-inspired Boolean states for bounding engineering network reliability assessment journal November 2018
Valiant’s Holant Theorem and matchgate tensors journal September 2007
On the computational complexity of the Jones and Tutte polynomials journal July 1990
Dimer Statistics and Phase Transitions journal February 1963
Community structure in social and biological networks journal June 2002
Dimer problem in statistical mechanics-an exact result journal August 1961
Matrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systems journal March 2008
Constraint satisfaction problems with isolated solutions are hard journal December 2008
Algebraically contractible topological tensor network states journal December 2011
Classical simulation of quantum many-body systems with a tree tensor network journal August 2006
Exact entanglement renormalization for string-net models journal May 2009
Tensor-entanglement-filtering renormalization approach and symmetry-protected topological order journal October 2009
Coarse-graining renormalization by higher-order singular value decomposition journal July 2012
Tensor network algorithm by coarse-graining tensor renormalization on finite periodic lattices journal March 2016
Algorithms for tensor network renormalization journal January 2017
Renormalization of tensor networks using graph-independent local truncations journal January 2018
Evaluating the Jones polynomial with tensor networks journal September 2019
Phase diagram of the 1-in-3 satisfiability problem journal July 2007
Tensor network method for reversible classical computation journal March 2018
Entanglement Renormalization and Topological Order journal February 2008
Accurate Determination of Tensor Network State of Quantum Lattice Models in Two Dimensions journal August 2008
Tensor Network Renormalization journal October 2015
Loop Optimization for Tensor Network Renormalization journal March 2017
Renormalization Group Flows of Hamiltonians Using Tensor Networks journal June 2017
Tensor Renormalization Group Approach to Two-Dimensional Classical Lattice Models journal September 2007
Colloquium : Area laws for the entanglement entropy journal February 2010
Complexity of k-SAT
  • Impagliazzo, R.; Paturi, R.
  • Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity. (Formerly: Structure in Complexity Theory Conference), Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317) https://doi.org/10.1109/CCC.1999.766282
conference January 1999
Analytic and Algorithmic Solution of Random Satisfiability Problems journal June 2002
A Separator Theorem for Planar Graphs journal April 1979
Edge-Deletion Problems journal May 1981
Simulating Quantum Computation by Contracting Tensor Networks journal January 2008
Holographic Algorithms journal January 2008
Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs journal January 2017
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs journal January 1998
Implementing Efficient All Solutions SAT Solvers journal November 2016
On the Structure of Polynomial Time Reducibility journal January 1975
A machine program for theorem-proving journal July 1962
The complexity of satisfiability problems conference January 1978
Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 1 Low-Rank Tensor Decompositions journal January 2016
Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 2 Applications and Future Perspectives journal January 2016
SATzilla: Portfolio-based Algorithm Selection for SAT journal May 2008
A Knowledge Compilation Map journal July 2002
An Improved Decision-DNNF Compiler conference August 2017
Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems text January 2018

Similar Records

Related Subjects

71 CLASSICAL AND QUANTUM MECHANICS
GENERAL PHYSICS
Physics