Classical-quantum arbitrarily varying wiretap channel: common randomness assisted code and continuity

Abstract

We determine the secrecy capacities under common randomness assisted coding of arbitrarily varying classical-quantum wiretap channels. Furthermore, we determine the secrecy capacity of a mixed channel model which is compound from the sender to the legitimate receiver and varies arbitrarily from the sender to the eavesdropper. We examine when the secrecy capacity is a continuous function of the system parameters as an application and show that resources, e.g., having access to a perfect copy of the outcome of a random experiment, can guarantee continuity of the capacity function of arbitrarily varying classical-quantum wiretap channels.