Classical-Quantum Channel Resolvability Using Matrix Multiplicative Weight Update Algorithm

TL;DR

This paper introduces a novel deterministic coding approach for classical-quantum channel resolvability, utilizing the matrix multiplicative weight update algorithm, marking the first such method in this domain.

Contribution

It extends the multiplicative weight update algorithm to classical-quantum channels, providing the first deterministic coding proof for C-Q channel resolvability.

Findings

First deterministic coding proof for C-Q channel resolvability

Extension of matrix multiplicative weight update algorithm to quantum channels

Establishment of new theoretical framework for quantum channel resolvability

Abstract

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.