Advertisement

Bound Information: The Classical Analog to Bound Quantum Entanglemen

  • Nicolas Gisin
  • Renato Renner
  • Stefan Wolf
Part of the Progress in Mathematics book series (PM, volume 202)

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.

Keywords

Entangle State Mixed State Classical Counterpart Entangle Quantum State Intrinsic Information 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    W. Diffie and M. E. Hellman, New directions in cryptographyIEEE Transactions on Information TheoryVol. 22, No. 6, pp. 644–654, 1976.MathSciNetzbMATHCrossRefGoogle Scholar
  2. 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.MathSciNetCrossRefGoogle Scholar
  3. 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.CrossRefGoogle Scholar
  4. 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.CrossRefGoogle Scholar
  5. 5.
    P. Horodecki, Separability criterion and inseparable mixed states with positive partial transpositionPhys. Lett. A Vol. 232, p. 333, 1997.MathSciNetzbMATHCrossRefGoogle Scholar
  6. 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. 7.
    R. Landauer, Information is inevitably physicalFeynman and Computation 2, Addison Wesley, Reading, 1998.Google Scholar
  8. 8.
    R. Landauer, The physical nature of informationPhys. Lett. A, Vol. 217, p. 188, 1996.MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    U. Maurer, Secret key agreement by public discussion from common informationIEEE Transactions on Information Theory, Vol.39, No. 3, pp. 733–742, 1993.zbMATHCrossRefGoogle Scholar
  10. 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.MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    A. Peres, Quantum theory: concepts and methods, Kluwer Academic Publishers, 1993.Google Scholar
  12. 12.
    A. Peres, Separability criterion for density matricesPhys. Rev. Lett. Vol. 77, pp. 1413–1415, 1996.MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    C. E. Shannon, Communication theory of secrecy systemsBell System Technical Journal Vol. 28, pp. 656–715, 1949.MathSciNetzbMATHGoogle Scholar
  14. 14.
    S. Wolf, Information-theoretically and computationally secure key agreement in cryptography, ETH dissertation No. 13138, ETH ZÜrich, 1999.Google Scholar

Copyright information

© Springer Basel AG 2001

Authors and Affiliations

  • Nicolas Gisin
    • 1
  • Renato Renner
    • 2
  • Stefan Wolf
    • 3
  1. 1.Group of Applied PhysicsUniversity of GenevaGenevaSwitzerland
  2. 2.Department of Computer ScienceETH ZürichZürichSwitzerland
  3. 3.Centre for Applied Cryptographic Research, Department of Combinatorics and OptimizationUniversity of WaterlooWaterlooCanada

Personalised recommendations