Skip to main content

Bound Information: The Classical Analog to Bound Quantum Entanglemen

  • Conference paper
European Congress of Mathematics

Part of the book series: Progress in Mathematics ((PM,volume 202))

  • 1162 Accesses

Abstract

It was recently pointed out that there is a close connection between information-theoretic key agreement and quantum entanglement purification. This suggests that the concept of bound entanglement (entanglement which cannot be purified) has a classical counterpart: bound information, which cannot be used to generate a secret key by any protocol. We analyse a probability distribution which results when a specific bound entangled quantum state is measured. We show strong evidence for the fact that the corresponding mutual information is indeed bound. The probable existence of such information stands in contrast to previous beliefs in classical information theory.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W. Diffie and M. E. Hellman, New directions in cryptographyIEEE Transactions on Information TheoryVol. 22, No. 6, pp. 644–654, 1976.

    Article  MathSciNet  MATH  Google Scholar 

  2. N. Gisin and S. Wolf, Linking classical and quantum key agreement: is there “bound information”?Advances in Cryptology - Proceedings of Crypto 2000Lecture Notes in Computer Science, Vol. 1880, pp. 482–500, 2000.

    Article  MathSciNet  Google Scholar 

  3. N. Gisin and S. Wolf, Quantum cryptography on noisy channels• quantum versus classical key agreement protocolsPhys. Rev. Lett.Vol. 83, pp. 4200–4203, 1999.

    Article  Google Scholar 

  4. M. Horodecki, P. Horodecki, and R. Horodecki, Inseparable 2 spin 1/2 density matrices can be distilled to a singlet formPhys. Rev. Lett., Vol.78, p. 574, 1997.

    Article  Google Scholar 

  5. P. Horodecki, Separability criterion and inseparable mixed states with positive partial transpositionPhys. Lett. A Vol. 232, p. 333, 1997.

    Article  MathSciNet  MATH  Google Scholar 

  6. P. Horodecki, M. Horodecki, and R. Horodecki, Bound entanglement can be activatedPhys. Rev. Lett. Vol. 82, pp. 1056–1059, 1999. quant-ph/9806058.

    Google Scholar 

  7. R. Landauer, Information is inevitably physicalFeynman and Computation 2, Addison Wesley, Reading, 1998.

    Google Scholar 

  8. R. Landauer, The physical nature of informationPhys. Lett. A, Vol. 217, p. 188, 1996.

    Article  MathSciNet  MATH  Google Scholar 

  9. U. Maurer, Secret key agreement by public discussion from common informationIEEE Transactions on Information Theory, Vol.39, No. 3, pp. 733–742, 1993.

    Article  MATH  Google Scholar 

  10. U. Maurer and S. Wolf, Unconditionally secure key agreement and the intrinsic conditional informationIEEE Transactions on Information Theory, Vol.45, No. 2, pp. 499–514, 1999.

    Article  MathSciNet  MATH  Google Scholar 

  11. A. Peres, Quantum theory: concepts and methods, Kluwer Academic Publishers, 1993.

    Google Scholar 

  12. A. Peres, Separability criterion for density matricesPhys. Rev. Lett. Vol. 77, pp. 1413–1415, 1996.

    Article  MathSciNet  MATH  Google Scholar 

  13. C. E. Shannon, Communication theory of secrecy systemsBell System Technical Journal Vol. 28, pp. 656–715, 1949.

    MathSciNet  MATH  Google Scholar 

  14. S. Wolf, Information-theoretically and computationally secure key agreement in cryptography, ETH dissertation No. 13138, ETH ZÜrich, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer Basel AG

About this paper

Cite this paper

Gisin, N., Renner, R., Wolf, S. (2001). Bound Information: The Classical Analog to Bound Quantum Entanglemen. In: Casacuberta, C., Miró-Roig, R.M., Verdera, J., Xambó-Descamps, S. (eds) European Congress of Mathematics. Progress in Mathematics, vol 202. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8266-8_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-8266-8_38

  • Publisher Name: Birkhäuser, Basel

  • Print ISBN: 978-3-0348-9496-8

  • Online ISBN: 978-3-0348-8266-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics