Strong converse exponent of channel interconversion
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866916956566716416 |
|---|---|
| author | Oufkir, Aadil Yao, Yongsheng Berta, Mario |
| author_facet | Oufkir, Aadil Yao, Yongsheng Berta, Mario |
| contents | 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é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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_15200 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Strong converse exponent of channel interconversion Oufkir, Aadil Yao, Yongsheng Berta, Mario Quantum Physics Information Theory 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é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. |
| title | Strong converse exponent of channel interconversion |
| topic | Quantum Physics Information Theory |
| url | https://arxiv.org/abs/2509.15200 |