Channel coding against quantum jammers via minimax
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915820703055872 |
|---|---|
| author | Cao, Michael X. Yao, Yongsheng Berta, Mario |
| author_facet | Cao, Michael X. Yao, Yongsheng Berta, Mario |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_11362 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Channel coding against quantum jammers via minimax Cao, Michael X. Yao, Yongsheng Berta, Mario Quantum Physics Information Theory 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. |
| title | Channel coding against quantum jammers via minimax |
| topic | Quantum Physics Information Theory |
| url | https://arxiv.org/abs/2505.11362 |