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.
Randomization of quantum states is the quantum analogue of the classical one‐time pad. We present an improved, efficient construction of an approximately randomizing map that uses O(d/ε2) Pauli operators to map any d‐dimensional state to a state that is within trace distance ε of the completely mixed state. Our bound is a log d factor smaller than that of Hayden, Leung, Shor, and Winter, and Ambainis and Smith.Then, we show that a random sequence of essentially the same number of unitary operators, chosen from an appropriate set, with high probability form an approximately randomizing map for d‐dimensional states. Finally, we discuss the optimality of these schemes via connections to different notions of pseudorandomness, and give a new lower bound for small ε.