For large d, we study quantum channels on C d obtained by selecting ran- domly N independent Kraus operators according to a probability measure µ on the unitary group U(d). When µ is the Haar measure, we show that for N d/e 2 , such a channel is e-randomizing with high probability, which means that it maps every state within distance e/d (in operator norm) of the maximally mixed state. This slightly improves on a result by Hayden, Leung, Shor and Winter by optimizing their discreti- zation argument. Moreover, for general µ, we obtain an e-randomizing channel provided N d (log d) 6 /e 2 .F ord = 2 k (k qubits), this includes Kraus operators obtained by ten- soring k random Pauli matrices. This leads to more efficient constructions of almost randomizing channels. The proof uses recent results on empirical processes in Banach spaces.
Abstract Very recently, Karder and Petek completely described maps on density matrices (positive semidefinite matrices with unit trace) preserving certain entropy-like convex functionals of any convex combination. As a result, maps could be characterized that preserve von Neumann entropy or Schatten
p -norm of any convex combination of quantum states (whose mathematical representatives are the density matrices). In this note we consider these latter two problems on the set of invertible density operators, in a much more general setting, on the set of positive invertible elements with unit trace in a
C∗ -algebra.
Let
Φ be a super-operator, i.e., a linear mapping of the form
Φ:L(F)→L(G) for finite dimensional Hilbert spaces
F and
G. This paper considers basic properties of the super-operator norms defined by
∥Φ∥q→p=sup{∥Φ(X)∥p/∥X∥q:X=0}, induced by Schatten norms for
1≤p,q≤∞. These super-operator norms arise in various contexts in the study of quantum information. In this paper it is proved that if
Φ is completely positive, the value of the supremum in the definition of
∥Φ∥q→p is achieved by a positive semidefinite operator
X, answering a question recently posed by King and Ruskai~\cite{KingR04}. However, for any choice of
p∈[1,∞], there exists a super-operator
Φ that is the {\em difference} of two completely positive, trace-preserving super-operators such that all Hermitian
X fail to achieve the supremum in the definition of
∥Φ∥1→p. Also considered are the properties of the above norms for super-operators tensored with the identity super-operator. In particular, it is proved that for all
p≥2,
q≤2, and arbitrary
Φ, the norm
∥Φ∥q→p is stable under tensoring
Φ with the identity super-operator, meaning that
∥Φ∥q→p=∥Φ⊗I∥q→p. For
1≤p<2, the norm
∥Φ∥1→p may fail to be stable with respect to tensoring
Φ with the identity super-operator as just described, but
∥Φ⊗I∥1→p is stable in this sense for
I the identity super-operator on
L(H) for $\op{dim}(\mathcal{H}) = \op{dim}(\mathcal{F})$. This generalizes and simplifies a proof due to Kitaev \cite{Kitaev97} that established this fact for the case
p=1.
The concept of $\e$-randomizing quantum channels has been introduced by Hayden, Leung, Shor and Winter in connection with approximately encrypting quantum states. They proved using a discretization argument that sets of roughly
dlogd random unitary operators provide examples of such channels on $\C^d$. We show that a simple trick improves the efficiency of the argument and reduces the number of unitary operators to roughly
d.