Alternating minimization provably computes the doubly minimized Petz Rényi mutual information for all quantum states, with linear convergence for α∈(1,2] and O(1/n) convergence for α∈(1/2,1).
Probability mass functions Let X be a finite set
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
ACCEPT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Alternating minimization for computing doubly minimized Petz Renyi mutual information
Alternating minimization provably computes the doubly minimized Petz Rényi mutual information for all quantum states, with linear convergence for α∈(1,2] and O(1/n) convergence for α∈(1/2,1).