3 papers
cs.IT2026
Classical-Quantum Channel Resolvability Using Matrix Multiplicative Weight Update Algorithm
Koki Takahashi, Shun Watanabe
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…
cs.IT2025
Channel Resolvability Using Multiplicative Weight Update Algorithm
Koki Takahashi, Shun Watanabe
We study the channel resolvability problem, which is used to prove strong converse of identification via channel. Channel resolvability has been solved by only random coding in the…
cs.IT2025
An Improved Lower Bound on Oblivious Transfer Capacity Using Polarization and Interaction
So Suda, Shun Watanabe
We consider the oblivious transfer (OT) capacities of noisy channels against the passive adversary; this problem has not been solved even for the binary symmetric channel (BSC). In…