Divergence radii and the strong converse exponent of classical-quantum channel coding with constant compositions

November 26, 2018 Β· Declared Dead Β· πŸ› IEEE Transactions on Information Theory

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors MilΓ‘n Mosonyi, Tomohiro Ogawa arXiv ID 1811.10599 Category quant-ph: Quantum Computing Cross-listed cs.IT, math-ph Citations 33 Venue IEEE Transactions on Information Theory Last Checked 6 months ago
Abstract
There are different inequivalent ways to define the RΓ©nyi capacity of a channel for a fixed input distribution $P$. In a 1995 paper CsiszΓ‘r has shown that for classical discrete memoryless channels there is a distinguished such quantity that has an operational interpretation as a generalized cutoff rate for constant composition channel coding. We show that the analogous notion of RΓ©nyi capacity, defined in terms of the sandwiched quantum RΓ©nyi divergences, has the same operational interpretation in the strong converse problem of classical-quantum channel coding. Denoting the constant composition strong converse exponent for a memoryless classical-quantum channel $W$ with composition $P$ and rate $R$ as $sc(W,R,P)$, our main result is that \[ sc(W,R,P)=\sup_{Ξ±>1}\frac{Ξ±-1}Ξ±\left[R-Ο‡_Ξ±^*(W,P)\right], \] where $Ο‡_Ξ±^*(W,P)$ is the $P$-weighted sandwiched RΓ©nyi divergence radius of the image of the channel.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Quantum Computing

Died the same way β€” πŸ‘» Ghosted