Maximizing the divergence from a hierarchical model of quantum states
arXiv:1406.0833 · doi:10.1142/S1230161215500067
Abstract
We study many-party correlations quantified in terms of the Umegaki relative entropy (divergence) from a Gibbs family known as a hierarchical model. We derive these quantities from the maximum-entropy principle which was used earlier to define the closely related irreducible correlation. We point out differences between quantum states and probability vectors which exist in hierarchical models, in the divergence from a hierarchical model and in local maximizers of this divergence. The differences are, respectively, missing factorization, discontinuity and reduction of uncertainty. We discuss global maximizers of the mutual information of separable qubit states.
18 pages, 1 figure, v2: improved exposition, v3: less typos
References in corpus (6)
- On the quantum, classical and total amount of correlations in a quantum state
- On the toric algebra of graphical models
- Using Separable Bell-Diagonal States to Distribute Entanglement
- Computing complexity measures for quantum states based on exponential families
- Complexity classification of local Hamiltonian problems
- The MaxEnt extension of a quantum Gibbs family, convex geometry and geodesics
Cited by in corpus (11)
- Adaptation of the Alicki-Fannes-Winter method for the set of states with bounded energy and its use
- Theoretical investigations of an information geometric approach to complexity
- Canonical divergence for measuring classical and quantum complexity
- von Neumann measurement-related matrices and the nullity condition for quantum correlation
- The MaxEnt extension of a quantum Gibbs family, convex geometry and geodesics
- A new signature of quantum phase transitions from the numerical range
- A variation principle for ground spaces
- Quantum marginals, faces, and coatoms
- Separability criteria based on the Weyl operators
- Canonical divergence for flat -connections: Classical and Quantum
- An information geometric perspective on the complexity of macroscopic predictions arising from incomplete information