Classical codes for quantum broadcast channels

T. M. Cover, “Broadcast channels,” IEEE Transacations on Information Theory , vol. 18, no. 1, pp. 2–14, January 1972

1972

Earlier work this paper cites.

P. P. Bergmans, “Random coding theorem for broadcast channels with degraded components,” IEEE Transactions on Information Theory , vol. 19, no. 2, pp. 197–207, March 1973

1973

Earlier work this paper cites.

K. Marton, “A coding theorem for the discrete memoryless broadcast channel,” IEEE Transacations on Information Theory , vol. 25, no. 3, pp. 306–311, 1979

1979

Earlier work this paper cites.

A. El Gamal and E. van der Meulen, “A proof of Marton’s coding theorem for the discrete memoryless broadcast channel (corresp.),” IEEE Transactions on Information Theory , vol. 27, no. 1, pp. 120–122, January 1981

1981

Earlier work this paper cites.

B. Schumacher and M. D. Westmoreland, “Sending classical information via noisy quantum channels,” Physical Review A , vol. 56, pp. 131–138, 1997

1997

Earlier work this paper cites.

A. S. Holevo, “The capacity of the quantum channel with general signal states,” IEEE Transacations on Information Theory , vol. 44, no. 1, pp. 269–273, 1998

1998

Earlier work this paper cites.

A. Winter, “Coding theorem and strong converse for quantum channels,” IEEE Transacations on Information Theory , vol. 45, no. 7, pp. 2481–2485, 1999

1999

Earlier work this paper cites.

A. Winter, “The capacity of the quantum multiple-access channel,” IEEE Transacations on Information Theory , vol. 47, no. 7, pp. 3059–3065, 2001

2001

Earlier work this paper cites.

A. S. Holevo and R. F. Werner, “Evaluating capacities of bosonic gaussian channels,” Physical Review A , vol. 63, p. 032312, Feb 2001. [Online]. Available: http://link.aps.org/doi/10.1103/PhysRevA.63.032312

2001

Cited alongside, same era.

M. Hayashi and H. Nagaoka, “General formulas for capacity of classical-quantum channels,” IEEE Transacations on Information Theory , vol. 49, no. 7, pp. 1753–1768, 2003

2003

Cited alongside, same era.

V. Giovannetti, S. Guha, S. Lloyd, L. Maccone, J. H. Shapiro, and H. P. Yuen, “Classical capacity of the lossy bosonic channel: The exact solution,” Physical Review Letters , vol. 92, no. 2, p. 027902, January 2004

2004

Cited alongside, same era.

S. Guha, J. Shapiro, and B. Erkmen, “Classical capacity of bosonic broadcast communication and a minimum output entropy conjecture,” Physical Review A , vol. 76, no. 3, p. 032303, 2007

2007

Cited alongside, same era.

P. Sen, “Achieving the Han-Kobayashi inner bound for the quantum interference channel by sequential decoding,” September 2011, arXiv:1109.0802

Original

2011

Closest in time.

A. El Gamal and Y.-H. Kim, Network Information Theory . Cambridge University Press, 2012

2012

Closest in time.

O. Fawzi, P. Hayden, I. Savov, P. Sen, and M. M. Wilde, “Classical communication over a quantum interference channel,” IEEE Transactions on Information Theory , vol. 58, no. 6, pp. 3670–3691, June 2012, arXiv:1102.2624

Original

2012

Closest in time.

I. Savov and M. M. Wilde, “Classical codes for quantum broadcast channels,” in Proceedings of the 2012 IEEE International Symposium on Information Theory , Cambridge, MA, USA, 2012, pp. 721–725

2012

Closest in time.

V. Giovannetti, S. Lloyd, and L. Maccone, “Achieving the Holevo bound via sequential measurements,” Physical Review A , vol. 85, no. 1, p. 012302, January 2012, arXiv:1012.0386