Channel coding against quantum jammers via minimax

IEEE International Symposium on Information Theory (ISIT), pp. 1–6

Abstract

We introduce a minimax approach for characterizing the capacities of fully quantum arbitrarily varying channels (FQAVCs) under different shared resource models. In contrast to previous methods, our technique avoids de Finetti-type reductions, providing a more streamlined proof without dependency on the dimension of the jamming system. Consequently, we show that the entanglement-assisted and shared-randomness-assisted capacities of FQAVCs match those of the corresponding compound channels, even in the presence of general quantum adversaries.

Authors 3

1. Michael X. Cao Aachen

   RWTH Aachen University

   Affiliation as printed

   RWTH Aachen University

2. Yongsheng Yao Aachen

   RWTH Aachen University

   Affiliation as printed

   RWTH Aachen University

3. Mario Berta Aachen

   RWTH Aachen University

   Affiliation as printed

   RWTH Aachen University