The HSW (Holevo-Schumacher-Westmoreland) theorem characterizes the capacity of noisy quantum channels for the transmission of classical information. Since the works of Holevo (1998) and Schumacher-Westmoreland (1997) several questions regarding the problem of classical-quantum channel coding, including finite blocklength bounds, second-order analysis and strong converse bounds have been answered. Nevertheless, the optimal error exponent for the classical-quantum channel coding has remained as an open problem for more than two decades. In this talk, a new decoder and a new lower bound on the error exponent of classical-quantum channel coding is presented. This bound on the error exponent is the first such bound that is tight for fully classical channels. This talk is based on a joint work with Marco Tomamichel.

https://us06web.zoom.us/j/83407340293?pwd=cXarB4geUkQrP9MMwe8Z71K94wYPpT.1
Meeting ID : 834 0734 0293
Passcode : 362880