arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.05470cond-mat.stat-mechcond-mat.dis-nnphysics.comp-ph
收藏

分支界限张量网络用于精确基态表征

Branch-and-Bound Tensor Networks for Exact Ground-State Characterization

CAS Key Laboratory for Theoretical Physics, Institute of Theoretical Physics, Chinese Academy of Sciences(中国科学院理论物理研究所);School of Physical Sciences, University of Chinese Academy of Sciences(中国科学院大学物理科学学院);Center for Computational Mathematics, Flatiron Institute, Simons Foundation(西蒙斯基金会平顿研究所计算数学中心);School of Fundamental Physics and Mathematical Sciences, Hangzhou Institute for Advanced Study, UCAS(中国科学院大学杭州高等研究院基础物理与数学科学学院);Science, Mathematics and Technology Cluster, Singapore University of Technology and Design(新加坡科技设计大学科学技术集群);Hong Kong University of Science and Technology (Guangzhou)(香港科技大学(广州))

Yijia Wang, Xuanzhao Gao, Pan Zhang, Feng Pan, Jinguo Liu

AI总结:

BBTN方法通过结合分支界限与热带张量网络,实现了对大规模无序系统基态的精确计算和计数,显著提升了精确算法的效率和可扩展性。

摘要:

表征无序系统的基态性质,如spin玻璃和组合优化问题,是科学和工程中的基本问题。然而,计算精确基态和计数其简并度通常是NP难和#P难问题,对精确算法构成了严峻挑战。最近,利用高维线性代数并实现大规模硬件并行化的张量网络方法,已逐渐成为高效解决这些任务的快速发展的范式。尽管这些方法取得了成功,但它们本质上受到空间复杂度指数增长的限制,严重限制了其可扩展性。为了解决这个瓶颈,我们引入了分支界限张量网络(BBTN)方法,该方法无缝整合了分支界限的自适应搜索框架与热带张量网络的高效收缩,显著扩展了精确算法的范围。我们证明BBTN显著优于现有最先进的求解器,为精确计算设定了新的基准。它将可处理性边界推至此前无法达到的规模,使±J spin玻璃的精确基态计数可达64×64,并解决King子图上的最大独立集问题直至100×100。对于难题实例,BBTN大幅降低了标准热带张量网络的计算成本,将数年的运行时间压缩成分钟。此外,它比领先的整数规划求解器快30倍以上,建立了一个用于统计物理和组合优化中解决难题的多功能且可扩展的框架。

英文摘要:

Characterizing the ground-state properties of disordered systems, such as spin glasses and combinatorial optimization problems, is fundamental to science and engineering. However, computing exact ground states and counting their degeneracies are generally NP-hard and #P-hard problems, respectively, posing a formidable challenge for exact algorithms. Recently, Tensor Networks methods, which utilize high-dimensional linear algebra and achieve massive hardware parallelization, have emerged as a rapidly developing paradigm for efficiently solving these tasks. Despite their success, these methods are fundamentally constrained by the exponential growth of space complexity, which severely limits their scalability. To address this bottleneck, we introduce the Branch-and-Bound Tensor Network (BBTN) method, which seamlessly integrates the adaptive search framework of branch-and-bound with the efficient contraction of tropical tensor networks, significantly extending the reach of exact algorithms. We show that BBTN significantly surpasses existing state-of-the-art solvers, setting new benchmarks for exact computation. It pushes the boundaries of tractability to previously unreachable scales, enabling exact ground-state counting for $\pm J$ spin glasses up to $64 \times 64$ and solving Maximum Independent Set problems on King's subgraphs up to $100 \times 100$. For hard instances, BBTN dramatically reduces the computational cost of standard Tropical Tensor Networks, compressing years of runtime into minutes. Furthermore, it outperforms leading integer-programming solvers by over 30$\times$, establishing a versatile and scalable framework for solving hard problems in statistical physics and combinatorial optimization.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑