Additivity rates and PPT property for random quantum channels

From MaRDI portal
Publication:2355464




Abstract: Inspired by Montanaro's work, we introduce the concept of additivity rates of a quantum channel L, which give the first order (linear) term of the minimum output p-R'enyi entropies of Lotimesr as functions of r. We lower bound the additivity rates of arbitrary quantum channels using the operator norms of several interesting matrices including partially transposed Choi matrices. As a direct consequence, we obtain upper bounds for the classical capacity of the channels. We study these matrices for random quantum channels defined by random subspaces of a bipartite tensor product space. A detailed spectral analysis of the relevant random matrix models is performed, and strong convergence towards free probabilistic limits is showed. As a corollary, we compute the threshold for random quantum channels to have the positive partial transpose (PPT) property. We then show that a class of random PPT channels violate generically additivity of the p-R'enyi entropy for all pgeq30.95.



Cites work









This page was built for publication: Additivity rates and PPT property for random quantum channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2355464)