Complexity in algebraic QFT
arXiv:2302.10013 · doi:10.1007/s00220-023-04855-x
Abstract
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 -ary measurement channel it is , (v) for a conditional expectation associated with an inclusion of QFTs with finite Jones index it is given by . The main technical tool in our work is a new variational principle for the BS divergence.
arXiv comment45pp, no figures
References in corpus (21)
- Complexity and Shock Wave Geometries
- Quantum Computation as Geometry
- From Classical to Quantum Shannon Theory
- Circuit complexity in quantum field theory
- Towards Complexity for Quantum Field Theory States
- The Second Law of Quantum Complexity
- Quantum Computation as Gravity
- Nets of Subfactors
- Linear growth of quantum circuit complexity
- Black holes, complexity and quantum chaos
- Amortized Channel Divergence for Asymptotic Quantum Channel Discrimination
- Complexity of Mixed States in QFT and Holography
- Different quantum f-divergences and the reversibility of quantum operations
- The Quantum Wasserstein Distance of Order 1
- Entanglement measures and their properties in quantum field theory
- Geometry of Complexity in Conformal Field Theory
- A chain rule for the quantum relative entropy
- Entropic order parameters for the phases of QFT
- Canonical tensor product subfactors
- Quantum -divergences in von Neumann algebras II. Maximal -divergences
- On Landauer's principle and bound for infinite systems