Riemannian Optimization for Holevo Capacity

Abstract

Computing the classical capacity of a noisy quantum channel is crucial for understanding the limits of communication over quantum channels. However, its evaluation remains challenging due to the difficulty of computing the Holevo capacity and the even greater difficulty of regularization. In this work, we formulate the computation of the Holevo capacity as an optimization problem on a product manifold constructed from probability distributions and their corresponding pure input states for a quantum channel. A Riemannian gradient descent algorithm is proposed to solve the problem, providing lower bounds on the classical capacity of general quantum channels and outperforming existing methods in numerical experiments in both efficiency and scale.