Bounding and Estimating the Classical Information Rate of Quantum Channels with Memory

Abstract

We consider the scenario of classical communication over a finite-dimensional quantum channel with memory using a separable-state input ensemble and local output measurements. We propose algorithms for estimating the information rate of such communication setups, along with algorithms for bounding the information rate based on so-called auxiliary channels. 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; i.e., only input/output sequences of the true channel are needed, but not the channel model of the true channel.

This work has been submitted to the IEEE Transactions on Information Theory for possible publication

References in corpus (5)

• Entangled states maximize the two qubit channel capacity for some Pauli channels with memory
• Entanglement and optimal strings of qubits for memory channels
• On the transitional behavior of quantum Gaussian memory channels
• Double-Edge Factor Graphs: Definition, Properties, and Examples
• Estimating the Information Rate of a Channel with Classical Input and Output and a Quantum State (Extended Version)