- Open Access
Tensor-network population annealing
Phys. Rev. E 114, 055301 – Published 2 November, 2026
DOI: https://doi.org/10.1103/tczz-49lg
Abstract
We propose a hybrid sampling method, tensor-network population annealing (TNPA), which combines tensor-network (TN) initialization with population annealing (PA). We apply this method to the two-dimensional Edwards-Anderson Ising spin glass. The approach is motivated by the limitations of existing methods: TN-based samplers can become numerically unstable in frustrated spin systems at low temperatures, whereas conventional PA requires a long annealing schedule when started from the high-temperature limit. In TNPA, TN contractions are used only within a reliable temperature range to generate initial configurations that are close to the equilibrium distribution. The subsequent low-temperature equilibration is then carried out by PA. To stabilize the initialization process, we introduce a diagnostic based on the effective sample size that adaptively selects the initialization temperature. The proposed framework provides a practical and physically motivated route to low-temperature sampling by combining the complementary strengths of TN and PA.
Physics Subject Headings (PhySH)
Article Text
References (70)
- D. P. Landau and K. Binder, A Guide to Monte Carlo Simulations in Statistical Physics, 4th ed. (Cambridge University Press, Cambridge, UK, 2014).
- M. E. J. Newman and G. T. Barkema, Monte Carlo Methods in Statistical Physics (Oxford University Press, Oxford, UK, 1999).
- K. Binder and A. P. Young, Spin glasses: Experimental facts, theoretical concepts, and open questions, Rev. Mod. Phys. 58, 801 (1986).
- M. Mezard, G. Parisi, and M. Virasoro, Spin Glass Theory and Beyond (World scientific, Singapore, 1986).
- P. G. de Gennes, Scaling Concepts in Polymer Physics (Cornell University Press, Ithaca, NY, 1979).
- R. H. Swendsen and J.-S. Wang, Nonuniversal critical dynamics in Monte Carlo simulations, Phys. Rev. Lett. 58, 86 (1987).
- U. Wolff, Collective Monte Carlo updating for spin systems, Phys. Rev. Lett. 62, 361 (1989).
- J.-S. Wang and R. H. Swendsen, Cluster Monte Carlo algorithms, Physica A 167, 565 (1990).
- Y. Iba, Extended ensemble Monte Carlo, Int. J. Mod. Phys. C 12, 623 (2001).
- C. J. Geyer, Markov chain Monte Carlo maximum likelihood, in Computing Science and Statistics: Proceedings of the 23rd Symposium on the Interface (Interface Foundation of North America, Fairfax Station, VA, USA, 1991), pp. 156–163.
- K. Hukushima and K. Nemoto, Exchange Monte Carlo method and application to spin glass simulations, J. Phys. Soc. Jpn. 65, 1604 (1996).
- E. Marinari, Optimized Monte Carlo methods, in Advances in Computer Simulation, edited by J. Kertész and I. Kondor, Lecture Notes in Physics Vol. 501 (Springer, Berlin, Germany, 1998), pp. 50–81.
- R. Orús, A practical introduction to tensor networks: Matrix product states and projected entangled pair states, Ann. Phys. 349, 117 (2014).
- K. Okunishi, T. Nishino, and H. Ueda, Developments in the Tensor network—from statistical mechanics to quantum entanglement, J. Phys. Soc. Jpn. 91, 062001 (2022).
- M. Levin and C. P. Nave, Tensor renormalization group approach to two-dimensional classical lattice models, Phys. Rev. Lett. 99, 120601 (2007).
- Z. Y. Xie, H. C. Jiang, Q. N. Chen, Z. Y. Weng, and T. Xiang, Second renormalization of tensor-network states, Phys. Rev. Lett. 103, 160601 (2009).
- Z. Y. Xie, J. Chen, M. P. Qin, J. W. Zhu, L. P. Yang, and T. Xiang, Coarse-graining renormalization by higher-order singular value decomposition, Phys. Rev. B 86, 045139 (2012).
- G. Evenbly and G. Vidal, Tensor network renormalization, Phys. Rev. Lett. 115, 180405 (2015).
- T. Nishino and K. Okunishi, Corner transfer matrix renormalization group method, J. Phys. Soc. Jpn. 65, 891 (1996).
- G. Vidal, Efficient simulation of one-dimensional quantum many-body systems, Phys. Rev. Lett. 93, 040502 (2004).
- R. Orús and G. Vidal, Infinite time-evolving block decimation algorithm beyond unitary evolution, Phys. Rev. B 78, 155117 (2008).
- A. J. Ferris, Unbiased Monte Carlo for the age of tensor networks, arXiv:1507.00767.
- W. Huggins, C. D. Freeman, M. Stoudenmire, N. M. Tubman, and K. B. Whaley, Monte Carlo tensor network renormalization, arXiv:1710.03757.
- S. Todo, Markov chain Monte Carlo in tensor network representation, arXiv:2412.02974.
- M. Frías Pérez, M. Mariën, D. Pérez García, M. C. Bañuls, and S. Iblisdir, Collective Monte Carlo updates through tensor network renormalization, SciPost Phys. 14, 123 (2023).
- T. Chen, E. Guo, W. Zhang, P. Zhang, and Y. Deng, Tensor network Monte Carlo simulations for the two-dimensional random-bond Ising model, Phys. Rev. B 111, 094201 (2025).
- T. Chen, J. Liu, Y. Deng, and P. Zhang, Tensor network Markov chain Monte Carlo: Efficient sampling of three-dimensional spin glasses and beyond, arXiv:2509.23945.
- T. Oshima, Y. Arai, and K. Hukushima, Phase transitions in a modified Ising spin glass model: A tensor-network-based sampling approach, arXiv:2603.18486.
- T. Chen, J. Zhang, J. Liu, Y. Deng, and P. Zhang, BatchTNMC: Efficient sampling of two-dimensional spin glasses using tensor network Monte Carlo, arXiv:2509.19006.
- N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, Equation of state calculations by fast computing machines, J. Chem. Phys. 21, 1087 (1953).
- W. K. Hastings, Monte Carlo sampling methods using Markov chains and their applications, Biometrika 57, 97 (1970).
- C. Wang, S.-M. Qin, and H.-J. Zhou, Topologically invariant tensor renormalization group method for the Edwards-Anderson spin glasses model, Phys. Rev. B 90, 174201 (2014).
- Z. Zhu and H. G. Katzgraber, Do tensor renormalization group methods work for frustrated spin systems? arXiv:1903.07721.
- Y. Iba, Population Monte Carlo algorithms, Trans. Jpn. Soc. Artif. Intell. 16, 279 (2001).
- K. Hukushima and Y. Iba, Population annealing and its application to a spin glass, AIP Conf. Proc. 690, 200 (2003).
- W. Wang, J. Machta, and H. G. Katzgraber, Population annealing: Theory and application in spin glasses, Phys. Rev. E 92, 063307 (2015).
- A. Barzegar, C. Pattison, W. Wang, and H. G. Katzgraber, Optimization of population annealing Monte Carlo for large-scale spin-glass simulations, Phys. Rev. E 98, 053308 (2018).
- D. Wu, L. Wang, and P. Zhang, Solving statistical mechanics using variational autoregressive networks, Phys. Rev. Lett. 122, 080602 (2019).
- B. McNaughton, M. V. Milošević, A. Perali, and S. Pilati, Boosting Monte Carlo simulations of spin glasses using autoregressive neural networks, Phys. Rev. E 101, 053312 (2020).
- L. M. Del Bono, F. Ricci-Tersenghi, and F. Zamponi, Performance of machine-learning-assisted Monte Carlo in sampling from simple statistical physics models, Phys. Rev. E 112, 045307 (2025).
- L. M. Del Bono, F. Ricci-Tersenghi, and F. Zamponi, Nearest-neighbors neural network architecture for efficient sampling of statistical physics models, Mach. Learn.: Sci. Technol. 6, 025029 (2025).
- L. Saul and M. Kardar, The Ising spin glass: exact partition functions in polynomial time, Nucl. Phys. B 432, 641 (1994).
- A. Galluccio, M. Loebl, and J. Vondrák, New algorithm for the Ising problem: Partition function for finite lattice graphs, Phys. Rev. Lett. 84, 5924 (2000).
- C. K. Thomas and A. A. Middleton, Exact algorithm for sampling the two-dimensional Ising spin glass, Phys. Rev. E 80, 046708 (2009).
- A. J. Bray and M. A. Moore, Lower critical dimension of Ising spin glasses: A numerical study, J. Phys. C 17, L463 (1984).
- R. N. Bhatt and A. P. Young, Numerical studies of Ising spin glasses in two, three, and four dimensions, Phys. Rev. B 37, 5606 (1988).
- J. Houdayer, A cluster Monte Carlo algorithm for 2-dimensional spin glasses, Eur. Phys. J. B 22, 479 (2001).
- Z. Zhu, A. J. Ochoa, and H. G. Katzgraber, Efficient cluster algorithm for spin glasses in any space dimension, Phys. Rev. Lett. 115, 077201 (2015).
- A. Jasra, D. A. Stephens, A. Doucet, and T. Tsagaris, Inference for Lévy-driven stochastic volatility models via adaptive sequential Monte Carlo, Scand. J. Stat. 38, 1 (2011).
- Y. Zhou, A. M. Johansen, and J. A. Aston, Toward automatic model comparison: An adaptive sequential Monte Carlo approach, J. Comput. Graphical Stat. 25, 701 (2016).
- L. Y. Barash, M. Weigel, M. Borovský, W. Janke, and L. N. Shchur, GPU accelerated population annealing algorithm, Comput. Phys. Commun. 220, 341 (2017).
- H. Christiansen, M. Weigel, and W. Janke, Population annealing molecular dynamics with adaptive temperature steps, J. Phys.: Conf. Ser. 1163, 012074 (2019).
- C. Amey and J. Machta, Analysis and optimization of population annealing, Phys. Rev. E 97, 033301 (2018).
- B. A. Berg and T. Neuhaus, Multicanonical ensemble: A new approach to simulate first-order phase transitions, Phys. Rev. Lett. 68, 9 (1992).
- J.-S. Wang, Is the broad histogram random walk dynamics correct? Eur. Phys. J. B 8, 287 (1999).
- J.-S. Wang and R. H. Swendsen, Low-temperature properties of the Ising spin glass in two dimensions, Phys. Rev. B 38, 4840 (1988).
- J. Lukic, A. Galluccio, E. Marinari, O. C. Martin, and G. Rinaldi, Critical thermodynamics of the two-dimensional Ising spin glass, Phys. Rev. Lett. 92, 117202 (2004).
- H. F. Cheung and W. L. McMillan, Equilibrium properties of the two-dimensional random () Ising model, J. Phys. C 16, 7027 (1983).
- J. A. Blackman, J. R. Gonçalves, and J. Poulter, Properties of the two-dimensional random-bond Ising spin glass, Phys. Rev. E 58, 1502 (1998).
- Z. F. Zhan, L. W. Lee, and J.-S. Wang, A new approach to the study of the ground-state properties of 2D Ising spin glass, Physica A 285, 239 (2000).
- A. K. Hartmann, Ground-state clusters of two-, three-, and four-dimensional Ising spin glasses, Phys. Rev. E 63, 016106 (2000).
- D. J. Perez-Morelo, A. J. Ramirez-Pastor, and F. Romá, Ground-state energy and entropy of the two-dimensional Edwards–Anderson spin-glass model with different bond distributions, Physica A 391, 937 (2012).
- A. A. Gangat and J. Gray, Hyperoptimized approximate contraction of tensor networks for rugged-energy-landscape spin glasses on periodic square and cubic lattices, Phys. Rev. E 110, 065306 (2024).
- D. Wu, R. Rossi, and G. Carleo, Unbiased Monte Carlo cluster updates with autoregressive neural networks, Phys. Rev. Res. 3, L042024 (2021).
- E. M. Inack, S. Morawetz, and R. G. Melko, Neural annealing and visualization of autoregressive neural networks in the Newman–Moore model, Condens. Matter 7, 38 (2022).
- S. Ciarella, J. Trinquier, M. Weigt, and F. Zamponi, Machine-learning-assisted Monte Carlo fails at sampling computationally hard problems, Mach. Learn.: Sci. Technol. 4, 010501 (2023).
- L. Tagliacozzo, T. R. de Oliveira, S. Iblisdir, and J. I. Latorre, Scaling of entanglement support for matrix product states, Phys. Rev. B 78, 024410 (2008).
- K. Hukushima, Y. Ichikawa, and T. Ohshima, Data and gnuplot scripts for “Tensor-network population annealing” [Data set], Zenodo, 2026, https://doi.org/10.5281/zenodo.22023063.
- D. Gessert, W. Janke, and M. Weigel, Resampling schemes in population annealing: Numerical and theoretical results, Phys. Rev. E 108, 065309 (2023).
- A. Doucet and A. M. Johansen, A tutorial on particle filtering and smoothing: Fifteen years later, in The Oxford Handbook of Nonlinear Filtering, edited by D. Crisan and B. Rozovskii, Oxford Handbooks in Mathematics (Oxford University Press, Oxford, NY, 2011) pp. 656–705.