TOPICS
Search

Holevo Capacity


The Holevo capacity of a quantum channel is the supremum of its Holevo information over finite ensembles of input states. Using entropy in bits, it is

 chi(Phi)=sup_({p_i,rho_i})(S_2(sum_(i)p_iPhi(rho_i))-sum_(i)p_iS_2(Phi(rho_i))),

where p_i>=0 and sum_(i)p_i=1. The unassisted classical capacity of a memoryless channel is the regularized quantity C(Phi)=sup_(n>=1)chi(Phi^( tensor n))/n. Input states in an n-use ensemble may be entangled across uses, so equality C(Phi)=chi(Phi) requires an additivity argument. A noiseless d-dimensional channel has Holevo capacity log_2d.


See also

Quantum Channel, Quantum Entanglement, von Neumann Entropy

Explore with Wolfram|Alpha

References

Watrous, J. The Theory of Quantum Information. Cambridge, England: Cambridge University Press, 2018. https://doi.org/10.1017/9781316848142.

Cite this as:

Weisstein, Eric W. "Holevo Capacity." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/HolevoCapacity.html

Subject classifications