Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2501.11881 · IEEE International Symposium on Information Theory (ISIT)

Channel Resolvability Using Multiplicative Weight Update Algorithm

Koki Takahashi, Shun Watanabe

Published Jun 22, 2025• 1 citation
arXivHTMLPDF

Abstract

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 literature. We prove channel resolvability using the multiplicative weight update algorithm. This is the first approach to channel resolvability using non-random coding.

DOI
10.1109/isit63088.2025.11195617

Related papers

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 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.

cs.ITCross-listedarXiv:2601.12230•IEEE International Symposium on Information Theory (ISIT)•Jan 20, 2026•1 citation

Approximation Theory of Output Statistics

Te Sun Han, S. Verdu

Given a channel and an input process we study the minimum randomness of those input processes whose output statistics approximate the original output statistics with arbitrary accuracy. We introduce the notion of resolvability of a channel, defined as the number of random bits required per channel use in order to generate an input that achieves arbitrarily accurate approximation of the output statistics for any given input process. We obtain a general formula for resolvability which holds regardless of the channel memory structure. We show that, for most channels, resolvability is equal to Shannon capacity. By-products of our analysis are a general formula for the minimum achievable (fixed-length) source coding rate of any finite-alphabet source, and a strong converse of the identification coding theorem, which holds for any channel that satisfies the strong converse of the channel coding theorem.

IEEE International Symposium on Information Theory (ISIT)•Aug 24, 2005•2 citations

Minimax Converse for Identification via Channels

Shun Watanabe

A minimax converse for the identification via channels is derived. By this converse, a general formula for the identification capacity, which coincides with the transmission capacity, is proved without the assumption of the strong converse property. Furthermore, the optimal second-order coding rate of the identification via channels is characterized when the type I error probability is non-vanishing and the type II error probability is vanishing. Our converse is built upon the so-called partial channel resolvability approach; however, the minimax argument enables us to circumvent a flaw reported in the literature.

arXiv:2011.14741•IEEE Transactions on Information Theory•Oct 15, 2021•19 citations

Resolvability of Classical-Quantum Channels

Masahito Hayashi, Hao–Chung Cheng, Li Gao

Channel resolvability concerns the minimum resolution for approximating the channel output. We study the resolvability of classical-quantum channels in two settings, for the channel output generated from the worst input, and from the fixed independent and identically distributed (i.i.d.) input. The direct part of the worst-input setting is derived from sequential hypothesis testing as it involves non-i.i.d. inputs. The strong converse of the worst-input setting is obtained via the connection to identification codes. For the fixed-input setting, while the direct part follows from the known quantum soft covering result, we exploit the recent alternative quantum Sanov theorem to prove the strong converse.

arXiv:2410.16704•IEEE Transactions on Information Theory•May 15, 2025•10 citations

A Study on the Problem of Channel Resolvability for Channels with Countable Input Alphabet

Shigeaki Kuzuoka

The problem of channel resolvability for channels with countably infinite input alphabet is considered. In particular, Hayashi's lower bound (i.e., converse part) on the optimal rate of channel resolvability, which was proved under the assumption of the finiteness of the input alphabet of the channel, is revisited. Our motivation is to prove the bound without the finiteness of the input alphabet. Although we cannot accomplish the final goal, we introduce a slight modification into the problem of channel resolvability and establish a coding theorem (particularly converse coding theorem) corresponding to Hayashi's result without the assumption of the finiteness of the input alphabet.

International Symposium on Information Theory and its Applications•Oct 1, 2018•1 citation

The resolvability and the capacity of AWGN channels are equal

Te Sun Han, Sergio Verdú

The authors have introduced the new notion of resolvability of a channel, as the dual of the capacity, which is defined as the minimum complexity per input letter needed to generate an input process whose output distribution via the channel arbitrarily accurately approximates any prescribed achievable output distribution. The resolvability thus introduced has revealed a deep relationship between the minimum achievable rate for source coding, the channel capacity, the identification capacity and the problem of random number generation. However, the validity of the proof of the converse for the resolvability formula established by Han and Verdu (see IEEE Trans. on Inform. Theory, vol.39, no.3, p.379, 1993) hinged heavily on the assumption that the input alphabet of the channel is finite. Our main purpose in this paper is to show that we can relax this restriction and to show that the resolvability formula of Han and Verdu continues to hold also for a wide class of channels with continuous input alphabet, including as a special case, additive white Gaussian noise (AWGN) channels with power constraint.>

IEEE International Symposium on Information Theory (ISIT)•Dec 17, 2002•7 citations
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 literature. We prove channel resolvability using the multiplicative weight update algorithm. This is the first approach to channel resolvability using non-random coding.
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.
Given a channel and an input process we study the minimum randomness of those input processes whose output statistics approximate the original output statistics with arbitrary accuracy. We introduce the notion of resolvability of a channel, defined as the number of random bits required per channel use in order to generate an input that achieves arbitrarily accurate approximation of the output statistics for any given input process. We obtain a general formula for resolvability which holds regardless of the channel memory structure. We show that, for most channels, resolvability is equal to Shannon capacity. By-products of our analysis are a general formula for the minimum achievable (fixed-length) source coding rate of any finite-alphabet source, and a strong converse of the identification coding theorem, which holds for any channel that satisfies the strong converse of the channel coding theorem.
A minimax converse for the identification via channels is derived. By this converse, a general formula for the identification capacity, which coincides with the transmission capacity, is proved without the assumption of the strong converse property. Furthermore, the optimal second-order coding rate of the identification via channels is characterized when the type I error probability is non-vanishing and the type II error probability is vanishing. Our converse is built upon the so-called partial channel resolvability approach; however, the minimax argument enables us to circumvent a flaw reported in the literature.
Channel resolvability concerns the minimum resolution for approximating the channel output. We study the resolvability of classical-quantum channels in two settings, for the channel output generated from the worst input, and from the fixed independent and identically distributed (i.i.d.) input. The direct part of the worst-input setting is derived from sequential hypothesis testing as it involves non-i.i.d. inputs. The strong converse of the worst-input setting is obtained via the connection to identification codes. For the fixed-input setting, while the direct part follows from the known quantum soft covering result, we exploit the recent alternative quantum Sanov theorem to prove the strong converse.
The problem of channel resolvability for channels with countably infinite input alphabet is considered. In particular, Hayashi's lower bound (i.e., converse part) on the optimal rate of channel resolvability, which was proved under the assumption of the finiteness of the input alphabet of the channel, is revisited. Our motivation is to prove the bound without the finiteness of the input alphabet. Although we cannot accomplish the final goal, we introduce a slight modification into the problem of channel resolvability and establish a coding theorem (particularly converse coding theorem) corresponding to Hayashi's result without the assumption of the finiteness of the input alphabet.
The authors have introduced the new notion of resolvability of a channel, as the dual of the capacity, which is defined as the minimum complexity per input letter needed to generate an input process whose output distribution via the channel arbitrarily accurately approximates any prescribed achievable output distribution. The resolvability thus introduced has revealed a deep relationship between the minimum achievable rate for source coding, the channel capacity, the identification capacity and the problem of random number generation. However, the validity of the proof of the converse for the resolvability formula established by Han and Verdu (see IEEE Trans. on Inform. Theory, vol.39, no.3, p.379, 1993) hinged heavily on the assumption that the input alphabet of the channel is finite. Our main purpose in this paper is to show that we can relax this restriction and to show that the resolvability formula of Han and Verdu continues to hold also for a wide class of channels with continuous input alphabet, including as a special case, additive white Gaussian noise (AWGN) channels with power constraint.>