A Tight Lower Bound on the Classical Communication Cost of Entanglement Dilution

IEEE Transactions on Information Theory

Volumn 50, Issue 2, 2004, Pages 319-327

  Harrow, Aram W ^a   Lo, Hoi Kwong ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Communication; Entanglement dilution; Entanglement transformations; Quantum information

Indexed keywords

APPROXIMATION THEORY; DATA COMPRESSION; INFORMATION THEORY; MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA; PROBABILITY; QUANTUM THEORY;

ENTANGLEMENT DILUTION; ENTANGLEMENT TRANSFORMATIONS; QUANTUM INFORMATION;

COMMUNICATION;

EID: 1442288610     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2003.822597     Document Type: Article

References (22)

1. C. H. Bennett, H.-J. Bernstein, S. Popescu, and B. Schumacher, "Concentrating partial entanglement by local operations," Phys. Rev. A, vol. 53, pp. 2046-2052, 1996.
2. C. H. Bennett, A. W. Harrow, D. W. Leung, and J. A. Smolin, "On the capacities of bipartite Hamiltonians and unitary gates," arXive eprint, quant-ph/0205057, 2002.
3. E. Boltausen, "An estimate of the remainder in a combinatorial central limit theorem," Z. Wahtscheinlichkeitstheorie, vol. 66, pp. 387-405, 1984.
4. C. H. Bennett and S. J. Wiesner, "Communication via 1- and 2-particle operators on Einstein-Podolsky-Rosen state," Phys. Rev. Lett., vol. 69, no. 20, pp. 2881-2884, 1992.
5. H. F. Chau and H.-K. Lo, "Making an empty promise with a quantum computer," Fort. der Phys., pp. 507-520, 1998.
6. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: John Wiley and Sons, 1991.
7. W. Dür, G. Vidal, J. I. Cirac, N. Linden, and S. Popescu. (2001) Entanglement capabilities of non-local Hamiltonians. Phys. Rev. Lett. [Online] vol. 87, no. 137901, arXive eprint quant-ph/0006034.
8. C. A. Fuchs and J. van de Graaf, "Cryptographic distinguishability measures for quantum mechanical states," IEEE Trans. Inform. Theory, vol. 45, pp. 1216-1227, May 1999.
9. C. A. Fuchs, "Distinguishability and accessible information in quantum theory," Ph.D. dissertation, Univ. New Mexico, Albuquerque, 1995.
10. P. Hayden and A. Winter, "On the Communication cost of entanglement transformations," arXive eprint, quant-ph/0204092, 2002.
11. J. G. Jensen and R. Schack. (2001) A simple algorithm for local conversion of pure states. Phys. Rev. A [Online] vol. 63, no. 062303, arXive eprint quant-ph/0006049.
12. P. Kaye and M. Mosca, "Quantum networks for concentrating entanglement," arXive eprint, quant-ph/0101009.
13. H.-K. Lo, "Insecurity of quantum secure computations," Phys. Rev. A, p. 1154, 1997.
14. _, Classical communication cost in distributed quantum information processing - A generalization of quantum communication complexity [Online] vol. 62, no. 012313, arXive eprint quant-ph/99120049.
15. H.-K. Lo and H. F. Chau, "Is quantum bit commitment really possible?," Phys. Rev. Lett., pp. 3410-3413, 1997.
16. H.-K. Lo and S. Popescu, "The classical communication cost of entanglement manipulation: Is entanglement an inter-convertible resource?, " Phys. Rev. Lett., vol. 83, pp. 1459-1462, 1999.
17. _, Concentrating entanglement by local actions - Beyond mean values [Online] vol. 63, no. 022301, arXive eprint quant-ph/9707038.
18. D. Mayers, "Unconditionally secure bit commitment is impossible," Phys. Rev. Lett., vol. 78, pp. 3414-3417, 1997.
19. M. A. Nielsen, "Conditions for a class of entangement transforms," Phys. Rev. Lett., vol. 83, no. 2, pp. 436-439, 1999.
20. A. Peres, Quantum Theory: Concepts and Methods. Dordrecht, The Netherlands: Kluwer Academic, 1993.
21. G. Vidal, "Entanglement monotones," J. Mod. Opt., vol. 47, p. 355, 2000.
22. A. Uhlmann, "The 'transition probability' in the state space of a *-algebra," Repts. Math. Phys., vol. 9, pp. 273-279, 1976.