00629nas a2200157 4500008003900000022001400039245006800053210006700121260001600188300001600204490000700220100001800227700002100245700002000266856018500286 2019 d a0018-944800aSecure and Robust Identification via Classical-Quantum Channels0 aSecure and Robust Identification via ClassicalQuantum Channels cJan-10-2019 a6734 - 67490 v651 aBoche, Holger1 aDeppe, Christian1 aWinter, Andreas uhttps://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=18https://ieeexplore.ieee.org/document/8731894/http://xplorestaging.ieee.org/ielx7/18/8836351/08731894.pdf?arnumber=873189401506nas a2200169 4500008003700000020002400037245009600061210006900157260006000226300001600286520090900302100001801211700002101229700001901250700002001269856004701289 0 d a{978-1-5386-4781-3}00a{Fully Quantum Arbitrarily Varying Channels: Random Coding Capacity and Capacity Dichotomy}0 aFully Quantum Arbitrarily Varying Channels Random Coding Capacit b{IEEE; IEEE Informat Theory Soc; NSF; Huawei; Qualcomm} a{2012-2016}3 a{We consider a model of communication via a fully quantum jammer channel with quantum jammer, quantum sender and quantum receiver, which we dub quantum arbitrarily varying channel (QAVC). Restricting to finite dimensional user and jammer systems, we show, using permutation symmetry and a de Finetti reduction, how the random coding capacity (classical and quantum) of the QAVC is reduced to the capacity of a naturally associated compound channel, which is obtained by restricting the jammer to i.i.d. input states. Furthermore, we demonstrate that the shared randomness required is at most logarithmic in the block length, via a quantum version of the ``elimination of of correlation{''} using a random matrix tail bound. This implies a dichotomy theorem: either the classical capacity of the QAVC is zero, and then also the quantum capacity is zero, or each capacity equals its random coding variant.}1 aBoche, Holger1 aDeppe, Christian1 aNoetzel, Janis1 aWinter, Andreas uhttp://grupsderecerca.uab.cat/giq/node/92401639nas a2200157 4500008003700000020002400037245007000061210006700131260006000198300001600258520110100274100001801375700002101393700002001414856004701434 0 d a{978-1-5386-4781-3}00a{Secure and Robust Identification via Classical-Quantum Channels}0 aSecure and Robust Identification via ClassicalQuantum Channels b{IEEE; IEEE Informat Theory Soc; NSF; Huawei; Qualcomm} a{2674-2678}3 a{We study the identification capacity of classical-quantum channels ({''}cq-channels{''}), under channel uncertainty and privacy constraints. To be precise, we consider first compound memoryless cq-channels and determine their identification capacity; then we add an eavesdropper, considering compound memoryless wiretap cqq-channels, and determine their secret identification capacity. In the first case (without privacy), we find the identification capacity always equal to the transmission capacity. In the second case, we find a dichotomy: either the secrecy capacity (also known as private capacity) of the channel is zero, and then also the secrecy identification capacity is zero, or the secrecy capacity is positive and then the secrecy identification capacity equals the transmission capacity of the main channel without the wiretapper. We perform the same analysis for the case of arbitrarily varying wiretap cqq-channels (cqq-AVWC), with analogous findings, and make several observations regarding the continuity and super-additivity of the identification capacity in the latter case.}1 aBoche, Holger1 aDeppe, Christian1 aWinter, Andreas uhttp://grupsderecerca.uab.cat/giq/node/925