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 diamond and completely bounded norms for linear maps play an increasingly important role in quantum information science, providing fundamental stabilized distance measures for differences of quantum operations. We give a brief introduction to the theory of completely bounded maps. Based on this theory, we formulate an algorithm to compute the norm of an arbitrary linear map. We present an implementation of the algorithm via MATLAB, discuss its efficiency, and consider the case of differences of unitary maps.
For a positive integer
n, let
Mn be the set of
n×n complex matrices. Suppose
∥⋅∥ is the Ky Fan
k-norm with
1≤k≤mn or the Schatten
p-norm with
1≤p≤∞ (
p=2) on
Mmn, where
m,n≥2 are positive integers. It is shown that a linear map
ϕ:Mmn→Mmn satisfying
∥A⊗B∥=∥ϕ(A⊗B)∥forallA∈MmandB∈Mn if and only if there are unitary
U,V∈Mmn such that
ϕ has the form
A⊗B↦U(φ1(A)⊗φ2(B))V, where
φs(X) is either the identity map
X↦X or the transposition map
X↦Xt. The results are extended to tensor space
Mn1⊗⋯⊗Mnm of higher level. The connection of the problem to quantum information science is mentioned.
Abstract. We consider a family of vector and operator norms which we refer to as Schmidt norms. We show that these norms have several uses in quantum information theory – they can be used to help classify k-positive linear maps (and hence entanglement witnesses), they are useful for approaching the problem of finding non-positive partial transpose bound entangled Werner states, they are related to the quantum fidelity and trace distance measures, and they are connected to the recently-defined local numerical range. We show that the vector norms can be explicitly calculated, and we derive several inequalities in order to bound the operator norms and compute them in special cases. We show that one particular entangled Werner state is bound entangled if and only if a certain norm inequality holds on a given family of projections, and we use our inequalities to study that family of projections. We also develop a family of semidefinite programs that can be used to further bound the operator norms. We extend these norms to arbitrary convex mapping cones and explore their implications with positive partial transpose states. 1.
We define 2-indexed
(q,p)-Schatten quasi-norms for any
q,p>0 on operators on a tensor product of Hilbert spaces, naturally extending the norms defined by Pisier's theory of operator-valued Schatten spaces. We establish several desirable properties of these quasi-norms, such as relational consistency and the behavior on block diagonal operators, assuming that
∣q1−p1∣≤1. In fact, we show that this condition is essentially necessary for natural properties to hold. Furthermore, for linear maps between spaces of such quasi-norms, we introduce completely bounded quasi-norms and co-quasi-norms. We prove that the
q→p completely bounded co-quasi-norm is super-multiplicative for tensor products of quantum channels for
q≥p>0, extending an influential result of [Devetak, Junge, King, Ruskai, 2006]. Our proofs rely on elementary matrix analysis and operator convexity tools and do not require operator space theory. On the applications side, we demonstrate that these quasi-norms can be used to express relevant quantum information measures such as Rényi conditional entropies for
α≥21 or the Sandwiched Rényi Umlaut information for
α<1. Our multiplicativity results imply a tensorizing notion of reverse hypercontractivity, additivity of the completely bounded minimum output Rényi-
α-entropy for
α≥21 extending another important result of [Devetak, Junge, King, Ruskai, 2006], and additivity of the maximum output Rényi-
α entropy for
α≥21.
We prove a hypercontractive inequality for matrix-valued functions defined over large alphabets. In order to do so, we prove a generalization of the powerful 2-uniform convexity inequality for trace norms of Ball, Carlen, Lieb (Inventiones Mathematicae’94). Using our hypercontractive inequality, we present upper and lower bounds for the communication complexity of the Hidden Hypermatching problem defined over large alphabets. We then consider streaming algorithms for approximating the value of Unique Games on a hypergraph with t -size hyperedges. By using our communication lower bound, we show that every streaming algorithm in the adversarial model achieving an
(r−ε) -approximation of this value requires
Ω(n1−2/t) quantum space, where r is the alphabet size. We next present a lower bound for locally decodable codes (
LDC )
Zrn→ZrN over large alphabets with recoverability probability at least
1/r+ε . Using hypercontractivity, we give an exponential lower bound
N=2Ω(ε4n/r4) for 2-query (possibly non-linear)
LDC s over
Zr and using the non-commutative Khintchine inequality we prove an improved lower bound of
N=2Ω(ε2n/r2) .