212 research outputs found
Holographic Algorithm with Matchgates Is Universal for Planar CSP Over Boolean Domain
We prove a complexity classification theorem that classifies all counting
constraint satisfaction problems (CSP) over Boolean variables into exactly
three categories: (1) Polynomial-time tractable; (2) P-hard for general
instances, but solvable in polynomial-time over planar graphs; and (3)
P-hard over planar graphs. The classification applies to all sets of local,
not necessarily symmetric, constraint functions on Boolean variables that take
complex values. It is shown that Valiant's holographic algorithm with
matchgates is a universal strategy for all problems in category (2).Comment: 94 page
Approximating Holant problems by winding
We give an FPRAS for Holant problems with parity constraints and
not-all-equal constraints, a generalisation of the problem of counting
sink-free-orientations. The approach combines a sampler for near-assignments of
"windable" functions -- using the cycle-unwinding canonical paths technique of
Jerrum and Sinclair -- with a bound on the weight of near-assignments. The
proof generalises to a larger class of Holant problems; we characterise this
class and show that it cannot be extended by expressibility reductions.
We then ask whether windability is equivalent to expressibility by matchings
circuits (an analogue of matchgates), and give a positive answer for functions
of arity three
A full dichotomy for Holant<sup>c</sup>, inspired by quantum computation
Holant problems are a family of counting problems parameterised by sets of
algebraic-complex valued constraint functions, and defined on graphs. They
arise from the theory of holographic algorithms, which was originally inspired
by concepts from quantum computation. Here, we employ quantum information
theory to explain existing results about holant problems in a concise way and
to derive two new dichotomies: one for a new family of problems, which we call
Holant, and, building on this, a full dichotomy for Holant. These two
families of holant problems assume the availability of certain unary constraint
functions -- the two pinning functions in the case of Holant, and four
functions in the case of Holant -- and allow arbitrary sets of
algebraic-complex valued constraint functions otherwise. The dichotomy for
Holant also applies when inputs are restricted to instances defined on
planar graphs. In proving these complexity classifications, we derive an
original result about entangled quantum states.Comment: 57 pages, combines edited versions of arXiv:1702.00767 and
arXiv:1704.05798 with some new result
New Planar P-time Computable Six-Vertex Models and a Complete Complexity Classification
We discover new P-time computable six-vertex models on planar graphs beyond
Kasteleyn's algorithm for counting planar perfect matchings. We further prove
that there are no more: Together, they exhaust all P-time computable six-vertex
models on planar graphs, assuming #P is not P. This leads to the following
exact complexity classification: For every parameter setting in
for the six-vertex model, the partition function is either (1) computable in
P-time for every graph, or (2) #P-hard for general graphs but computable in
P-time for planar graphs, or (3) #P-hard even for planar graphs. The
classification has an explicit criterion. The new P-time cases in (2) provably
cannot be subsumed by Kasteleyn's algorithm. They are obtained by a non-local
connection to #CSP, defined in terms of a "loop space".
This is the first substantive advance toward a planar Holant classification
with not necessarily symmetric constraints. We introduce M\"obius
transformation on as a powerful new tool in hardness proofs for
counting problems.Comment: 61 pages, 16 figures. An extended abstract appears in SODA 202
Approximate Counting via Correlation Decay on Planar Graphs
We show for a broad class of counting problems, correlation decay (strong
spatial mixing) implies FPTAS on planar graphs. The framework for the counting
problems considered by us is the Holant problems with arbitrary constant-size
domain and symmetric constraint functions. We define a notion of regularity on
the constraint functions, which covers a wide range of natural and important
counting problems, including all multi-state spin systems, counting graph
homomorphisms, counting weighted matchings or perfect matchings, the subgraphs
world problem transformed from the ferromagnetic Ising model, and all counting
CSPs and Holant problems with symmetric constraint functions of constant arity.
The core of our algorithm is a fixed-parameter tractable algorithm which
computes the exact values of the Holant problems with regular constraint
functions on graphs of bounded treewidth. By utilizing the locally tree-like
property of apex-minor-free families of graphs, the parameterized exact
algorithm implies an FPTAS for the Holant problem on these graph families
whenever the Gibbs measure defined by the problem exhibits strong spatial
mixing. We further extend the recursive coupling technique to Holant problems
and establish strong spatial mixing for the ferromagnetic Potts model and the
subgraphs world problem. As consequences, we have new deterministic
approximation algorithms on planar graphs and all apex-minor-free graphs for
several counting problems
- …