论文标题
Petz地图和Python的午餐
Petz map and Python's lunch
论文作者
论文摘要
我们从Petz Map的角度看一下内部操作员的重建，并研究其复杂性。我们表明，在完美恢复的条件下，Petz地图可以写为前体。当我们拥有整个边界系统时，其复杂性与从散装操作员到边界的虫洞的音量 /动作有关。当我们只能访问系统的一部分时，就会出现Python的午餐，其限制的复杂性呈指数级取决于子系统的大小，一个人失去了访问权限。
We look at the interior operator reconstruction from the point of view of Petz map and study its complexity. We show that Petz maps can be written as precursors under the condition of perfect recovery. When we have the entire boundary system its complexity is related to the volume / action of the wormhole from the bulk operator to the boundary. When we only have access to part of the system, Python's lunch appears and its restricted complexity depends exponentially on the size of the subsystem one loses access to.
