Approximation Algorithms for Complex-Valued Ising Models on Bounded Degree Graphs
We study the problem of approximating the Ising model partition function with complex parameters on bounded degree graphs. We establish a deterministic polynomial-time approximation scheme for the partition function when the interactions and external fields are absolutely bounded close to zero. Furt...
Main Authors: | Ryan L. Mann, Michael J. Bremner |
---|---|
Format: | Article |
Language: | English |
Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2019-07-01
|
Series: | Quantum |
Online Access: | https://quantum-journal.org/papers/q-2019-07-11-162/pdf/ |
Similar Items
-
Approximation of Max-Cut on Graphs of Bounded Degree
by: Florén, Mikael
Published: (2016) -
Degree bounds for graphs in surfaces
by: Hart, Michael
Published: (1992) -
A Near-shortest Path Algorithm on Bounded-degree and Bounded-diameter Graphs
by: Lee, Yen-Yu, et al.
Published: (2017) -
On the treewidths of graphs of bounded degree.
by: Yinglei Song, et al.
Published: (2015-01-01) -
Domination in graphs with bounded degrees
by: Dorfling, Samantha
Published: (2012)