- Open Access
Branch-and-bound tensor networks for exact characterization of classical ground states
Phys. Rev. Research 8, 043173 – Published 18 November, 2026
DOI: https://doi.org/10.1103/g76v-wxz7
Abstract
Characterizing the ground-state properties of disordered systems, such as spin glasses and combinatorial optimization problems, is fundamental but computationally challenging. Finding exact ground states and counting their degeneracies are NP-hard and #P-hard, respectively, placing severe limits on exact algorithms. While tensor networks have emerged as a powerful paradigm for these tasks by leveraging massive hardware parallelization, their scalability is fundamentally bottlenecked by exponential memory growth. To overcome this, we introduce the branch-and-bound tensor network (BBTN) method. By integrating adaptive branch-and-bound search with efficient tropical tensor network contraction, BBTN sets new benchmarks for exact computation. It pushes the tractable frontier to previously unreachable scales, enabling exact ground-state counting for spin glasses up to and maximum independent set solving on King’s subgraphs up to , reducing run times required by state-of-the-art solvers from millions of years to hours. Furthermore, it consistently outperforms leading open-source integer-programming solvers and runs up to an order of magnitude faster than commercial solvers in rugged landscapes, establishing a versatile and scalable framework for solving hard problems in statistical physics and combinatorial optimization.
Physics Subject Headings (PhySH)
Article Text
Supplemental Material
References (72)
- K. Binder and A. P. Young, Spin glasses: Experimental facts, theoretical concepts, and open questions, Rev. Mod. Phys. 58, 801 (1986).
- K. H. Fischer and J. A. Hertz, Spin Glasses (Cambridge University Press, Cambridge, 1991), Vol. 1.
- D.-Z. Du and P. M. Pardalos, Handbook of Combinatorial Optimization (Springer US, Boston, MA, 1998), Vol. 3.
- Q. Zhou and W. H. Wong, Energy landscape of a spin-glass model: Exploration and characterization, Phys. Rev. E 79, 051117 (2009).
- E. S. Rodrigues and P. M. C. de Oliveira, Spin-glass energy landscape, J. Stat. Phys. 74, 1265 (1994).
- V. Ros and Y. V. Fyodorov, The high-dimensional landscape paradigm: Spin-glasses, and beyond, in Spin Glass Theory and Far Beyond: Replica Symmetry Breaking After 40 Years, edited by Patrick Charbonneau, Enzo Marinari, Marc Mézard, Giorgio Parisi, Federico Ricci-Tersenghi, Gabriele Sicuro, and Francesco Zamponi (World Scientific, Singapore, 2023), pp. 95–114.
- M. Mézard, G. Parisi, and M. A. Virasoro, Theory of the frustration effect in spin glasses: I, in Spin Glass Theory and Beyond: An Introduction to the Replica Method and Its Applications (World Scientific, Singapore, 1987), Vol. 9, p. 99.
- S. Kirkpatrick, Frustration and ground-state degeneracy in spin glasses, Phys. Rev. B 16, 4630 (1977).
- L. F. Cugliandolo, Course 7: Dynamics of glassy systems, in Slow Relaxations and Nonequilibrium Dynamics in Condensed Matter, edited by J.-L. Barrat, M. Feigelman, J. Kurchan, and J. Dalibard (Springer, Berlin, Heidelberg, 2004), pp. 367–521.
- D. Koller and N. Friedman, Probabilistic Graphical Models: Principles and Techniques (The MIT Press, Cambridge, MA, 2009).
- H. Cao, S. Zhao, D. Feng, Z. Shen, H. Yan, T. Su, W. Sun, H. Xu, F. Pan, H. Yu, and P. Zhang, Exact decoding of quantum error-correcting codes, Phys. Rev. Lett. 134, 190603 (2025).
- A. Dutta, Quantum Phase Transitions in Transverse Field Spin Models (Cambridge University Press, Cambridge, 2015).
- D. Sherrington and S. Kirkpatrick, Solvable model of a spin-glass, Phys. Rev. Lett. 35, 1792 (1975).
- A. Auffinger, W.-K. Chen, and Q. Zeng, The SK model is infinite step replica symmetry breaking at zero temperature, Commun. Pure Appl. Math. 73, 921 (2020).
- G. Parisi, Infinite number of order parameters for spin-glasses, Phys. Rev. Lett. 43, 1754 (1979).
- M. Mézard, G. Parisi, and M. A. Virasoro, Spin Glass Theory and Beyond: An Introduction to the Replica Method and Its Applications (World Scientific, Singapore, 1987), Vol. 9.
- D. Gamarnik, E. C. Kızıldağ, W. Perkins, and C. Xu, Algorithms and barriers in the symmetric binary perceptron model, in 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) (IEEE Computer Society, Los Alamitos, CA, 2022), pp. 576–587.
- G. Bresler and B. Huang, The algorithmic phase transition of random -SAT for low degree polynomials, in 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) (IEEE Computer Society, Los Alamitos, CA, 2022), pp. 298–309.
- F. Krzakała, A. Montanari, F. Ricci-Tersenghi, G. Semerjian, and L. Zdeborová, Gibbs states and the set of solutions of random constraint satisfaction problems, Proc. Natl. Acad. Sci. USA 104, 10318 (2007).
- H. Daudé, M. Mézard, T. Mora, and R. Zecchina, Pairs of SAT-assignments in random Boolean formulæ, Theor. Comput. Sci. 393, 260 (2008).
- C. Moore and S. Mertens, The Nature of Computation (Oxford University Press, Oxford, 2011).
- F. Barahona, On the computational complexity of Ising spin glass models, J. Phys. A: Math. Gen. 15, 3241 (1982).
- C. De Simone, M. Diehl, M. Jünger, P. Mutzel, G. Reinelt, and G. Rinaldi, Exact ground states of Ising spin glasses: New experimental results with a branch-and-cut algorithm, J. Stat. Phys. 80, 487 (1995).
- R. S. Andrist, M. J. A. Schuetz, P. Minssen, R. Yalovetzky, S. Chakrabarti, D. Herman, N. Kumar, G. Salton, R. Shaydulin, Y. Sun, M. Pistoia, and H. G. Katzgraber, Hardness of the maximum independent set problem on unit-disk graphs and prospects for quantum speedups, Phys. Rev. Res. 5, 043277 (2023).
- T. Achterberg, SCIP: Solving constraint integer programs, Math. Program. Comput. 1, 1 (2009).
- F. V. Fomin, F. Grandoni, and D. Kratsch, Measure and conquer: A simple independent set algorithm, in Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm (Society for Industrial and Applied Mathematics, Philadelphia, PA, 2006), pp. 18–25.
- C. M. Li, F. Manyà, and J. Planes, Exploiting unit propagation to compute lower bounds in branch and bound Max-SAT solvers, in Principles and Practice of Constraint Programming—CP 2005 (Springer, Berlin, 2005), pp. 403–414.
- A. Abrame and D. Habet, ahmaxsat: Description and evaluation of a branch and bound Max-SAT solver, J. Satisf. Boolean Model. Comput. 9, 89 (2015).
- T. Akiba and Y. Iwata, Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover, Theor. Comput. Sci. 609, 211 (2016).
- M. Xiao and H. Nagamochi, Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs, Theor. Comput. Sci. 469, 92 (2013).
- M. Xiao and H. Nagamochi, Exact algorithms for maximum independent set, Inf. Comput. 255, 126 (2017).
- R. Y. Rubinstein and D. P. Kroese, Simulation and the Monte Carlo Method (John Wiley & Sons, Hoboken, NJ, 2016).
- S. Kirkpatrick, C. D. Gelatt, Jr., and M. P. Vecchi, Optimization by simulated annealing, Science 220, 671 (1983).
- I. L. Markov and Y. Shi, Simulating quantum computation by contracting tensor networks, SIAM J. Comput. 38, 963 (2008).
- U. Schollwöck, The density-matrix renormalization group in the age of matrix product states, Ann. Phys. 326, 96 (2011).
- J.-G. Liu, L. Wang, and P. Zhang, Tropical tensor network for ground states of spin glasses, Phys. Rev. Lett. 126, 090506 (2021).
- J.-G. Liu, X. Gao, M. Cain, M. D. Lukin, and S.-T. Wang, Computing solution space properties of combinatorial optimization problems via generic tensor networks, SIAM J. Sci. Comput. 45, A1239 (2023).
- M. Roa-Villescas, X. Gao, S. Stuijk, H. Corporaal, and J.-G. Liu, Probabilistic inference in the era of tensor networks and differential programming, Phys. Rev. Res. 6, 033261 (2024).
- M. Roa-Villescas and J.-G. Liu, TensorInference: A Julia package for tensor-based probabilistic inference, J. Open Source Software 8, 5700 (2023).
- J. Gray and S. Kourtis, Hyper-optimized tensor network contraction, Quantum 5, 410 (2021).
- J. Argelich, C. M. Li, F. Manyà, and J. R. Soler, Clause branching in MaxSAT and MinSAT, in Artificial Intelligence Research and Development, edited by Zoe Falomir, Karina Gibert, and Enric Plaza (IOS Press, Amsterdam, 2018), pp. 17–26.
- D. Eppstein, The traveling salesman problem for cubic graphs, J. Graph Algorithms Appl. 11, 61 (2007).
- G. Carpaneto and P. Toth, Some new branching and bounding criteria for the asymmetric travelling salesman problem, Manage. Sci. 26, 736 (1980).
- T. Achterberg, Constraint integer programming, Ph.D. thesis, Technische Universität Berlin, 2007.
- D. R. Morrison, S. H. Jacobson, J. J. Sauppe, and E. C. Sewell, Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning, Discrete Optim. 19, 79 (2016).
- X. Gao, Y.-J. Wang, P. Zhang, and J.-G. Liu, Automated discovery of branching rules with optimal complexity for the maximum independent set problem, arXiv:2412.07685.
- H. Pichler, S.-T. Wang, L. Zhou, S. Choi, and M. D. Lukin, Quantum optimization for maximum independent set using Rydberg atom arrays, arXiv:1808.10816.
- S. Ebadi et al., Quantum optimization of maximum independent set using Rydberg atom arrays, Science 376, 1209 (2022).
- M. Kim, K. Kim, J. Hwang, E.-G. Moon, and J. Ahn, Rydberg quantum wires for maximum independent set problems, Nat. Phys. 18, 755 (2022).
- L. Bombieri, Z. Zeng, R. Tricarico, R. Lin, S. Notarnicola, M. Cain, M. D. Lukin, and H. Pichler, Quantum adiabatic optimization with Rydberg arrays: Localization phenomena and encoding strategies, PRX Quantum 6, 020306 (2025).
- N.-C. Chiu, E. C. Trapp, J. Guo, M. H. Abobeih, L. M. Stewart, S. Hollerith, P. L. Stroganov, M. Kalinowski, A. A. Geim, S. J. Evered, S. H. Li, X. Lyu, L. M. Peters, D. Bluvstein, T. T. Wang, M. Greiner, V. Vuletić, and M. D. Lukin, Continuous operation of a coherent 3,000-qubit system, Nature (London) 646, 1075 (2025).
- D. Bluvstein et al., A fault-tolerant neutral-atom architecture for universal quantum computation, Nature (London) 649, 39 (2026).
- S. Kourtis, C. Chamon, E. Mucciolo, and A. E. Ruckenstein, Fast counting with tensor networks, SciPost Phys. 7, 060 (2019).
- See Supplemental Material at http://link.aps.org/supplemental/10.1103/g76v-wxz7 for (1) algorithmic details; (2) geometric interpretation of one branching step; (3) exact-counting benchmarks and Chinese-remainder reconstruction; (4) branching-strategy and overhead comparisons; and (5) solution-landscape analyses, attached to this manuscript, which includes Refs. [59, 60, 61, 62, 63, 64].
- J. Chen, F. Zhang, C. Huang, M. Newman, and Y. Shi, Classical simulation of intermediate-size quantum circuits, arXiv:1805.01450.
- Computational Complexity and Statistical Physics, edited by A. Percus, G. Istrate, and C. Moore (Oxford University Press, New York, NY, 2006).
- E. Danna, M. Fenelon, Z. Gu, and R. Wunderling, Generating multiple solutions for mixed integer programming problems, in Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, edited by M. Fischetti and D. P. Williamson (Springer, Berlin, 2007), Vol. 4513, pp. 280–294.
- T. A. Davis and Y. Hu, The University of Florida sparse matrix collection, ACM Trans. Math. Software 38, 1 (2011).
- R. P. Brent and P. Zimmermann, Modern Computer Arithmetic (Cambridge University Press, Cambridge, UK, 2010).
- D. Coppersmith, Finding a small root of a bivariate integer equation; factoring with high bits known, in International Conference on the Theory and Applications of Cryptographic Techniques (Springer, Berlin, Heidelberg, 1996), pp. 178–189.
- S. Jin, A. Sen, W. Guo, and A. W. Sandvik, Phase transitions in the frustrated Ising model on the square lattice, Phys. Rev. B 87, 144406 (2013).
- G. Kalachev, P. Panteleev, and M.-H. Yung, Multi-tensor contraction for XEB verification of quantum circuits, arXiv:2108.05665.
- A. Kalz, A. Honecker, S. Fuchs, and T. Pruschke, Phase diagram of the Ising square lattice with competing interactions, Eur. Phys. J. B 65, 533 (2008).
- J.-G. Liu, J. Wurtz, M.-T. Nguyen, M. D. Lukin, H. Pichler, and S.-T. Wang, Computer-assisted gadget design and problem reduction of unweighted maximum independent set (unpublished).
- M.-T. Nguyen, J.-G. Liu, J. Wurtz, M. D. Lukin, S.-T. Wang, and H. Pichler, Quantum optimization with arbitrary connectivity using Rydberg atom arrays, PRX Quantum 4, 010316 (2023).
- Z. Hou, X. Li, Y. Zhang, T. Li, and K. You, LLM4Branch: Large language model for discovering efficient branching policies of integer programs, in Proceedings of Machine Learning Research (2026), Vol. 306, pp. 44132–44155.
- J. Bezanson, A. Edelman, S. Karpinski, and V. B. Shah, Julia: A fresh approach to numerical computing, SIAM Rev. 59, 65 (2017).
- X. Gao, Y.-J. Wang, and J.-G. Liu, TensorBranching.jl: A Julia package for the branch-and-bound tensor-network method, GitHub, 2025, https://github.com/xuanzhaogao/TensorBranching.jl.
- X. Gao, X. Li, and J. Liu, Programming guide for solving constraint satisfaction problems with tensor networks, Chin. Phys. B 34, 050201 (2025).
- T. Achterberg, T. Berthold, T. Koch, and K. Wolter, Constraint integer programming: A new approach to integrate CP and MIP, in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, edited by Laurent Perron and Michael A. Trick (Springer, Berlin, Heidelberg, 2008), pp. 6–20.
- I. Dunning, J. Huchette, and M. Lubin, JuMP: A modeling language for mathematical optimization, SIAM Rev. 59, 295 (2017).
- M. Lubin, O. Dowson, J. D. Garcia, J. Huchette, B. Legat, and J. P. Vielma, JuMP 1.0: Recent improvements to a modeling language for mathematical optimization, Math. Program. Comput. 15, 581 (2023).