Channel coding against quantum jammers via minimax
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.
Fields of Study & Subjects
Quantum Information and Cryptography
Quantum Computing Algorithms and Architecture
Quantum Mechanics and Applications
Publication details
- Journal / source
- 2026 IEEE International Symposium on Information Theory (ISIT)
- Publisher
- IEEE
- Pages
- 1–6
- Publication date
- 1 June 2026
- Language
- EN