Logarithmic Sobolev inequality and Hypothesis of Quantum Gaussian Maximizers
Alexander Semenovich Holevo
A long-standing problem in quantum Shannon theory is the classical capacity of bosonic Gaussian channels of various kinds [6].The Hypothesis of Gaussian Maximizers (HGM) states that the full capacity of such channels is attained at Gaussian encodings.A breakthrough was made in the papers [1] and [2], where HGM was proved for the important class of multimode gauge co-or contra-variant Gaussian channels [4].In [8] and [5] the solution was extended to a much broader class of channels satisfying a certain 'threshold condition'.At the same time the HGM remains open for a large variety of Gaussian channels lying beyond the scope of the threshold condition [7].In this note we sketch a novel approach to such problems, based on principles of convex programming, and illustrate it using the characteristic case of an approximate position measurement with energy constraint, underlying noisy Gaussian homodyning in quantum optics.Rather remarkably, for this particular model the method reduces the solution of the optimization problem to a generalization of the celebrated log-Sobolev inequality.Let S be the convex set of all density operators in a separable Hilbert space H of the quantum system and X and Y be standard measurable spaces.Consider a measurement channel M : ρ → p ρ (y) = Tr ρm(y), where ρ ∈ S and m(y) is a uniformly bounded positive operator-valued function of y ∈ Y such that m(y) µ(dy) = I (I is the identity operator on H and µ is a measure).The encoding E = {π(dx), ρ(x)} is a probability measure π(dx) with a measurable family of
Russian Mathematical Surveys•Jan 1, 2022•2 citations