Fast counting with tensor networks
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 theoreti...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
SciPost
2019-11-01
|
Series: | SciPost Physics |
Online Access: | https://scipost.org/SciPostPhys.7.5.060 |