Outputs (3)

Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature (2023)
Journal Article
Helmuth, T., & Mann, R. L. (2023). Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature. Quantum, 7, 1155. https://doi.org/10.22331/q-2023-10-25-1155

We establish an efficient approximation algorithm for the partition functions of a class of quantum spin systems at low temperature, which can be viewed as stable quantum perturbations of classical spin systems. Our algorithm is based on combining th... Read More about Efficient Algorithms for Approximating Quantum Partition Functions at Low Temperature.

Approximation Algorithms for the Random Field Ising Model (2023)
Journal Article
Helmuth, T., Lee, H., Perkins, W., Ravichandran, M., & Wu, Q. (2023). Approximation Algorithms for the Random Field Ising Model. SIAM Journal on Discrete Mathematics, 37(3), 1610-1629. https://doi.org/10.1137/21m1467389

Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs (2023)
Journal Article
Helmuth, T., Jenssen, M., & Perkins, W. (2023). Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs. Annales de l'Institut Henri Poincaré, Probabilités et Statistiques, 59(2), 817-848. https://doi.org/10.1214/22-aihp1263

For ∆ ≥ 5 and q large as a function of ∆, we give a detailed picture of the phase transition of the random cluster model on random ∆-regular graphs. In particular, we determine the limiting distribution of the weights of the ordered and disordered ph... Read More about Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs.