An upper bound on quantum capacity of unital channels

Abstract

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.

A note on quantum capacity of unital channels and multiplicativity of their output 2-norms. v2. Fixed proofs and clarified the connection to Petz recovery map

References in corpus (13)

• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
• Entropy and Entanglement in Quantum Ground States
• Degenerate Quantum Codes for Pauli Channels
• Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication
• Fundamental bound on the reliability of quantum information transmission
• On the strong converses for the quantum channel capacity theorems
• Random Unitaries Give Quantum Expanders
• Multiplicativity of completely bounded $p$-norms implies a strong converse for entanglement-assisted capacity
• Counterexamples to additivity of minimum output p-Renyi entropy for p close to 0
• Decoding quantum information via the Petz recovery map
• Local tests of global entanglement and a counterexample to the generalized area law
• Strong converse for the classical capacity of the pure-loss bosonic channel
• A semidefinite programming upper bound of quantum capacity

Cited by in corpus (1)

• Resonant Multilevel Amplitude Damping Channels