Optimal Self-Concordant Barriers for Quantum Relative Entropies
From MaRDI portal
Publication:6060146
Abstract: Quantum relative entropies are jointly convex functions of two positive definite matrices that generalize the Kullback-Leibler divergence and arise naturally in quantum information theory. In this paper, we prove self-concordance of natural barrier functions for the epigraphs of various quantum relative entropies and divergences. Furthermore we show that these barriers have optimal barrier parameter. These barriers allow convex optimization problems involving quantum relative entropies to be directly solved using interior point methods for non-symmetric cones, avoiding the approximations and lifting techniques used in previous approaches. More generally, we establish the self-concordance of natural barriers for various closed convex cones related to the noncommutative perspectives of operator concave functions, and show that the resulting barrier parameters are optimal.
Recommendations
- Matrix monotonicity and self-concordance: how to handle quantum entropy in optimization problems
- Relative entropy optimization and its applications
- On convex optimization problems in quantum information theory
- The entropic barrier is \(n\)-self-concordant
- The volumetric barrier for convex quadratic constraints
Cites work
- scientific article; zbMATH DE number 3834700 (Why is no real title available?)
- scientific article; zbMATH DE number 4146872 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 841537 (Why is no real title available?)
- scientific article; zbMATH DE number 967931 (Why is no real title available?)
- A matrix convexity approach to some celebrated quantum inequalities
- A new quantum version of f-divergence
- Alfonso: Matlab Package for Nonsymmetric Conic Optimization
- Concavity of certain maps on positive definite matrices and applications to Hadamard products
- Convex Analysis
- Convex trace functions and the Wigner-Yanase-Dyson conjecture
- Different quantum \(f\)-divergences and the reversibility of quantum operations
- Efficient Approximation of Quantum Channel Capacities
- Efficient optimization of the quantum relative entropy
- Error bounds, facial residual functions and applications to the exponential cone
- From Wigner-Yanase-Dyson conjecture to Carlen-Frank-Lieb conjecture
- Geometric Rényi divergence and its applications in quantum channel capacities
- JENSEN'S OPERATOR INEQUALITY
- Lectures on convex optimization
- Lifting for simplicity: concise descriptions of convex sets
- Low-rank kernel learning with Bregman matrix divergences
- Matrix Analysis: Matrix Monotone Functions, Matrix Means, and Majorization
- Matrix monotonicity and self-concordance: how to handle quantum entropy in optimization problems
- Monotonicity of a relative Rényi entropy
- On quantum Rényi entropies: a new generalization and some properties
- Operator monotone functions, positive definite kernels and majorization
- Performance enhancements for a generic conic interior point algorithm
- Perspectives of matrix convex functions
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Primal-dual interior-point methods for domain-driven formulations
- Quantum information processing with finite resources. Mathematical foundations
- Quasi-entropies for finite quantum systems
- Relative entropy optimization and its applications
- Sandwiched Rényi divergence satisfies data processing inequality
- Semidefinite approximations of the matrix logarithm
- Solving Natural Conic Formulations with Hypatia.jl
- Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy
Cited in
(2)
This page was built for publication: Optimal Self-Concordant Barriers for Quantum Relative Entropies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6060146)
