Optimal superdense coding of Entangled States

IEEE Transactions on Information Theory

Volumn 52, Issue 8, 2006, Pages 3635-3641

  Abeyesinghe, Anura ^a   Hayden, Patrick ^b   Smith, Graeme ^a   Winter, Andreas J ^c  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b MCGILL UNIVERSITY   (Canada)

^c UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Concentration of measure; Entanglement; Identification; Remote state preparation; Superdense coding

Indexed keywords

CODES (SYMBOLS); ENCODING (SYMBOLS); INTERPOLATION; QUANTUM CRYPTOGRAPHY; RANDOM PROCESSES;

ENTANGLEMENT; QUANTUM COMMUNICATION; REMOTE STATE PREPARATION; SUPERDENSE CODING;

INFORMATION THEORY;

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

References (37)

1. C. Bennett and S. J. Wiesner, "Communication via one- and two-particle operators on einstein-podolsky-rosen states," Phys. Rev. Lett., vol. 69, p. 2881, 1992.
2. A. Harrow, P. Hayden, and D. Leung, "Superdense coding of quantum states," Phys. Rev. Lett., vol. 92, p. 187901, 2004, arXiv:qUant-ph/ 0307221.
3. P. Hayden, D. Leung, and A. Winter, "Aspects of generic quantum entanglement," Comm. Math. Phys., 2006, arXiv quant-ph/0407049.
4. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information. Cambridge, U.K.: Cambridge University Press, 2000.
5. I. Devetak, A. W. Harrow, and A. Winter, "A family of quantum protocols," Phys. Rev. Lett., vol. 93, p. 230504, 2004, arXiv quant-ph/0308044.
6. H.-K. Lo, "Classical communication cost in distributed quantum information processing - A generalization of quantum communication complexity," Phys. Rev. A, vol. 62, p. 012313, 2000, arXiv:qUant-ph/ 9912009.
7. C. H. Bennett, D. P. DiVincenzo, P. W. Shot, J. A. Smolin, B. M. Terhal, and W. K. Wootters, "Remote state preparation," Phys. Rev. Lett., vol. 87, p. 077902, 2001, arXiv:qUant-ph/0006044.
8. A. Abeyesinghe and P. Hayden, "Generalized remote state preparation: Trading ebits, qubits, and ebits in quantum communication," Phys. Rev. A, vol. 68, no. 6, p. 062319, 2003, arXiv quant-ph/0308143.
9. I. Devetak and T. Berger, "Low-entanglement remote state preparation," Phys. Rev. Lett., vol. 87, no. 9, p. 197901, 2001, arXiv quant-ph/0102123.
10. P. Hayden, R. Jozsa, and A. Winter, "Trading quantum for classical resources in quantum data compression," J. Math. Phys., vol. 43, no. 9, pp. 4404-4444, 2002, arXiv:qUant-ph/0204038.
11. A. Harrow, "Coherent communication of classical messages," Phys. Rev. Lett., vol. 92, no. 9, p. 097902, 2004, arXiv quant-ph/0307091.
12. C. H. Bennett, P. Hayden, D. Leung, P. W. Shor, and A. Winter, "Remote preparation of quantum states," IEEE Trans. Inf. Theory, vol. 51, pp. 56-74, Jan. 2005, arXiv quant-ph/0307100.
13. M. O. Rabin and A. C.-C. Yao, unpublished manuscript, 1979, cited in A. C.-C. Yao, "Some questions on the complexity of distributive computing," Proc. 11th ACM Symp. Theory of Computing, pp. 209-213.
14. R. Ahlswede and G. Dueck, "Identification via channels," IEEE Trans. Inf. Theory, vol. 35, no. 1, pp. 15-29, 1989.
15. E. Lubkin, "Entropy of an n-system from its correlation with a k-reservoir.," J. Math. Phys., vol. 19, pp. 1028-1031, 1978.
16. S. Lloyd and H. Pagels, "Complexity as thermodynamic depth," Ann. Phys., vol. 188, no. 1, pp. 186-213, 1988.
17. D. Page, "Average entropy of a subsystem," Phys. Rev. Lett., vol. 71, pp. 1291-1294, 1993.
18. S. K. Foong and S. Kanno, "Proof of page's conjecture on the average entropy of a subsystem," Phys. Rev. Lett., vol. 72, pp. 1148-1151, 1994.
19. J. Sanchez-Ruiz, "Simple proof of page's conjecture on the average entropy of a subsystem," Phys. Rev. E, vol. 52, pp. 5653-5655, 1995.
20. S. Sen, "Average entropy of a quantum subsystem," Phys. Rev. Lett., vol. 77, no. 1, pp. 1-3, 1996.
21. P. Hayden, D. Leung, P. Shor, and A. Winter, "Randomizing quantum states: Constructions and applications," Commun. Math. Phys., vol. 250, no. 2, pp. 371-391, 2004, arXiv:qUant-ph/0307104.
22. M.Fannes, "A continuity property of the entropy density sor spin lattice systems," Commun. Math. Phys., vol. 31, pp. 291-294, 1973.
23. P.M. Alberti and A. Uhlmann, Stochasticity and Partial Order. Dordrecht, The Netherlands: Reidel, 1982.
24. M. Ohya and D. Petz, Quantum Entropy and Its Use, ser. Texts and monographs in physics. Berlin, Germany: Springer-Verlag, 1993.
25. A. Uhlmann, "The 'transition probability' in the state space of a *-algebra," Rep. Math. Phys., vol. 9, p. 273, 1976.
26. R. Jozsa, "Fidelity for mixed quantum states," J. Mod. Opt., vol. 41, pp. 2315-2323, 1994.
27. V. D. Milman and G. Schechtman, Asymptotic Theory of Finite Dimensional Normed Spaces, ser. Lecture Notes in Mathematics. Berlin, Germany: Springer-Verlag, 1986.
28. M. Nielsen, "Continuity bounds for entanglement," Phys. Rev. A, vol. 61, p. 064301, 2000.
29. A. Winter, "Coding theorem and strong converse for quantum channels," IEEE Trans. Inf. Theory, vol. 45, pp. 2481-2485, 1999.
30. R. Ahlswede and A. Winter, "Strong converse for identification via quantum channels," IEEE Trans. Inf. Theory, vol. 48, no. 3, pp. 569-579, Mar. 2002, arXiv quant-ph/0012127.
31. A. Winter, "Quantum and classical message identification via quantum channels," Quantum Inf. Comuput., vol. 4, pp. 563-578, 2004, arXiv quant-ph/0401060.
32. A. Winter, Identification Via Quantum Channels in the Presence of Prior Correlation and Feedback arXiv quant-ph/0403203.
33. A. Ambainis and A. Smith, "Small pseudo-random families of matrices: Derandomizing approximate quantum encryption," in Proc. RANDOM 2004, 2004, arXiv quant-ph/0404075.
34. A. K. Pati, "Minimum classical bit for remote preparation and measurement of a qubit," Phys. Rev. A, vol. 63, p. 14302, 2001, arXiv:qUant-ph/9907022.
35. M.-Y. Ye, Y.-S. Zhang, and G.-C. Guo, "Faithful remote state preparation using finite classical bits and a nonmaximally entangled state," Phys. Rev. A, vol. 69, p. 022310, 2004, quant-ph/0307027.
36. D. W. Berry, "Resources required for exact remote state preparation," Phys. Rev. A, vol. 70, p. 062306, 2004, arXiv:qUant-ph/0404004.
37. A. C.-C. Yao, "Some questions on the complexity of distributive computing," in Proc. 11th ACM Symp. Theory of Computing, pp. 209-213.