11 citations · 19 across the 8 of their papers we have counts for
9 papers · 1 filter
Approximability of the Four-Vertex Model
Zhiguo Fu, Tianyu Liu, Xiongxin Yang
We study the approximability of the four-vertex model, a special case of the six-vertex model.We prove that, despite being NP-hard to approximate in the worst case, the four-vertex…
From Holant to Quantum Entanglement and Back
Jin-Yi Cai, Zhiguo Fu, Shuai Shao
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 entanglem…
Beyond #CSP: A Dichotomy for Counting Weighted Eulerian Orientations with ARS
Jin-Yi Cai, Zhiguo Fu, Shuai Shao
We define and explore a notion of unique prime factorization for constraint functions, and use this as a new tool to prove a complexity classification for counting weighted Euleria…
On Blockwise Symmetric Matchgate Signatures and Higher Domain \#CSP
Zhiguo Fu
For any and , we prove that the {\sc Equality} function on variables over a domain of size cannot be realized by matchgates under holographic tr…
Complexity Classification of the Eight-Vertex Model
Jin-Yi Cai, Zhiguo Fu
We prove a complexity dichotomy theorem for the eight-vertex model. For every setting of the parameters of the model, we prove that computing the partition function is either solva…
Complexity Classification Of The Six-Vertex Model
Jin-Yi Cai, Zhiguo Fu, Mingji Xia
We prove a complexity dichotomy theorem for the six-vertex model. For every setting of the parameters of the model, we prove that computing the partition function is either solvabl…