Super-duper-activation of the zero-error quantum capacity

The zero-error classical capacity of a quantum channel is the asymptotic rate at which it can be used to send classical bits perfectly, so that they can be decoded with zero probability of error. The study of zero-error capacities dates right back to Shannon and the early days of information theory. We show that there exist pairs of quantum channels, neither of which individually have any zero-error capacity whatsoever (even if arbitrarily many uses of the channels are available), but such that access to even a single copy of both channels allows classical information to be sent perfectly reliably. In other words, we prove that the zero-error classical capacity can be superactivated. This result is the first example of superactivation of a classical capacity of a quantum channel. We further strengthen this result to show that there exist pairs of channels, neither of which have any zero-error classical capacity (as before), yet for which access to one copy of the joint channel even allows far more delicate quantum information to be transmitted perfectly. This subsumes the first result, and also implies that the quantum zero-error capacity can be superactivated. But it is strictly stronger than either of these. Indeed, this is the strongest conceivable form of superactivation, and nothing similar is possible for standard Shannon capacities of quantum channels or for zero-error capacities of classical channels.

[1]  Alexander S. Holevo,et al.  The Capacity of the Quantum Channel with General Signal States , 1996, IEEE Trans. Inf. Theory.

[2]  Jianxin Chen,et al.  Superactivation of the Asymptotic Zero-Error Classical Capacity of a Quantum Channel , 2009, IEEE Transactions on Information Theory.

[3]  D. Vernon Inform , 1995, Encyclopedia of the UN Sustainable Development Goals.

[4]  P. Shor,et al.  QUANTUM-CHANNEL CAPACITY OF VERY NOISY CHANNELS , 1997, quant-ph/9706061.

[5]  Andreas J. Winter,et al.  Counterexamples to the Maximal p-Norm Multiplicativity Conjecture for all p > 1 , 2008, ArXiv.

[6]  Aram W. Harrow,et al.  Counterexamples to Additivity of Minimum Output p-Rényi Entropy for p Close to 0 , 2007, 0712.3628.

[7]  Graeme Smith,et al.  Extensive nonadditivity of privacy. , 2009, Physical review letters.

[8]  S. Lloyd Capacity of the noisy quantum channel , 1996, quant-ph/9604015.

[9]  Alon Orlitsky,et al.  Zero-Error Information Theory , 1998, IEEE Trans. Inf. Theory.

[10]  Igor Devetak The private classical capacity and quantum capacity of a quantum channel , 2005, IEEE Transactions on Information Theory.

[11]  Graeme Smith,et al.  Quantum Communication with Zero-Capacity Channels , 2008, Science.

[12]  Guang-Can Guo,et al.  Nonadditivity of the Private Classical Capacity of a Quantum Channel , 2009 .

[13]  M. Hastings Superadditivity of communication capacity using entangled inputs , 2009 .

[14]  Michael D. Westmoreland,et al.  Sending classical information via noisy quantum channels , 1997 .

[15]  Ashish V. Thapliyal,et al.  Superactivation of bound entanglement. , 2000, Physical review letters.