Strong Convexity of Sandwiched Entropies and Related Optimization Problems

Abstract

We present several theorems on strict and strong convexity, and higher order differential formulae for sandwiched quasi-relative entropy (a parametrised version of the classical fidelity). These are crucial for establishing global linear convergence of the gradient projection algorithm for optimisation problems for these functions. The case of the classical fidelity is of special interest for the multimarginal optimal transport problem (the $n$-coupling problem) for Gaussian measures.

In one of the statements of Theorem 4 of the first version of this paper, an extra condition that is needed was missing. This has been corrected in the present version, where that Theorem is now Theorem 5. The rest of the paper is unaffected

References in corpus (8)

• On quantum Renyi entropies: a new generalization and some properties
• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
• Min- and Max- Relative Entropies and a New Entanglement Monotone
• Monotonicity of a relative Rényi entropy
• alpha-z-relative Renyi entropies
• On Variational Expressions for Quantum Relative Entropies
• Transition Probability (Fidelity) and Its Relatives
• Geodesic distances on density matrices

Cited by in corpus (5)

• On a generalization of the Jensen-Shannon divergence and the JS-symmetrization of distances relying on abstract means
• Matrix versions of the Hellinger distance
• Quantum Bayes' rule and Petz transpose map from the minimum change principle
• Imaginarity measures induced by relative entropy
• A fixed-point algorithm for matrix projections with applications in quantum information