Answers are grounded in this paper and cite their sources.
We propose a tight lower bound on the Holevo capacity of discrete Weyl channels (DWCs), which gives the exact Holevo capacity of known special cases of DWCs. Furthermore, for a physically available but otherwise unknown (channel parameters) DWC, this bound can be directly estimated by utilizing $d+1$ measurement configurations without entanglement and joint measurements. We show that the performance of directly estimating the proposed bound is comparable with first performing the entanglement-based optimal parameter estimation of the DWC and then computing the proposed lower bound.
No takes yet. Share an insight, caveat, or question.
Rehman et al. (2019) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: