7 citations · 7 across the 3 of their papers we have counts for
3 papers
cs.DS2019
FPRAS for the Potts Model and the Number of -colorings
Zonglei Bai, Yongzhi Cao, Hanpin Wang
In this paper, we give a sampling algorithm for the Potts model using Markov chains. Based on the sampling algorithm, we give \emph{FPRAS}es for the Potts model and the number of $…
cs.CC2016★ 7 cited
The Complexity of Holant Problems over Boolean Domain with Non-negative Weights
Jiabao Lin, Hanpin Wang
Holant problem is a general framework to study the computational complexity of counting problems. We prove a complexity dichotomy theorem for Holant problems over Boolean domain wi…
quant-ph2014
Minimum guesswork discrimination between quantum states
Weien Chen, Yongzhi Cao, Hanpin Wang +1
Error probability is a popular and well-studied optimization criterion in discriminating non-orthogonal quantum states. It captures the threat from an adversary who can only query…