Interior Point Methods for Structured Quantum Relative Entropy Optimization Problems

TL;DR

This paper enhances interior-point methods for quantum relative entropy optimization by exploiting problem structures, leading to significant efficiency improvements and enabling solutions to previously intractable quantum information problems.

Contribution

It introduces structural insights and barrier function simplifications that improve the efficiency of interior-point methods for quantum relative entropy problems.

Findings

Barrier function remains self-concordant with singular matrices.

Reduces barrier parameter by removing redundant terms.

Achieves up to several orders of magnitude faster computation.

Abstract

Quantum relative entropy optimization refers to a class of convex problems in which a linear functional is minimized over an affine section of the epigraph of the quantum relative entropy function. Recently, the self-concordance of a natural barrier function was proved for this set, and various implementations of interior-point methods have been made available to solve this class of optimization problems. In this paper, we show how common structures arising from applications in quantum information theory can be exploited to improve the efficiency of solving quantum relative entropy optimization problems using interior-point methods. First, we show that the natural barrier function for the epigraph of the quantum relative entropy composed with positive linear operators is self-concordant, even when these linear operators map to singular matrices. Compared to modelling problems using the full quantum relative entropy cone, this allows us to remove redundant log-determinant expressions from the barrier function and reduce the overall barrier parameter. Second, we show how certain slices of the quantum relative entropy cone exhibit useful properties which should be exploited whenever possible to perform certain key steps of interior-point methods more efficiently. We demonstrate how these methods can be applied to applications in quantum information theory, including quantifying quantum key rates, quantum rate-distortion functions, quantum channel capacities, and the ground state energy of Hamiltonians. Our numerical results show that these techniques improve computation times by up to several orders of magnitude, and allow previously intractable problems to be solved.