arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.02029quant-phhep-th
收藏

来自超不变张量网络的体-边对应

Bulk-boundary correspondence from hyper-invariant tensor networks

Rafał Bistroń, Mykhailo Hontarenko, Karol Życzkowski

AI总结:

提出一种融合体指标的超不变张量网络,可保持HaPPY码特性并准确再现边界CFT的二、三点关联函数,为量子信息中的全息原理模拟提供高效方法。

摘要:

我们引入了一种张量网络,旨在忠实地模拟AdS/CFT对应,类似于多尺度纠缠重整化拟设(MERA),并遵循超不变张量网络。所提出的构造将体指标整合到网络架构中,以维护HaPPY码的关键特征,包括互补恢复。该框架在考虑任意体算符的像的同时,准确再现了边界共形场论(CFT)的两点和三点关联函数。此外,我们提供了一种以高效方式计算关联函数的显式方法。我们的研究结果突出了张量网络模型中体与边界之间关系的物理方面,有助于理解和模拟量子信息中的全息原理。

英文摘要:

We introduce a tensor network designed to faithfully simulate the AdS/CFT correspondence, akin to the multi-scale entanglement renormalization ansatz (MERA), following hyper-invariant tensor network. The proposed construction integrates bulk indices within the network architecture to uphold the key features of the HaPPY code, including complementary recovery. This framework accurately reproduces the boundary conformal field theory's (CFT) two- and three-point correlation functions, while considering the image of any bulk operator. Furthermore, we provide an explicit methodology for calculating the correlation functions in an efficient manner. Our findings highlight the physical aspects of the relation between bulk and boundary within the tensor network models, contributing to the understanding and simulation of holographic principles in quantum information.

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

↑