Bounding and Estimating the Classical Information Rate of Quantum Channels with Memory
share
We consider the scenario of classical communication over a finite-dimensional quantum channel with memory using separable-state input ensemble and local output measurements. We propose algorithms for estimating and bounding the information rate of such communication setups. Some of the algorithms are extensions of their counterparts for (classical) finite-state-machine channels. Notably, we discuss suitable graphical models for doing the relevant computations. Moreover, the auxiliary channels are learned in a data-driven approach, ie, only input/output sequences of the true channel are needed, but not the channel model of the true channel.
READ FULL TEXT