ABSTRACT. The free contraction norm (or the (t)-norm) was introduced in [BCN12] as a tool to compute the typical location of the collection of singular values associated to a random subspace of the tensor product of two Hilbert spaces. In turn, it was used in [BCN13] in order to obtain sharp bounds for the violation of the additivity of the minimum output entropy for random quantum channels with Bell states. This free con-traction norm, however, is difficult to compute explicitly. The purpose of this note is to give a good estimate for this norm. Our technique is based on results of super convergence in the context of free probability theory. As an application, we give a new, simple and conceptual proof of the violation of the additivity of...
Entropies have been immensely useful in information theory. In this Thesis, several results in quan...
Since the introduction of the (smooth) min- and max-entropy, various results have affirmed their fun...
The entropy accumulation theorem states that the smooth min-entropy of an n-partite system A = (A_1 ...
AbstractIn this paper we obtain new bounds for the minimum output entropies of random quantum channe...
3 figures added, minor typos correctedIn this paper we obtain new bounds for the minimum output entr...
The problem of additivity of the Minimum Output Entropy is of fundamental importance in Quantum Info...
Based on the problem of quantum data compression in a lossless way, we present here an operational i...
Given a random subspace H_n chosen uniformly in a tensor product of Hilbert spaces V_n ⊗ W , we cons...
The strength of quantum correlations is bounded from above by Tsirelson's bound. We establish a conn...
A classical random variable can be faithfully compressed into a sequence of bits with its expected l...
Based on the problem of quantum data compression in a lossless way, we present here an operational i...
Abstract. We consider the problem of computing the family of operator norms recently introduced in [...
We prove that the classical capacity of an arbitrary quantum channel assisted by a free classical fe...
Let X_1,..., X_n be a sequence of n classical random variables and consider a sample Xs_1,..., Xs_r ...
One may maximize Shannon’s entropy -Sum over i f(ei) ln(f(ei)) subject to the constraint Sum over i ...
Entropies have been immensely useful in information theory. In this Thesis, several results in quan...
Since the introduction of the (smooth) min- and max-entropy, various results have affirmed their fun...
The entropy accumulation theorem states that the smooth min-entropy of an n-partite system A = (A_1 ...
AbstractIn this paper we obtain new bounds for the minimum output entropies of random quantum channe...
3 figures added, minor typos correctedIn this paper we obtain new bounds for the minimum output entr...
The problem of additivity of the Minimum Output Entropy is of fundamental importance in Quantum Info...
Based on the problem of quantum data compression in a lossless way, we present here an operational i...
Given a random subspace H_n chosen uniformly in a tensor product of Hilbert spaces V_n ⊗ W , we cons...
The strength of quantum correlations is bounded from above by Tsirelson's bound. We establish a conn...
A classical random variable can be faithfully compressed into a sequence of bits with its expected l...
Based on the problem of quantum data compression in a lossless way, we present here an operational i...
Abstract. We consider the problem of computing the family of operator norms recently introduced in [...
We prove that the classical capacity of an arbitrary quantum channel assisted by a free classical fe...
Let X_1,..., X_n be a sequence of n classical random variables and consider a sample Xs_1,..., Xs_r ...
One may maximize Shannon’s entropy -Sum over i f(ei) ln(f(ei)) subject to the constraint Sum over i ...
Entropies have been immensely useful in information theory. In this Thesis, several results in quan...
Since the introduction of the (smooth) min- and max-entropy, various results have affirmed their fun...
The entropy accumulation theorem states that the smooth min-entropy of an n-partite system A = (A_1 ...