We obtain two new additivity results of quantum channels. The first one is the additivity of the channel Rényi information associated with the sandwiched Rényi divergence of order
α∈[21,1). To prove this, we introduce the completely bounded
1→α quasi-norms for completely positive maps, with
α∈[21,1), and show that it is multiplicative. The additivity/multiplicativity derived here extends and complements the results of Devetak {\it et al} (Commun Math Phys 266:37-63, 2006) and Gupta and Wilde (Commun Math Phys 334:867-887, 2015), which deal with the case
α>1. The second one is the additivity of the channel dispersion, which is a quantity related to the second-order behavior of quantum information tasks.
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.
Given a linear map Φ:Mn→Mm , its multiplicity maps are defined as the family of linear maps Φ⊗idk:Mn⊗Mk→Mm⊗Mk , where idk denotes the identity on Mk . Let ‖⋅‖1 denote the trace-norm on matrices, as well as the induced trace-norm on linear maps of matrices, i.e. ‖Φ‖1=max{‖Φ(X)‖1:X∈Mn,‖X‖1=1} . A fact of fundamental importance in both operator algebras and quantum information is that ‖Φ⊗idk‖1 can grow with k . In general, the rate of growth is bounded by ‖Φ⊗idk‖1≤k‖Φ‖1 , and matrix transposition is the canonical example of a map achieving this bound. We prove that, up to an equivalence, the transpose is the unique map achieving this bound. The equivalence is given in terms of complete trace-norm isometries, and the proof relies on a particular characterization of complete trace-norm isometries regarding preservation of certain multiplication relations.We use this result to characterize the set of single-shot quantum channel discrimination games satisfying a norm relation that, operationally, implies that the game can be won with certainty using entanglement, but is hard to win without entanglement. Specifically, we show that the well-known example of such a game, involving the Werner-Holevo channels, is essentially the unique game satisfying this norm relation. This constitutes a step towards a characterization of single-shot quantum channel discrimination games with maximal gap between optimal performance of entangled and unentangled strategies.