Remote preparation of quantum states

IEEE Transactions on Information Theory

Volumn 51, Issue 1, 2005, Pages 56-74

  Bennett, Charles H ^a   Hayden, Patrick ^b   Leung, Debbie W ^b   Shor, Peter W ^c,d   Winter, Andreas ^e  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^c AT AND T LABS RESEARCH   (United States)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^e UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Cryptography; Entanglement; Large deviations; Teleportation; Tradeoff

Indexed keywords

DATA COMMUNICATION SYSTEMS; DATA COMPRESSION; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; QUANTUM CRYPTOGRAPHY; QUANTUM THEORY; THEOREM PROVING;

ENSEMBLE TRADEOFF CURVE; QUANTUM DATA COMPRESSION; QUANTUM ENTANGLEMENT; QUANTUM STATE TELEPORTATION; QUIBITS;

INFORMATION THEORY;

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

References (44)

1. 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.
2. A. Ambainis, M. Mosca, A. Tapp, and R. de Wolf, "Private quantum channels," in Proc. 41st Annu. Symp. Foundations of Computer Science (FOCS), Redondo Beach, CA, Nov. 12-14, 2000, pp. 547-553.
3. H. Barnum, C. M. Caves, C. A. Fuchs, R. Jozsa, and B. W. Schumacher, "On quantum coding for ensembles of mixed states," J. Phys. A: Math. and Gen., vol. 34, no. 35, pp. 6767-6785, 2001.
4. C. H. Bennett and S. Wiesner, "Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states," Phys. Rev. Lett., vol. 69, pp. 2881-2884, 1992.
5. C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W. K. Wootters, "Teleporting an unknown quantum state Via dual classical and Einstein-Podolsky-Rosen channels," Phys. Rev. Lett., vol. 70, no. 13, pp. 1895-1899, 1993.
6. C. H. Bennett, I. Devetak, A. Harrow, P. W. Shor, and A. Winter, " The Quantum Reverse Shannon Theorem," in preparation.
7. C. H. Bennett, D. P. DiVincenzo, P. W. Shor, J. A. Smolin, B. M. Terhal, and W. K. Wootters, "Remote state preparation," Phys. Rev. Lett. vol. 87, no. 077902, 2001.
8. C. H. Bennett, D. P. DiVincenzo, P. W. Shor, J. A. Smolin, B. M. Terhal, and W. K. Wootters, "Erratum," Phys. Rev. Lett., vol. 88, 099902, 2002.
9. C. H. Bennett, A. W. Harrow, D. W. Leung, and J. A. Smolin, "On the Capacities of Bipartite Hamiltonians and Unitary Gates," e-print, quant-ph/0205057, 2002.
10. C. H. Bennett, P. Hayden, D. W. Leung, P. W. Shor, and A. Winter, "Randomizing quantum states: constructions and applications," Commun. Math. Phys., vol. 250, pp. 371-391, 2004.
11. C. H. Bennett, P. W. Shor, J. A. Smolin, and A. V. Thapliyal, "Entanglement-assisted classical capacity of noisy quantum channels," Phys. Rev. Lett., vol. 83, no. 15, pp. 3081-3084, 1999.
12. C. H. Bennett, P. W. Shor, J. A. Smolin, and A. V. Thapliyal, "Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem," IEEE Trans. Inf. Theory, vol. 48, no. 10, pp. 2637-2655, Oct. 2002.
13. D. W. Berry and B. C. Sanders, "Optimal remote state preparation," Phys. Rev. Lett., vol. 90, no. 057901, 2003.
14. P. O. Boykin and V. Roychowdhury, "Optimal encryption of quantum bits," Phys. Rev. A, vol. 67, no. 042317, 2003.
15. N. Cerf, N. Gisin, and S. Massar, "Classical teleportation of a quantum bit," Phys. Rev. Lett., vol. 84, no. 11, pp. 2521-2524, 2000.
16. H. Chernoff, "A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations," Ann. Math. Statist. vol. 23, pp. 493-507, 1952.
17. M.-D. Choi, "Completely positive linear maps on complex matrices," Lin. Algebra and Appl., vol. 10, pp. 285-290, 1975.
18. T. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
19. H. Cramér, "Sur un nouveau théorème-limite de la theorie des probabilités," in Actualités Scientifiques et Industrielles (Colloque consacré à la theorie des probabilités no. 736). Paris, France: Hermann, 1938, pp. 5-23.
20. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
21. E. B. Davies and J. T. Lewis, "An operational approach to quantum probability," Commun. Math. Phys., vol. 17, pp. 239-260, 1970.
22. A. Dembo and O. Zeitouni, Large Deviations: Techniques and Applications, 2nd ed, ser. Applications of Mathematics 38. New York: Springer-Verlag, 1998.
23. I. Devetak and T. Berger, "Low-entanglement remote state preparation," Phys. Rev. Lett., vol. 87, no. 197901, 2001.
24. D. P. DiVincenzo, D. W. Leung, and B. M. Terhal, "Quantum data hiding," IEEE Trans. Inf. Theory, vol. 48, no. 3, pp. 580-599, Mar. 2002.
25. D. P. DiVincenzo, P. Hayden, and B. M. Terhal, "Hiding Quantum Data," e-print, quant-ph/0207147, 2002.
26. M. Fannes, "A continuity property of the entropy density for spin lattice systems," Commun. Math. Phys., vol. 31, pp. 291-294, 1973.
27. W. Feller, An Introduction to Probability Theory and its Applications 3rd ed. New York: Wiley, 1968, vol. I.
28. C. A. Fuchs and J. van de Graaf, "Cryptographic distinguishability measures for quantum-mechanical states," IEEE Trans. Inf. Theory, vol. 45, no. 4, pp. 1216-1227, May 1999.
29. S. Goldwasser, S. Micali, and C. Rackoff, "The knowledge complexity of interactive proof systems," SIAM J. Comput., vol. 18, no. 1, pp. 186-208, 1989.
30. A. Hayashi, T. Hashimoto, and M. Horibe, "Remote state preparation without oblivious condition," Phys. Rev. A, vol. 67, no. 5, 052302, 2003.
31. 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.
32. A. Harrow, "Coherent classical communication," Phys. Rev. Lett., vol. 92, no. 9, 097902, Mar. 2004.
33. R. Jozsa, "Fidelity for mixed quantum states," J. Mod. Opt., vol. 41, no. 12, pp. 2315-2323, 1994.
34. E. Kushilevitz and N. Nisan, Communication Complexity. Cambridge, U.K.: Cambridge Univ. Press, 1996.
35. R. Jozsa and B. Schumacher, "A new proof of the quantum noiseless coding theorem," J. Mod. Opt., vol. 41, no. 12, pp. 2343-2349, 1994.
36. D. W. Leung and P. W. Shor, "Oblivious remote state preparation," Phys. Rev. Lett., vol. 90, no. 12, 127905, 2003.
37. H.-K. Lo, "Classical communication cost in distributed quantum information processing - A generalization of quantum communication complexity," Phys. Rev. A, vol. 62, no. 012313, 2000.
38. A. K. Pati, "Minimum classical bit for remote preparation and measurement of a qubit," Phys. Rev. A, vol. 63, no. 014302, 2001.
39. B. W. Schumacher, "Quantum coding," Phys. Rev. A, vol. 51, no. 4, pp. 2738-2747, 1995.
40. B. Schumacher and M. D. Westmoreland, "Sending classical information via noisy quantum channels," Phys. Rev. A, vol. 56, no. 1, pp. 131-138, 1997.
41. A. Uhlmann, "The 'transition probability' in the state space of a *-algebra," Rep. Math. Phys., vol. 9, no. 2, pp. 273-279, 1976.
42. A. Winter, "Coding theorem and strong converse for quantum channels," IEEE Trans. Inf. Theory, vol. 45, no. 7, pp. 2481-2485, Nov. 1999.
43. A. Winter, "Compression of Sources of Probability Distributions and Density Operators," e-print, quant-ph/0208131, 2002.
44. n-1," Phys. Rev. A, vol. 65, no. 2, 022316, 2002.