arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.02245quant-phphysics.comp-ph
收藏

采样二维等距张量网络态

Sampling two-dimensional isometric tensor network states

Lawrence Berkeley National Laboratory(劳伦斯伯克利国家实验室);Oak Ridge National Laboratory(橡树岭国家实验室)

Alec Dektor, Eugene Dumitrescu, Chao Yang

AI总结:

提出两种采样二维等距张量网络态的新算法,分别实现独立采样和贪心搜索高概率构型,数值实验验证了其在不同纠缠和系统规模下的有效性。

摘要:

采样量子系统的基础概率分布是一项重要的计算任务,例如用于量子优势实验和量子蒙特卡洛算法。张量网络是高效表示具有有限纠缠的大规模量子系统状态的重要工具。一维张量网络的采样算法已经成熟,并应用于多种一维张量网络方法中。本文针对二维等距张量网络态(isoTNS)提出了两种新的采样算法,推广了现有的一维张量网络采样算法。我们提出的第一个算法执行独立采样,并生成单个构型及其关联概率。第二个算法采用贪心搜索策略来识别$K$个高概率构型及其对应概率。数值结果展示了这些算法在不同纠缠和系统规模的量子态上的有效性。

英文摘要:

Sampling a quantum system's underlying probability distributions is an important computational task, e.g., for quantum advantage experiments and quantum Monte Carlo algorithms. Tensor networks are an invaluable tool for efficiently representing states of large quantum systems with limited entanglement. Algorithms for sampling one-dimensional (1D) tensor networks are well-established and utilized in several 1D tensor network methods. In this paper we introduce two novel sampling algorithms for two-dimensional (2D) isometric tensor network states (isoTNS) that generalize existing 1D tensor networks sampling algorithms. Our first proposed algorithm performs independent sampling and yields a single configuration together with its associated probability. The second algorithm employs a greedy search strategy to identify $K$ high-probability configurations and their corresponding probabilities. Numerical results demonstrate the effectiveness of these algorithms across quantum states with varying entanglement and system size.

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

↑