A Dichotomy for Real Boolean Holant Problems

by   Shuai Shao, et al.

We prove a complexity dichotomy for Holant problems on the boolean domain with arbitrary sets of real-valued constraint functions. These constraint functions need not be symmetric nor do we assume any auxiliary functions as in previous results. It is proved that for every set ℱ of real-valued constraint functions, Holant(ℱ) is either P-time computable or #P-hard. The classification has an explicit criterion. This is the culmination of much research on this problem, and it uses previous results and techniques from many researchers. Some particularly intriguing concrete functions f_6, f_8 and their associated families with extraordinary closure properties related to Bell states in quantum information theory play an important role in this proof.


page 1

page 2

page 3

page 4


From Holant to Quantum Entanglement and Back

Holant problems are intimately connected with quantum theory as tensor n...

Isoperimetric Inequalities for Real-Valued Functions with Applications to Monotonicity Testing

We generalize the celebrated isoperimetric inequality of Khot, Minzer, a...

A full dichotomy for Holant^c, inspired by quantum computation

Holant problems are a family of counting problems parameterised by sets ...

Bipartite 3-Regular Counting Problems with Mixed Signs

We prove a complexity dichotomy for a class of counting problems express...

Structure and Interleavings of Relative Interlevel Set Cohomology

The relative interlevel set cohomology (RISC) is an invariant of real-va...

Classification of preordered spaces in terms of monotones – Filling in the gaps

Following the recent introduction of new classes of monotones, like inje...

Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin

We analyse the complexity of approximate counting constraint satisfactio...