We survey the modern status of two major analytical problems in quantum information theory. One is the famous additivity conjecture for information quantities related to the classical capacity of quantum channel. Another is less familiar and less studied problem of optimizers of the information quantities characterizing Bosonic Gaussian channels. We show that for gauge-invariant channels, the validity of the Gaussian minimizer conjecture for the output entropy implies Gaussianity of the ensemble maximizing the χ-capacity.
We show how Free Probability Theory-and in particular, recent results regarding the norm convergence of random matrices-help to better understand im- portant problems in Quantum Information Theory, such as the problem of Minimum Output Entropy additivity.This is a report on joint papers and projects with Ion Nechita, Serban Belinschi, Camille Male and Motohisa Fukuda 1. ENTANGLEMENT AND ADDITIVITY 1.1.Entanglement and entropy.In Quantum Information Theory, a vector subspace C of a tensor product A⊗B of two Hilbert spaces is said to be entangled iff 0 is the only vector of C that can be written as a⊗b with a∈A,b∈B .The problems of quantifying entanglement, and of finding 'highly' entangled spaces are very important in quantum information theory.For x∈A⊗B , its singular values -also known as Schmidt coefficients in Quantum Information Theory-are non-negative numbers λ1(x)≥…≥λk(x)≥0 such that x=∑i=1kλiei(x)⊗fi(x) Here, k=min(dim(A), dim(B));ei(x),fi(x) are orthonormal vectors.The sequence λ(x)=(λ1(x),…)∈Rk is uniquely defined.Let KC={λ(x),x∈C,∣∣x∣∣=1}⊂Rk .This compact set is a subset of the set △k+={y∈R+k:y1≥y2≥⋯≥yk≥0,∑i=1kyi=1}. Besides, we have Δk+⊂Δk , where Δk={x∈R+k∣∑i=1kxi=1} is the (k−1)− dimensional probability simplex.We will also make an abuse of notation and also denote by KC the subset of △k that is obtained by symmetrizing KC under permuting the coordinates.For a positive real number p>0, we recall that the R\'enyi entropy of order p of a probability vector x∈Δk to be $H^{p}(x):= \frac{1}{1-p}\log\sum_{i=1}^{k}x_{i}^{p}.$2010 Mathematics Subject Cassification.46L65(46L37,46L54,.46L87) .