arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2507.12349cond-mat.str-elmath.CO
收藏

CoS++:迈向更通用、更显式的高阶 Feynman 图级数采样实现

CoS++: Towards More General and Explicit Implementations for Sampling High-Order Feynman Diagrammatic Series

The Blackett Laboratory, Imperial College London(帝国理工学院布莱克特实验室)

Boyuan Shi

AI总结:

本文扩展连通 Feynman 图求和的动态规划方法,支持更多顶点与两类 SU(N) 对称破缺,并给出独立的端到端 CUDA GPU 加速及数值稳定性修复。

摘要:

Diagrammatic Monte Carlo 方法为在热力学极限下精确计算关联电子系统提供了稳健流程。最近,其适用性被扩展到 SU(N) Hubbard 模型,核心是一种用于求和所有连通 Feynman 图的新型动态规划方法。我们提出了该方法的若干推广,使其支持更多相互作用顶点和对称破缺项。该框架同时处理两类 SU(N) 对称破缺:一类来自非均匀且依赖味的化学势,另一类来自由位移参数诱导的自发破缺相。我们还提供了一条端到端 GPU 加速路径,采用专门的 CUDA C++ 优化,独立于此前的 CUDA 加速方法,并且并行化策略不同。我们对本文涉及的新算法进行了详细数值研究,揭示了连通行列式形式体系的数值不稳定性,并通过多种方式加以解决。总体而言,这些进展为具有或不具有对称破缺的多味关联系统建立了一个可扩展、高性能的 DiagMC 工具箱。

英文摘要:

We extend combinatorial summation (CoS) of connected Feynman diagrams to Hubbard mod- els with flavor-dependent propagators and counterterm shifts. The construction combines an interaction-occupancy mask with labels for the open fermion cycle, allowing equivalent endpoint his- tories to be accumulated while retaining the flavor and sublattice information needed by subsequent contractions. In the flavor-dependent version, denoted symmetry-broken CoS (SB-CoS), normal heads carry the cycle flavor and counterterm heads inherit the flavor at their interaction partner. We prove the correctness of the resulting recurrence and introduce terminal readouts that return all nonempty interaction-subset values from a shared circuit, as required by a many-configuration Markov-chain sampler. For three flavors, a second formulation uses determinant polynomials and a local interaction tensor, with connected coefficients extracted by subset recursion or Fourier interpo- lation and a support sieve. Applications to the two-spin honeycomb and three-flavor square-lattice Hubbard models illustrate the treatment of sublattice structure and non-uniform reference shifts.

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

↑