A full dichotomy for Holant$^c$, inspired by quantum computation
Abstract
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.
Keywords
Cite
@article{arxiv.2201.03375,
title = {A full dichotomy for Holant$^c$, inspired by quantum computation},
author = {Miriam Backens},
journal= {arXiv preprint arXiv:2201.03375},
year = {2025}
}
Comments
59 pages, combines edited versions of arXiv:1702.00767 and arXiv:1704.05798 with some new results; v2 restores a missing case to the proof of Lemma 48, see doi:10.1137/24M167723X for the corresponding erratum