Holevo Capacity of Discrete Weyl Channels
Abstract
Holevo capacity is the maximum rate at which a quantum channel can reliably transmit classical information without entanglement. However, calculating the Holevo capacity of arbitrary quantum channels is a nontrivial and computationally expensive task since it requires the numerical optimization over all possible input quantum states. In this paper, we consider discrete Weyl channels (DWCs) and exploit their symmetry properties to model DWC as a classical symmetric channel. We characterize lower and upper bounds on the Holevo capacity of DWCs using simple computational formulae. Then, we provide a sufficient and necessary condition where the upper and lower bounds coincide. The framework in this paper enables us to characterize the exact Holevo capacity for most of the known special cases of DWCs.
Cite
@article{arxiv.2003.01942,
title = {Holevo Capacity of Discrete Weyl Channels},
author = {Junaid ur Rehman and Youngmin Jeong and Jeong San Kim and Hyundong Shin},
journal= {arXiv preprint arXiv:2003.01942},
year = {2020}
}
Comments
Close to the published version except for some fixed typos and a new proof of Theorem 2 (upper bound on the Holevo capacity). Comments are welcome