Additivity rates and PPT property for random quantum channels

preprint2015arXivOpen access

Abstract

Inspired by Montanaro's work, we introduce the concept of additivity rates of a quantum channel LL, which give the first order (linear) term of the minimum output pp-Rényi entropies of L⊗rL^{\otimes r} as functions of rr. 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 pp-Rényi entropy for all p≥30.95p\geq30.95.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.