30 research outputs found
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
A New Holant Dichotomy Inspired by Quantum Computation
Holant problems are a framework for the analysis of counting complexity problems on graphs. This framework is simultaneously general enough to encompass many counting problems on graphs and specific enough to allow the derivation of dichotomy results, partitioning all problems into those which are in FP and those which are #P-hard. The Holant framework is based on the theory of holographic algorithms, which was originally inspired by concepts from quantum computation, but this connection appears not to have been explored before.
Here, we employ quantum information theory to explain existing results in a concise way and to derive a dichotomy for a new family of problems, which we call Holant^+. This family sits in between the known families of Holant^*, for which a full dichotomy is known, and Holant^c, for which only a restricted dichotomy is known. Using knowledge from entanglement theory -- both previously existing work and new results of our own -- we prove a full dichotomy theorem for Holant^+, which is very similar to the restricted Holant^c dichotomy and may thus be a stepping stone to a full dichotomy for that family
From Holant to Quantum Entanglement and Back
Holant problems are intimately connected with quantum theory as tensor networks. We first use techniques from Holant theory to derive new and improved results for quantum entanglement theory. We discover two particular entangled states |??? of 6 qubits and |??? of 8 qubits respectively, that have extraordinary closure properties in terms of the Bell property. Then we use entanglement properties of constraint functions to derive a new complexity dichotomy for all real-valued Holant problems containing a signature of odd arity. The signatures need not be symmetric, and no auxiliary signatures are assumed
Clifford Gates in the Holant Framework
We show that the Clifford gates and stabilizer circuits in the quantum
computing literature, which admit efficient classical simulation, are
equivalent to affine signatures under a unitary condition. The latter is a
known class of tractable functions under the Holant framework.Comment: 14 page
On the Complexity of #CSP^d
Counting CSP^d is the counting constraint satisfaction problem (#CSP in short) restricted to the instances where every variable occurs a multiple of d times. This paper revisits tractable structures in #CSP and gives a complexity classification theorem for #CSP^d with algebraic complex weights. The result unifies affine functions (stabilizer states in quantum information theory) and related variants such as the local affine functions, the discovery of which leads to all the recent progress on the complexity of Holant problems.
The Holant is a framework that generalizes counting CSP. In the literature on Holant problems, weighted constraints are often expressed as tensors (vectors) such that projections and linear transformations help analyze the structure. This paper gives an example showing that different classes of tensors distinguished by these algebraic operations may share the same closure property under tensor product and contraction
A complete dichotomy for complex-valued holant<sup>c</sup>
Holant problems are a family of counting problems on graphs, parametrised by sets of complex-valued functions of Boolean inputs. Holant^c denotes a subfamily of those problems, where any function set considered must contain the two unary functions pinning inputs to values 0 or 1. The complexity classification of Holant problems usually takes the form of dichotomy theorems, showing that for any set of functions in the family, the problem is either #P-hard or it can be solved in polynomial time. Previous such results include a dichotomy for real-valued Holant^c and one for Holant^c with complex symmetric functions, i.e. functions which only depend on the Hamming weight of the input. Here, we derive a dichotomy theorem for Holant^c with complex-valued, not necessarily symmetric functions. The tractable cases are the complex-valued generalisations of the tractable cases of the real-valued Holant^c dichotomy. The proof uses results from quantum information theory, particularly about entanglement. This full dichotomy for Holant^c answers a question that has been open for almost a decade.</p
Holant clones and the approximability of conservative holant problems
We construct a theory of holant clones to capture the notion of expressibility in the holant framework. Their role is analogous to the role played by functional clones in the study of weighted counting Constraint Satisfaction Problems. We explore the landscape of conservative holant clones and determine the situations in which a set F of functions is âuniversal in the conservative caseâ, which means that all functions are contained in the holant clone generated by F together with all unary functions. When F is not universal in the conservative case, we give concise generating sets for the clone. We demonstrate the usefulness of the holant clone theory by using it to give a complete complexity-theory classification for the problem of approximating the solution to conservative holant problems. We show that approximation is intractable exactly when F is universal in the conservative case