arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.10013quant-phhep-thmath-phmath.MPmath.OA
收藏

代数量子场论中的复杂度

Complexity in algebraic QFT

Stefan Hollands, Alessio Ranallo

AI总结:

本文在相对论连续统量子场论中基于Belavkin-Staszewski散度定义量子信道复杂度,证明其具有复合信道次可加、类空间隔信道可加等合理性质,并提出BS散度的新变分原理作为技术工具。

摘要:

我们考虑相对论连续统量子场论(QFT)中量子信道的复杂度概念,该概念由到平凡(恒等)信道的距离定义。我们的距离度量基于从Belavkin-Staszewski(BS)散度导出的量子信道之间的特定散度。我们在QFT中代数所需的必要一般性下证明,相应的复杂度具有若干合理性质:(i)复合信道的复杂度不大于其各部分复杂度之和;(ii)对于定域在类空间隔区域的信道,它是可加的;(iii)它是凸的;(iv)对于N元测量信道,其复杂度为log N;(v)对于与具有有限Jones指标的QFT包含相关的条件期望,其复杂度由log(Jones指标)给出。我们工作中的主要技术工具是BS散度的一个新变分原理。

英文摘要:

We consider a notion of complexity of quantum channels in relativistic continuum quantum field theory (QFT) defined by the distance to the trivial (identity) channel. Our distance measure is based on a specific divergence between quantum channels derived from the Belavkin-Staszewski (BS) divergence. We prove in the prerequisite generality necessary for the algebras in QFT that the corresponding complexity has several reasonable properties: (i) the complexity of a composite channel is not larger than the sum of its parts, (ii) it is additive for channels localized in spacelike separated regions, (iii) it is convex, (iv) for an $N$-ary measurement channel it is $\log N$, (v) for a conditional expectation associated with an inclusion of QFTs with finite Jones index it is given by $\log (\text{Jones Index})$. The main technical tool in our work is a new variational principle for the BS divergence.

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

↑