An upper bound on quantum capacity of unital channels
  We analyze the quantum capacity of a unital quantum channel, using ideas from the proof of near-optimality of Petz recovery map [Barnum and Knill 2000] and give an upper bound on the quantum capacity in terms of regularized output $2$-norm of the channel. We also show that any code attempting to exceed this upper bound must incur large error in decoding, which can be viewed as a weaker version of the strong converse results for quantum capacity. As an application, we find nearly matching upper and lower bounds (up to an additive constant) on the quantum capacity of quantum expander channels. Using these techniques, we further conclude that the `mixture of random unitaries' channels arising in the construction of quantum expanders in [Hastings 2007] show a trend in multiplicativity of output $2$-norm similar to that exhibited in [Montanaro 2013] for output $\infty$-norm of random quantum channels. 
Anurag Anshu
quant-ph