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:2609.34213

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

Tina Shariat, Matt Hoogsteder-Riera, Marco Tomamichel

quant-phcs.ITSubmitted Sep 28, 2026• Announced Sep 29, 2026• 1 citation• Revised Oct 11, 2026 (v2)
v1 · Sep 28, 2026v2 · Oct 11, 2026
arXivHTMLPDF

Abstract

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.

AI Summary

The paper studies whether non-signaling-assisted simulation of a classical channel can increase its Rényi capacity. For finite-alphabet channels, it establishes $R_\alpha(W')\le R_\alpha(W)$ for every $\alpha\in[0,\infty]$ whenever a non-signaling box simulates $W'$ from $W$. The paper explicitly identifies this theorem as a consequence of an existing data-processing inequality for channel divergences; its contribution is an alternative variational proof. The proof works with the information-radius representation $R_\alpha(W)=\min_Q\max_x D_\alpha(W(\cdot\mid x)\|Q)$. Young/Legendre representations make the channel dependence linear, allowing the non-signaling constraints and Jensen’s inequality to yield monotonicity separately for $0<\alpha<1$ and $\alpha>1$. Separate arguments handle Shannon capacity and the endpoints. At infinity, $R_\infty(W)=\log\sum_y\max_xW(y\mid x)$, and only the no-forward-signaling condition is required, provided the simulated map remains a channel. Consequences include nonincrease of the random-coding and sphere-packing exponent curves and nondecrease of the strong-converse exponent. Every non-signaling-assisted $(n,M)$ code satisfies $p_{\mathrm{succ}}\le\exp[-\frac{\alpha-1}{\alpha}(\log M-nR_\alpha(W))]$ for $\alpha>1$, recovering the known equality of assisted and unassisted strong-converse exponents. These statements do not imply that assistance cannot improve below-capacity coding reliability. Exact unassisted reliability is monotone above the base channel’s critical rate, can fail to be monotone between its unassisted and non-signaling zero-error capacities, and remains unresolved between $R_0(W)$ and the critical rate. Extending the variational proof to classical–quantum channels is left open.

Likely largely AI-generatedAI use disclosedIncremental
Claude assistance has been used to derive the proofs of Lemmas 2 to 5 and to assist in writing the manuscript.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
25 pages, 1 figure

Related papers

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

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

Large Deviation Analysis for the Reverse Shannon Theorem

Shi-Bing Li, Ke Li, Lei Yu

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.

arXiv:2410.07984•IEEE Transactions on Information Theory•May 25, 2026•4 citations

Exponents for Shared Randomness-Assisted Channel Simulation

Aadil Oufkir, Michael X. Cao, Hao–Chung Cheng +1 more

We determine the exact error and strong converse exponents of shared randomness-assisted channel simulation in worst case total-variation distance. Namely, we find that these exponents can be written as simple optimizations over the Rényi channel mutual information. Strikingly, and in stark contrast to channel coding, there are no critical rates, allowing a tight characterization for arbitrary rates below and above the simulation capacity.

arXiv:2410.07051•IEEE International Symposium on Information Theory (ISIT)•Jun 22, 2025•5 citations

Exponents for Shared Randomness-Assisted Channel Simulation

Aadil Oufkir, Michael X. Cao, Hao–Chung Cheng +1 more

We determine the exact error and strong converse exponents of shared randomness-assisted channel simulation in worst case total-variation distance. Namely, we find that these exponents can be written as simple optimizations over the R´enyi channel mutual information. Strikingly, and in stark contrast to channel coding, there are no critical rates, allowing a tight characterization for arbitrary rates below and above the simulation capacity. We derive our results by asymptotically expanding the meta-converse for channel simulation [Caoet al., IEEE Trans. Inf. Theory (2024)], which corresponds to nonsignaling assisted codes. We prove this to be asymptotically tight by employing the approximation algorithms from [Bertaet al., Proc. IEEE ISIT (2024)], which show how to round any non-signaling assisted strategy to a strategy that only uses shared randomness. Notably, this implies that any additional quantum entanglement-assistance does not change the error or the strong converse exponents.

IEEE Transactions on Information Theory•Feb 16, 2026•5 citations

Multiple-Access Channel Coding With Non-Signaling Correlations

Omar Fawzi, Paul Fermé

We address the problem of coding for classical multiple-access channels (MACs) with the assistance of non-signaling correlations between parties. It is well-known that non-signaling assistance does not change the capacity of classical point-to-point channels. However, it was recently observed that one can construct MACs from two-player nonlocal games while relating the winning probability of the game to the capacity of the MAC. By considering games for which entanglement (a special kind of non-signaling correlation) increases the winning probability (e.g., the Magic Square game), this shows that for some specific kinds of channels, entanglement between the senders can increase the capacity. In this work, we make several contributions towards understanding the capacity region for MACs with the assistance of non-signaling correlations between the parties. We develop a linear program computing the optimal success probability for coding over$n$copies of a MAC$W$with size growing polynomially in$n$. Solving this linear program allows us to achieve inner bounds for MACs. Applying this method to the binary adder channel, we show that using non-signaling assistance, the sum-rate$\frac {\log _{2}(72)}{4} \simeq 1.5425$can be reached even with zero error, which beats the maximum sum-rate capacity of 1.5 in the unassisted case. For noisy channels, where the zero-error non-signaling assisted capacity region is trivial, we can use concatenated codes to obtain achievable points in the capacity region. Applied to a noisy version of the binary adder channel, we show that non-signaling assistance still improves the sum-rate capacity. Complementing these achievability results, we give an outer bound on the non-signaling assisted capacity region that has the same expression as the unassisted region except that the channel inputs are not required to be independent. Finally, we show that the capacity region with non-signaling assistance shared only between each sender and the receiver independently is the same as without assistance.

arXiv:2206.10968•IEEE Transactions on Information Theory•Aug 8, 2023•16 citations
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.
The paper studies whether non-signaling-assisted simulation of a classical channel can increase its Rényi capacity. For finite-alphabet channels, it establishes Rα(W′)≤Rα(W)R_\alpha(W')\le R_\alpha(W)Rα​(W′)≤Rα​(W) for every α∈[0,∞]\alpha\in[0,\infty]α∈[0,∞] whenever a non-signaling box simulates W′W'W′ from WWW. The paper explicitly identifies this theorem as a consequence of an existing data-processing inequality for channel divergences; its contribution is an alternative variational proof.
The proof works with the information-radius representation Rα(W)=min⁡Qmax⁡xDα(W(⋅∣x)∥Q)R_\alpha(W)=\min_Q\max_x D_\alpha(W(\cdot\mid x)\|Q)Rα​(W)=minQ​maxx​Dα​(W(⋅∣x)∥Q). Young/Legendre representations make the channel dependence linear, allowing the non-signaling constraints and Jensen’s inequality to yield monotonicity separately for 0<α<10<\alpha<10<α<1 and α>1\alpha>1α>1. Separate arguments handle Shannon capacity and the endpoints. At infinity, R∞(W)=log⁡∑ymax⁡xW(y∣x)R_\infty(W)=\log\sum_y\max_xW(y\mid x)R∞​(W)=log∑y​maxx​W(y∣x), and only the no-forward-signaling condition is required, provided the simulated map remains a channel.
Consequences include nonincrease of the random-coding and sphere-packing exponent curves and nondecrease of the strong-converse exponent. Every non-signaling-assisted (n,M)(n,M)(n,M) code satisfies psucc≤exp⁡[−α−1α(log⁡M−nRα(W))]p_{\mathrm{succ}}\le\exp[-\frac{\alpha-1}{\alpha}(\log M-nR_\alpha(W))]psucc​≤exp[−αα−1​(logM−nRα​(W))] for α>1\alpha>1α>1, recovering the known equality of assisted and unassisted strong-converse exponents.
These statements do not imply that assistance cannot improve below-capacity coding reliability. Exact unassisted reliability is monotone above the base channel’s critical rate, can fail to be monotone between its unassisted and non-signaling zero-error capacities, and remains unresolved between R0(W)R_0(W)R0​(W) and the critical rate. Extending the variational proof to classical–quantum channels is left open.
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 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.
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.
We determine the exact error and strong converse exponents of shared randomness-assisted channel simulation in worst case total-variation distance. Namely, we find that these exponents can be written as simple optimizations over the R´enyi channel mutual information. Strikingly, and in stark contrast to channel coding, there are no critical rates, allowing a tight characterization for arbitrary rates below and above the simulation capacity. We derive our results by asymptotically expanding the meta-converse for channel simulation [Caoet al., IEEE Trans. Inf. Theory (2024)], which corresponds to nonsignaling assisted codes. We prove this to be asymptotically tight by employing the approximation algorithms from [Bertaet al., Proc. IEEE ISIT (2024)], which show how to round any non-signaling assisted strategy to a strategy that only uses shared randomness. Notably, this implies that any additional quantum entanglement-assistance does not change the error or the strong converse exponents.
We address the problem of coding for classical multiple-access channels (MACs) with the assistance of non-signaling correlations between parties. It is well-known that non-signaling assistance does not change the capacity of classical point-to-point channels. However, it was recently observed that one can construct MACs from two-player nonlocal games while relating the winning probability of the game to the capacity of the MAC. By considering games for which entanglement (a special kind of non-signaling correlation) increases the winning probability (e.g., the Magic Square game), this shows that for some specific kinds of channels, entanglement between the senders can increase the capacity. In this work, we make several contributions towards understanding the capacity region for MACs with the assistance of non-signaling correlations between the parties. We develop a linear program computing the optimal success probability for coding overnnncopies of a MACWWWwith size growing polynomially innnn. Solving this linear program allows us to achieve inner bounds for MACs. Applying this method to the binary adder channel, we show that using non-signaling assistance, the sum-ratelog⁡2(72)4≃1.5425\frac {\log _{2}(72)}{4} \simeq 1.54254log2​(72)​≃1.5425can be reached even with zero error, which beats the maximum sum-rate capacity of 1.5 in the unassisted case. For noisy channels, where the zero-error non-signaling assisted capacity region is trivial, we can use concatenated codes to obtain achievable points in the capacity region. Applied to a noisy version of the binary adder channel, we show that non-signaling assistance still improves the sum-rate capacity. Complementing these achievability results, we give an outer bound on the non-signaling assisted capacity region that has the same expression as the unassisted region except that the channel inputs are not required to be independent. Finally, we show that the capacity region with non-signaling assistance shared only between each sender and the receiver independently is the same as without assistance.