标题： 超越布拉维格子和局域哈伯德相互作用的费米子费曼图快速求和 显示英文标题

标题： Fast summation of fermionic Feynman diagrams beyond Bravais Lattices and on-site Hubbard interactions

摘要： 我们设计了新的算法用于在任意通道中求和粗线费曼图，该算法可以轻松修改以适用于裸相互作用级数。 当应用于具有局域Hubbard相互作用的磁性通道粗线级数时，该算法与最先进的RPADet相比表现出竞争力。 随后，我们将算法推广到超出正方晶格和局域Hubbard相互作用的情况，并在单元格中的站点数量上实现了更好的扩展性，而当存在更多类型的相互作用时，性能有显著提升。 这项工作为真实材料的图解蒙特卡洛模拟铺平了道路，为在热力学极限下对先进模拟工具的稳健替代奠定了基础。 显示英文摘要

摘要： We designed new algorithms for summing bold-line Feynman diagrams in arbitrary channels, where it can be readily modified for bare interaction series as well. When applied to magnetic channel bold-line series with on-site Hubbard interactions, the algorithm achieves competitive performance compared with the state-of-art RPADet. We then generalize it beyond square lattice and on-site Hubbard interactions and achieve better scaling in the number of sites within a unit cell, while there is substantial increase when there are more types of interactions. This work paves the way of diagrammatic Monte Carlo simulations for real materials, holding the premise for a robust replacement of state-of-art simulation tools in the thermodynamical limit.