3 papers
cs.DS2024
Algorithms for the ferromagnetic Potts model on expanders
Charlie Carlson, Ewan Davies, Nicolas Fraiman +3
We give algorithms for approximating the partition function of the ferromagnetic -color Potts model on graphs of maximum degree . Our primary contribution is a fully polynomi…
quant-ph2024
Approximation Algorithms for Quantum Max--Cut
Charlie Carlson, Zackary Jorquera, Alexandra Kolla +2
We initiate the algorithmic study of the Quantum Max--Cut problem, a quantum generalization of the well-known Max--Cut problem. The Quantum Max--Cut problem involves findi…
cs.DS2024
Efficient algorithms for the Potts model on small-set expanders
Charles Carlson, Ewan Davies, Alexandra Kolla
An emerging trend in approximate counting is to show that certain `low-temperature' problems are easy on typical instances, despite worst-case hardness results. For the class of re…