研究目的
To characterize lower and upper bounds on the Holevo capacity of discrete Weyl channels (DWCs) using simple computational formulae and to provide a sufficient and necessary condition where the upper and lower bounds coincide.
研究成果
The paper presents a simple to compute lower bound on the Holevo capacity of a given DWC of an arbitrary dimension and an intuitive upper bound which coincides with the lower bound under a certain condition. The framework enables the characterization of the exact Holevo capacity for most of the known special cases of DWCs.
研究不足
The restriction on the dimension d to be a prime number is primarily because the repetition of eigenvalues of Wnm of a composite d does not allow the construction of the channel transition matrix Tnm. The condition for the coincidence of the two bounds is sufficient but not necessary for the lower bound to give exact capacity.
