A Separation between Divergence and Holevo Information for Ensembles | SpringerLink
Skip to main content

A Separation between Divergence and Holevo Information for Ensembles

  • Conference paper
Theory and Applications of Models of Computation (TAMC 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4978))

Abstract

The notion of divergence information of an ensemble of probability distributions was introduced by Jain, Radhakrishnan, and Sen [1,2] 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Jain, R., Radhakrishnan, J., Sen, P.: 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, 2002, pp. 429–438. IEEE Computer Society Press, Los Alamitos (2002) (A more complete version appears as In: [2])

    Chapter  Google Scholar 

  2. Jain, R., Radhakrishnan, J., Sen, P.: A theorem about relative entropy of quantum states with an application to privacy in quantum communication. Technical Report arXiv:0705.2437v1, ArXiv.org Preprint Archive (2007), http://www.arxiv.org/

  3. Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)

    MATH  Google Scholar 

  4. Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley Series in Telecommunications. John Wiley & Sons, New York, NY, USA (1991)

    MATH  Google Scholar 

  5. Jain, R., Radhakrishnan, J., Sen, P.: Prior entanglement, message compression and privacy in quantum communication. In: Proceedings of the 20th Annual IEEE Conference on Computational Complexity, 2005, pp. 285–296. IEEE Computer Society Press, Los Alamitos (2005)

    Google Scholar 

  6. Jain, R.: Stronger impossibility results for quantum string commitment. Technical Report arXiv:quant-ph/0506001v4, ArXiv.org Preprint Archive (2005), http://www.arxiv.org/

  7. Jain, R.: Communication complexity of remote state preparation with entanglement. Quantum Information and Computation 6, 461–464 (2006)

    MathSciNet  Google Scholar 

  8. Buhrman, H., Christandl, M., Hayden, P., Lo, H.-K., Wehner, S.: Security of quantum bit string commitment depends on the information measure. Physical Review Letters 97 (2006) (Article no. 250501)

    Google Scholar 

  9. Mayers, D.: Unconditionally secure quantum bit commitment is impossible. Physical Review Letters 78(17), 3414–3417 (1997)

    Article  Google Scholar 

  10. Lo, H.-K., Chau, H.F.: Is quantum bit commitment really possible? Physical Review Letters 78, 3410–3413 (1997)

    Article  Google Scholar 

  11. Kent, A.: Quantum bit string commitment (Article no. 237901). Physical Review Letters 90 (2003) (Article no. 237901)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Manindra Agrawal Dingzhu Du Zhenhua Duan Angsheng Li

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jain, R., Nayak, A., Su, Y. (2008). A Separation between Divergence and Holevo Information for Ensembles. In: Agrawal, M., Du, D., Duan, Z., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2008. Lecture Notes in Computer Science, vol 4978. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79228-4_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-79228-4_46

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-79227-7

  • Online ISBN: 978-3-540-79228-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics