Strong converse exponent of channel interconversion

• URL: http://arxiv.org/abs/2509.15200v1
• Date: Thu, 18 Sep 2025 17:54:01 GMT
• Title: Strong converse exponent of channel interconversion
• Authors: Aadil Oufkir, Yongsheng Yao, Mario Berta,
• Abstract summary: We show that the exact strong converse exponent is characterized by a simple optimization involving the difference of the corresponding R'enyi channel capacities.<n>We further extend this result to the entanglement-assisted interconversion of classical-quantum channels.
• Score: 13.96035077119747
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In their seminal work, Bennett et al. [IEEE Trans. Inf. Theory (2002)] 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\'enyi channel capacities with H\"older 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\'enyi channel capacities. The converse bound is obtained by relaxing to non-signaling assisted codes and applying H\"older duality together with the data processing inequality for R\'enyi 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.

Related papers

• Generalization Bounds for Transformer Channel Decoders [61.55280736553095]
  This paper studies the generalization performance of ECCT from a learning-theoretic perspective.<n>To the best of our knowledge, this work provides the first theoretical generalization guarantees for this class of decoders.
  arXiv  Detail & Related papers  (2026-01-11T15:56:37Z)
• Adaptive Source-Channel Coding for Semantic Communications [48.13990936094994]
  Semantic communications (SemComs) have emerged as a promising paradigm for joint data and task-oriented transmissions.<n>Current joint source-channel coding (JSCC) in SemComs is not compatible with the existing communication systems.<n>We propose an adaptive source-channel coding scheme for SemComs over parallel Gaussian channels.
  arXiv  Detail & Related papers  (2025-08-11T13:09:54Z)
• Resolvability of classical-quantum channels [54.825573549226924]
  We study the resolvability of classical-quantum channels in two settings, for the channel output generated from the worst input, and form the fixed independent and identically distributed (i.i.d.) input. 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 solve the strong converse.
  arXiv  Detail & Related papers  (2024-10-22T05:18:43Z)
• Variance-Reducing Couplings for Random Features [57.73648780299374]
  Random features (RFs) are a popular technique to scale up kernel methods in machine learning. We find couplings to improve RFs defined on both Euclidean and discrete input spaces. We reach surprising conclusions about the benefits and limitations of variance reduction as a paradigm.
  arXiv  Detail & Related papers  (2024-05-26T12:25:09Z)
• Channel Simulation: Finite Blocklengths and Broadcast Channels [13.561997774592667]
  We study channel simulation under common randomness assistance in the finite-blocklength regime. We identify the smooth channel max-information as a linear program one-shot converse on the minimal simulation cost for fixed error tolerance.
  arXiv  Detail & Related papers  (2022-12-22T13:08:55Z)
• Deep Reinforcement Learning for IRS Phase Shift Design in Spatiotemporally Correlated Environments [93.30657979626858]
  We propose a deep actor-critic algorithm that accounts for channel correlations and destination motion. We show that, when channels aretemporally correlated, the inclusion of the SNR in the state representation with function approximation in ways that inhibit convergence.
  arXiv  Detail & Related papers  (2022-11-02T22:07:36Z)
• Recurrence Boosts Diversity! Revisiting Recurrent Latent Variable in Transformer-Based Variational AutoEncoder for Diverse Text Generation [85.5379146125199]
  Variational Auto-Encoder (VAE) has been widely adopted in text generation. We propose TRACE, a Transformer-based recurrent VAE structure.
  arXiv  Detail & Related papers  (2022-10-22T10:25:35Z)
• Data-Driven Upper Bounds on Channel Capacity [4.974890682815778]
  We consider the problem of estimating an upper bound on the capacity of a memoryless channel with unknown alphabet output. A novel-driven algorithm is proposed that exploits dual representation where the minimization over the input distribution is replaced with a reference distribution on the channel output.
  arXiv  Detail & Related papers  (2022-05-13T06:59:31Z)
• Cross talk compensation in multimode continuous-variable entanglement distribution [0.0]
  We consider the effect of a linear cross talk in the multimode distribution of two-mode squeezed states propagating through parallel similar channels. Our results pave the way to more efficient use of multimode continuous-variable photonic entanglement in scalable quantum networks with cross talk.
  arXiv  Detail & Related papers  (2021-11-01T13:43:04Z)
• Learning to Perform Downlink Channel Estimation in Massive MIMO Systems [72.76968022465469]
  We study downlink (DL) channel estimation in a Massive multiple-input multiple-output (MIMO) system. A common approach is to use the mean value as the estimate, motivated by channel hardening. We propose two novel estimation methods.
  arXiv  Detail & Related papers  (2021-09-06T13:42:32Z)
• Discriminative Mutual Information Estimators for Channel Capacity Learning [1.8275108630751837]
  We propose a novel framework to automatically learn the channel capacity, for any type of memory-less channel. We include the discriminator in a cooperative channel capacity learning framework, referred to as CORTICAL. We prove that a particular choice of cooperative value function solves the channel capacity estimation problem.
  arXiv  Detail & Related papers  (2021-07-07T09:03:40Z)
• Coherence dynamics induced by attenuation and amplification Gaussian channels [0.0]
  We study the coherence dynamics introduced by these channels on input states. We write a simple expression for computing the entropy production due to the coherence for both channels. This can be useful to simulate many processes in quantum thermodynamics, as finite-time driving on bosonic modes.
  arXiv  Detail & Related papers  (2020-10-29T01:21:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.