The Classical Capacity of Additive Quantum Queue-Channels

We consider a setting where a stream of qubits is processed sequentially. We derive fundamental limits on the rate at which classical information can be transmitted using qubits that decohere as they wait to be processed. Specifically, we model the sequential processing of qubits using a single server queue, and derive expressions for the classical capacity of such a quantum queue-channel.' Focusing on two important noise models, namely the erasure channel and the depolarizing channel, we obtain explicit single-letter capacity formulas in terms of the stationary waiting time of qubits in the queue. Our capacity proof also implies that aclassical' coding/decoding strategy is optimal, i.e., an encoder which uses only orthogonal product states, and a decoder which measures in a fixed product basis, are sufficient to achieve the classical capacity of both queue-channels. Our proof technique for the converse theorem generalizes readily -- in particular, whenever the underlying quantum noise channel is additive, we can obtain a single-letter upper bound on the classical capacity of the corresponding quantum queue-channel. More broadly, our work begins to quantitatively address the impact of decoherence on the performance limits of quantum information processing systems.