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:2410.07984 · IEEE Transactions on Information Theory

Large Deviation Analysis for the Reverse Shannon Theorem

Shi-Bing Li, Ke Li, Lei Yu

Published May 25, 2026• 4 citations
arXivHTMLPDF

Abstract

We consider the problem of simulating a noisy channel using noiseless channels with unlimited shared randomness. This can be interpreted as the reverse problem of Shannon’s noisy channel coding theorem. In contrast to previous works, we employ Rényi divergence (with the parameter α ∈ [0,∞]) to measure the level of approximation, and we obtain the reverse Shannon theorem under this measure, which characterizes the Rényi simulation rate, the minimum communication rate required for the Rényi divergence vanishing asymptotically. Our derivation is done by a precise large-deviation analysis. When the communication rate is above the Rényi simulation rate, we provide a complete characterization of the convergence exponent for the Rényi divergence, called the reliability function. When the communication rate is below the Rényi simulation rate, we determine the linear increasing rate for the Rényi divergence, which implies the strong converse exponent for the order-α fidelity.

DOI
10.1109/tit.2026.3696715

Related papers

Reliable Simulation of Quantum Channels: The Error Exponent

Ke Li, Yongsheng Yao

The Quantum Reverse Shannon Theorem has been a milestone in quantum information theory. It states that asymptotically reliable simulation of a quantum channel, assisted by unlimited shared entanglement, requires a rate of classical communication equal to the channel’s entanglement-assisted classical capacity. In this paper, we study the error exponent of quantum channel simulation, which characterizes the optimal speed of exponential convergence of the performance towards the perfect, as the blocklength increases. Based on channel purified distance, we derive lower and upper bounds for the error exponent. Then we show that the two bounds coincide when the classical communication rate is below a critical value, and hence, we have determined the exact formula of the error exponent in the low-rate case. This enables us to obtain an operational interpretation to the channel’s sandwiched Rényi information of order from 1 to 2, since our formula is expressed as a transform of this quantity. In the derivation, we have also obtained an achievability bound for quantum channel simulation in the finite-blocklength setting, which is of realistic significance.

arXiv:2112.04475•IEEE Transactions on Information Theory•Oct 28, 2024•21 citations

Rényi Resolvability and Its Applications to the Wiretap Channel

Lei Yu, Vincent Y. F. Tan

The conventional channel resolvability problem refers to the determination of the minimum rate required for an input process so that the output distribution approximates a target distribution in either the total variation distance or the relative entropy. In contrast to previous works, in this paper, we use the (normalized or unnormalized) Rényi divergence (with the Rényi parameter in[0, 2] U {∞}) to measure the level of approximation. We also provide asymptotic expressions for normalized Rényi divergence when the Rényi parameter is larger than or equal to 1 as well as (lower and upper) bounds for the case when the same parameter is smaller than 1. We characterize the Rényi resolvability, which is defined as the minimum rate required to ensure that the Rényi divergence vanishes asymptotically. The Rényi resolvabilities are the same for both the normalized and unnormalized divergence cases. In addition, when the Rényi parameter smaller than 1, consistent with the traditional case where the Rényi parameter is equal to 1, the Rényi resolvability equals the minimum mutual information over all input distributions that induce the target output distribution. When the Rényi parameter is larger than 1 the Rényi resolvability is, in general, larger than the mutual information. The optimal Rényi divergence is proven to vanish at least exponentially fast for both of these two cases, as long as the code rate is larger than the Rényi resolvability. The optimal exponential rate of decay for i.i.d. random codes is also characterized exactly. We apply these results to the wiretap channel, and completely characterize the optimal tradeoff between the rates of the secret and non-secret messages when the leakage measure is given by the (unnormalized) Rényi divergence. This tradeoff differs from the conventional setting when the leakage is measured by the traditional mutual information.

arXiv:1707.00810•IEEE Transactions on Information Theory•Dec 7, 2018•45 citations

Zero-Error Channel Capacity and Simulation Assisted by Non-Local Correlations

Toby S. Cubitt, Debbie Leung, William Matthews +1 more

The theory of zero-error communication is re-examined in the broader setting of using one classical channel to simulate another exactly in the presence of various classes of nonsignalling correlations between sender and receiver i.e., shared randomness, shared entanglement and arbitrary nonsignalling correlations. When the channel being simulated is noiseless, this is zero-error coding assisted by correlations. When the resource channel is noiseless, it is the reverse problem of simulating a noisy channel exactly by a noiseless one, assisted by correlations. In both cases, separations between the power of the different classes of assisting correlations are exhibited for finite block lengths. The most striking result here is that entanglement can assist in zero-error communication. In the large block length limit, shared randomness is shown to be just as powerful as arbitrary nonsignalling correlations for exact simulation, but not for asymptotic zero-error coding. For assistance by arbitrary nonsignalling correlations, linear programming formulas for the asymptotic capacity and simulation rates are derived, the former being equal (for channels with nonzero unassisted capacity) to the feedback-assisted zero-error capacity derived by Shannon. Finally, a kind of reversibility between nonsignalling-assisted zero-error capacity and exact simulation is observed, mirroring the usual reverse Shannon theorem.

arXiv:1003.3195•IEEE Transactions on Information Theory•Aug 1, 2011•97 citations

Strong Converse Exponent of Channel Interconversion

Aadil Oufkir, Yongsheng Yao, Mario Berta

Abstract In their seminal work, Bennett et al. [1] showed that, with sufficient shared randomness, one noisy channel can simulate another at a rate equal to the ratio of their capacities. We establish that when coding above this channel interconversion capacity, the exact strong converse exponent is characterized by a simple optimization involving the difference of the corresponding Rényi channel capacities with Hölder dual parameters. We further extend this result to the entanglement-assisted interconversion of classical–quantum channels, showing that the strong converse exponent is likewise determined by differences of sandwiched Rényi channel capacities. The converse bound is obtained by relaxing to non-signaling assisted codes and applying Hölder duality together with the data processing inequality for Rényi divergences. Achievability is proven by concatenating refined channel coding and simulation protocols that go beyond first-order capacities, attaining an exponentially small conversion error, remaining robust under small variations in the input distribution, and tolerating a sublinear gap between the conversion rates.

arXiv:2509.15200•Annales Henri Poincaré•Sep 17, 2026•2 citations

Strong converse for entanglement-assisted capacity

Manish K. Gupta, Mark M. Wilde

The fully quantum reverse Shannon theorem establishes the optimal rate of noiseless classical communication required for simulating the action of many instances of a noisy quantum channel on an arbitrary input state, while also allowing for an arbitrary amount of shared entanglement of an arbitrary form. Turning this theorem around establishes a strong converse for the entanglement-assisted classical capacity of any quantum channel. The present work proves the strong converse for entanglement-assisted capacity by a completely different approach. Namely, we exploit the recent entanglement-assisted “meta-converse” theorem of Matthews and Wehner, several properties of the recently established sandwiched Rényi relative entropy (also referred to as the quantum Rényi divergence), and the multiplicativity of completely bounded p-norms due to Devetak et al. The proof here demonstrates the extent to which the Arimoto approach can be helpful in proving strong converse theorems, it provides an operational relevance for the multiplicativity result of Devetak et al., and it adds to the growing body of evidence that the sandwiched Rényi relative entropy is the correct quantum generalization of the classical concept for all α > 1.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2014•0 citations

Monotonicity of the Rényi channel capacity under non-signaling assisted channel simulation

Tina Shariat, Matt Hoogsteder-Riera, Marco Tomamichel

We give an alternative variational proof that non-signaling correlations shared between the sender and receiver cannot increase the Rényi capacity of a classical channel. This monotonicity follows from the data-processing inequality for channel divergences established by Oufkir, Yao and Berta. Our approach works directly with the information-radius representation of the capacity. The constraints defining non-signaling boxes are linear in the box, while the Rényi capacity depends on the channel nonlinearly. We use a Legendre transform to express the capacity as an extremum over a family of affine functionals in which the channel appears linearly. Combining this method with separate arguments for the Shannon capacity and endpoint orders, we recover monotonicity at every order from zero to infinity. We then derive consequences for standard coding exponent functions: non-signaling simulation cannot increase the random-coding or sphere-packing exponent below capacity, or decrease the strong-converse exponent above capacity.

quant-pharXiv:2609.34213•Sep 29, 2026•1 citation
We consider the problem of simulating a noisy channel using noiseless channels with unlimited shared randomness. This can be interpreted as the reverse problem of Shannon’s noisy channel coding theorem. In contrast to previous works, we employ Rényi divergence (with the parameter α ∈ [0,∞]) to measure the level of approximation, and we obtain the reverse Shannon theorem under this measure, which characterizes the Rényi simulation rate, the minimum communication rate required for the Rényi divergence vanishing asymptotically. Our derivation is done by a precise large-deviation analysis. When the communication rate is above the Rényi simulation rate, we provide a complete characterization of the convergence exponent for the Rényi divergence, called the reliability function. When the communication rate is below the Rényi simulation rate, we determine the linear increasing rate for the Rényi divergence, which implies the strong converse exponent for the order-α fidelity.
The Quantum Reverse Shannon Theorem has been a milestone in quantum information theory. It states that asymptotically reliable simulation of a quantum channel, assisted by unlimited shared entanglement, requires a rate of classical communication equal to the channel’s entanglement-assisted classical capacity. In this paper, we study the error exponent of quantum channel simulation, which characterizes the optimal speed of exponential convergence of the performance towards the perfect, as the blocklength increases. Based on channel purified distance, we derive lower and upper bounds for the error exponent. Then we show that the two bounds coincide when the classical communication rate is below a critical value, and hence, we have determined the exact formula of the error exponent in the low-rate case. This enables us to obtain an operational interpretation to the channel’s sandwiched Rényi information of order from 1 to 2, since our formula is expressed as a transform of this quantity. In the derivation, we have also obtained an achievability bound for quantum channel simulation in the finite-blocklength setting, which is of realistic significance.
The conventional channel resolvability problem refers to the determination of the minimum rate required for an input process so that the output distribution approximates a target distribution in either the total variation distance or the relative entropy. In contrast to previous works, in this paper, we use the (normalized or unnormalized) Rényi divergence (with the Rényi parameter in[0, 2] U {∞}) to measure the level of approximation. We also provide asymptotic expressions for normalized Rényi divergence when the Rényi parameter is larger than or equal to 1 as well as (lower and upper) bounds for the case when the same parameter is smaller than 1. We characterize the Rényi resolvability, which is defined as the minimum rate required to ensure that the Rényi divergence vanishes asymptotically. The Rényi resolvabilities are the same for both the normalized and unnormalized divergence cases. In addition, when the Rényi parameter smaller than 1, consistent with the traditional case where the Rényi parameter is equal to 1, the Rényi resolvability equals the minimum mutual information over all input distributions that induce the target output distribution. When the Rényi parameter is larger than 1 the Rényi resolvability is, in general, larger than the mutual information. The optimal Rényi divergence is proven to vanish at least exponentially fast for both of these two cases, as long as the code rate is larger than the Rényi resolvability. The optimal exponential rate of decay for i.i.d. random codes is also characterized exactly. We apply these results to the wiretap channel, and completely characterize the optimal tradeoff between the rates of the secret and non-secret messages when the leakage measure is given by the (unnormalized) Rényi divergence. This tradeoff differs from the conventional setting when the leakage is measured by the traditional mutual information.
The theory of zero-error communication is re-examined in the broader setting of using one classical channel to simulate another exactly in the presence of various classes of nonsignalling correlations between sender and receiver i.e., shared randomness, shared entanglement and arbitrary nonsignalling correlations. When the channel being simulated is noiseless, this is zero-error coding assisted by correlations. When the resource channel is noiseless, it is the reverse problem of simulating a noisy channel exactly by a noiseless one, assisted by correlations. In both cases, separations between the power of the different classes of assisting correlations are exhibited for finite block lengths. The most striking result here is that entanglement can assist in zero-error communication. In the large block length limit, shared randomness is shown to be just as powerful as arbitrary nonsignalling correlations for exact simulation, but not for asymptotic zero-error coding. For assistance by arbitrary nonsignalling correlations, linear programming formulas for the asymptotic capacity and simulation rates are derived, the former being equal (for channels with nonzero unassisted capacity) to the feedback-assisted zero-error capacity derived by Shannon. Finally, a kind of reversibility between nonsignalling-assisted zero-error capacity and exact simulation is observed, mirroring the usual reverse Shannon theorem.
Abstract In their seminal work, Bennett et al. [1] showed that, with sufficient shared randomness, one noisy channel can simulate another at a rate equal to the ratio of their capacities. We establish that when coding above this channel interconversion capacity, the exact strong converse exponent is characterized by a simple optimization involving the difference of the corresponding Rényi channel capacities with Hölder dual parameters. We further extend this result to the entanglement-assisted interconversion of classical–quantum channels, showing that the strong converse exponent is likewise determined by differences of sandwiched Rényi channel capacities. The converse bound is obtained by relaxing to non-signaling assisted codes and applying Hölder duality together with the data processing inequality for Rényi divergences. Achievability is proven by concatenating refined channel coding and simulation protocols that go beyond first-order capacities, attaining an exponentially small conversion error, remaining robust under small variations in the input distribution, and tolerating a sublinear gap between the conversion rates.
The fully quantum reverse Shannon theorem establishes the optimal rate of noiseless classical communication required for simulating the action of many instances of a noisy quantum channel on an arbitrary input state, while also allowing for an arbitrary amount of shared entanglement of an arbitrary form. Turning this theorem around establishes a strong converse for the entanglement-assisted classical capacity of any quantum channel. The present work proves the strong converse for entanglement-assisted capacity by a completely different approach. Namely, we exploit the recent entanglement-assisted “meta-converse” theorem of Matthews and Wehner, several properties of the recently established sandwiched Rényi relative entropy (also referred to as the quantum Rényi divergence), and the multiplicativity of completely bounded p-norms due to Devetak et al. The proof here demonstrates the extent to which the Arimoto approach can be helpful in proving strong converse theorems, it provides an operational relevance for the multiplicativity result of Devetak et al., and it adds to the growing body of evidence that the sandwiched Rényi relative entropy is the correct quantum generalization of the classical concept for all α > 1.
We give an alternative variational proof that non-signaling correlations shared between the sender and receiver cannot increase the Rényi capacity of a classical channel. This monotonicity follows from the data-processing inequality for channel divergences established by Oufkir, Yao and Berta. Our approach works directly with the information-radius representation of the capacity. The constraints defining non-signaling boxes are linear in the box, while the Rényi capacity depends on the channel nonlinearly. We use a Legendre transform to express the capacity as an extremum over a family of affine functionals in which the channel appears linearly. Combining this method with separate arguments for the Shannon capacity and endpoint orders, we recover monotonicity at every order from zero to infinity. We then derive consequences for standard coding exponent functions: non-signaling simulation cannot increase the random-coding or sphere-packing exponent below capacity, or decrease the strong-converse exponent above capacity.