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.

翻译：我们提出了一种极小极大化方法，用于刻画不同共享资源模型下完全量子任意变化信道（FQAVC）的容量。与先前方法相比，我们的技术避免了de Finetti型约化，从而提供了一种更简洁的证明，且不依赖于干扰系统的维度。由此我们证明，即使在一般量子对抗者存在的情况下，FQAVC的纠缠辅助容量与共享随机性辅助容量均与相应复合信道的容量一致。