We study classical-quantum (C-Q) channel resolvability. C-Q channel resolvability has been proved by only random coding in the literature. In our previous study, we proved channel resolvability by deterministic coding, using multiplicative weight update algorithm. We extend this approach to C-Q channels and prove C-Q channel resolvability by deterministic coding, using the matrix multiplicative weight update algorithm. This is the first approach to C-Q channel resolvability using deterministic coding.

翻译：我们研究经典-量子（C-Q）信道可分辨性问题。现有文献仅通过随机编码证明了C-Q信道可分辨性。在先前的研究中，我们通过确定性编码并利用乘性权重更新算法证明了信道可分辨性。本文将这种方法推广至C-Q信道，通过确定性编码并利用矩阵乘性权重更新算法证明了C-Q信道可分辨性。这是首次采用确定性编码方法实现C-Q信道可分辨性的研究。