Unital Qubit Queue-channels: Classical Capacity and Product Decoding
Abstract
Quantum queue-channels arise naturally in the context of buffering in quantum networks, wherein the noise suffered by the quantum states depends on the time spent waiting in the buffer. It has been shown that the upper-bound on the classical capacity of an additive queue-channel has a simple expression, and is achievable for the erasure and depolarizing channels [IEEE JSAIT, 1(2):432-444]. In this paper, we characterise the classical capacity for the class of unital qubit queue-channels, and show that a simple product (non-entangled) decoding strategy is capacity-achieving. As an intermediate result, we derive an explicit capacity achieving product decoding strategy for any i.i.d. unital qubit channel, which could be of independent interest. As an important special case, we also derive the capacity and optimal decoding strategies for a symmetric generalized amplitude damping (GAD) queue-channel. Our results provide useful insights towards designing practical quantum communication networks, and highlight the need to explicitly model the impact of buffering.
Cite
@article{arxiv.2110.02800,
title = {Unital Qubit Queue-channels: Classical Capacity and Product Decoding},
author = {Vikesh Siddhu and Avhishek Chatterjee and Krishna Jagannathan and Prabha Mandayam and Sridhar Tayur},
journal= {arXiv preprint arXiv:2110.02800},
year = {2022}
}
Comments
25 pages with 3 Figures. Merges and supersedes our prior submissions arXiv:2107.13486 and arXiv:2110.02800