Variational optimization of neural-network representations of quantum states has been successfully applied to solve interacting fermionic problems. Despite rapid developments, significant scalability challenges arise when considering molecules of large scale, which correspond to non-locally interacting quantum spin Hamiltonians consisting of sums of thousands or even millions of Pauli operators. In this work, we introduce scalable parallelization strategies to improve neural-network-based variational quantum Monte Carlo calculations for ab-initio quantum chemistry applications. We establish GPU-supported local energy parallelism to compute the optimization objective for Hamiltonians of potentially complex molecules. Using autoregressive sampling techniques, we demonstrate systematic improvement in wall-clock timings required to achieve CCSD baseline target energies. The performance is further enhanced by accommodating the structure of resultant spin Hamiltonians into the autoregressive sampling ordering. The algorithm achieves promising performance in comparison with the classical approximate methods and exhibits both running time and scalability advantages over existing neural-network based methods.
翻译:在这项工作中,我们引入了可扩缩的平行战略,以改善基于神经网络的蒙特卡洛变量量的计算,用于AB-initio量子化学应用。我们建立了由GPU支持的地方能源平行法,以计算可能复杂分子的汉密尔顿人的优化目标。我们使用自动递增取样技术,系统地改进实现CSD基线目标能量所需的倒计时。通过将结果的汉密尔顿变量结构纳入自动递增取样顺序,我们进一步提高了这一性能。算法与典型的近似方法和现有神经网络方法相比,取得了有前途的业绩,并展示了时间和可伸缩性优势。