publication . Part of book or chapter of book . Preprint . Article . 2007

a separation between divergence and holevo information for ensembles

Open Access
  • Published: 22 Dec 2007
  • Publisher: Springer Berlin Heidelberg
The notion of divergence information of an ensemble of probability distributions was introduced by Jain, Radhakrishnan, and Sen in the context of the ``substate theorem''. Since then, divergence has been recognized as a more natural measure of information in several situations in quantum and classical communication. We construct ensembles of probability distributions for which divergence information may be significantly smaller than the more standard Holevo information. As a result, we establish that lower bounds previously shown for Holevo information are weaker than similar ones shown for divergence information.
free text keywords: Kullback–Leibler divergence, Divergence (statistics), Mathematics, Jensen–Shannon divergence, Divergence, Holevo's theorem, Quantum state, Discrete mathematics, Classical capacity, Combinatorics, Probability distribution, Mathematics (miscellaneous), Computer Science Applications, Natural measure, Quantum, Quantum Physics
Funded by
  • Funder: Natural Sciences and Engineering Research Council of Canada (NSERC)

[1] Harry Buhrman, Matthias Christandl, Patrick Hayden, Hoi-Kwong Lo, and Stephanie Wehner. Security of quantum bit string commitment depends on the information measure. Physical Review Letters, 97, 2006. Article no. 250501. [OpenAIRE]

[2] Thomas M. Cover and Joy A. Thomas. Elements of Information Theory. Wiley Series in Telecommunications. John Wiley & Sons, New York, NY, USA, 1991.

[3] Rahul Jain. Stronger impossibility results for quantum string commitment. Technical Report arXiv:quant-ph/0506001v4, Preprint Archive,, 2005.

[4] Rahul Jain. Communication complexity of remote state preparation with entanglement. Quantum Information and Computation, 6(4-5):461-464, July 2006.

[5] Rahul Jain, Jaikumar Radhakrishnan, and Pranab Sen. Privacy and interaction in quantum communication complexity and a theorem about the relative entropy of quantum states. In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pages 429-438. IEEE Computer Society Press, Los Alamitos, CA, USA, 2002. A more complete version appears as [7].

[6] Rahul Jain, Jaikumar Radhakrishnan, and Pranab Sen. Prior entanglement, message compression and privacy in quantum communication. In Proceedings 20th Annual IEEE Conference on Computational Complexity, 2005.

[7] Rahul Jain, Jaikumar Radhakrishnan, and Pranab Sen. A theorem about relative entropy of quantum states with an application to privacy in quantum communication. Technical Report arXiv:0705.2437v1, Preprint Archive,, May 2007.

[8] Adrian Kent. Quantum bit string commitment. Physical Review Letters, 90, 2003. Article no. 237901.

[9] Hoi-Kwong Lo and H. F. Chau. Is quantum bit commitment really possible? Physical Review Letters, 78:3410-3413, 1997. [OpenAIRE]

[10] Dominic Mayers. Unconditionally secure quantum bit commitment is impossible. Physical Review Letters, 78(17):3414-3417, 1997. [OpenAIRE]

Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue