A New Holant Dichotomy Inspired by Quantum Computation
From MaRDI portal
Publication:5111345
DOI10.4230/LIPIcs.ICALP.2017.16zbMath1441.68159arXiv1702.00767OpenAlexW2963052590MaRDI QIDQ5111345
Publication date: 27 May 2020
Full work available at URL: https://arxiv.org/abs/1702.00767
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Quantum computation (81P68) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Related Items (13)
Perfect matchings, rank of connection tensors and graph homomorphisms ⋮ The Complexity of Boolean Holant Problems with Nonnegative Weights ⋮ A Full Dichotomy for $\hol^{c}$, Inspired by Quantum Computation ⋮ A complexity trichotomy for \(k\)-regular asymmetric spin systems using number theory ⋮ Complexity classification of the eight-vertex model ⋮ Unnamed Item ⋮ Beyond \#CSP: a dichotomy for counting weighted Eulerian orientations with ARS ⋮ A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory ⋮ Clifford gates in the Holant framework ⋮ Dichotomy for Holant\(^\ast\) problems on the Boolean domain ⋮ Bipartite 3-regular counting problems with mixed signs ⋮ FKT is not universal -- a planar holant dichotomy for symmetric constraints ⋮ The complexity of counting \(\mathrm{CSP}^d\)
This page was built for publication: A New Holant Dichotomy Inspired by Quantum Computation
