Fetching the paper…
Reading the bibliography…
We establish the classical capacity of optical quantum channels as a sharp transition between two regimes---one which is an error-free regime for communication rates below the capacity, and the other in which the probability of correctly decoding a classical message converges exponentially fast to zero if the communication rate exceeds the classical capacity.
J. Wolfowitz, Coding Theorems of Information Theory . Springer, 1964, vol. 31
1964
Earlier work this paper cites.
S. Arimoto, “On the converse to the coding theorem for discrete memoryless channels,” IEEE Transactions on Information Theory , vol. 19, pp. 357–359, May 1973
1973
Earlier work this paper cites.
C. M. Caves, “Quantum limits on noise in linear amplifiers,” Physical Review D , vol. 26, pp. 1817–1839, October 1982. [Online]. Available: http://link.aps.org/doi/10.1103/PhysRevD.26.1817
1982
Earlier work this paper cites.
1986
Earlier work this paper cites.
C. M. Caves and P. D. Drummond, “Quantum limits on bosonic communication rates,” Reviews of Modern Physics , vol. 66, pp. 481–537, April 1994. [Online]. Available: http://link.aps.org/doi/10.1103/RevModPhys.66.481
1994
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, July 1997. [Online]. Available: http://link.aps.org/doi/10.1103/PhysRevA.56.131
1997
Earlier work this paper cites.
A. S. Holevo, “The capacity of the quantum channel with general signal states,” IEEE Transactions on Information Theory , vol. 44, pp. 269–273, January 1998, arXiv:quant-ph/9611023
1998
Earlier work this paper cites.
T. Ogawa and H. Nagaoka, “Strong converse to the quantum channel coding theorem,” IEEE Transactions on Information Theory , vol. 45, pp. 2486–2489, November 1999, arXiv:quant-ph/9808063
1999
Earlier work this paper cites.
A. Winter, “Coding theorem and strong converse for quantum channels,” IEEE Transactions on Information Theory , vol. 45, no. 7, pp. 2481–2485, 1999
1999
Earlier work this paper cites.
A. Nayak, “Optimal lower bounds for quantum automata and random access codes,” in Proceedings of the 40th Annual Symposium on Foundations of Computer Science , New York City, NY, USA, October 1999, pp. 369–376, arXiv:quant-ph/9904093
1999
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, February 2001, arXiv:quant-ph/9912067. [Online]. Available: http://link.aps.org/doi/10.1103/PhysRevA.63.032312
2001
Earlier work this paper cites.
V. Giovannetti, S. Guha, S. Lloyd, L. Maccone, and J. H. Shapiro, “Minimum output entropy of bosonic channels: A conjecture,” Physical Review A , vol. 70, p. 032315, September 2004, arXiv:quant-ph/0404005. [Online]. Available: http://link.aps.org/doi/10.1103/PhysRevA.70.032315
2004
Earlier work this paper cites.
R. Renner and S. Wolf, “Smooth Rényi entropy and applications,” in Proceedings of the 2007 International Symposium on Information Theory , 2004, p. 232. [Online]. Available: http://www.ti.inf.ethz.ch/sw/publications/smooth.ps
2004
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, arXiv:quant-ph/0308012
2004
Cited alongside, same era.
V. Giovannetti, S. Lloyd, L. Maccone, J. H. Shapiro, and B. J. Yen, “Minimum Rényi and Wehrl entropies at the output of bosonic channels,” Physical Review A , vol. 70, p. 022328, August 2004, arXiv:quant-ph/0404037. [Online]. Available: http://link.aps.org/doi/10.1103/PhysRevA.70.022328
2004
Cited alongside, same era.
R. Renner, “Security of quantum key distribution,” Ph.D. dissertation, ETH Zürich, December 2005, arXiv:quant-ph/0512258
2005
2012
Later among the works it cites.
2012
Later among the works it cites.
2012
Later among the works it cites.
2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
F. Caruso, V. Giovannetti, and A. S. Holevo, “One-mode bosonic Gaussian channels: A full weak-degradability classification,” New Journal of Physics , vol. 8, no. 12, p. 310, 2006, arXiv:quant-ph/0609013
2006
Cited alongside, same era.
T. M. Cover and J. A. Thomas, Elements of Information Theory . Wiley-Interscience, 2006
2006
Cited alongside, same era.
J. Eisert and M. M. Wolf, “Gaussian quantum channels,” Quantum Information with Continuous Variables of Atoms and Light , pp. 23–42, 2007, arXiv:quant-ph/0505151
2007
Cited alongside, same era.
T. Ogawa and H. Nagaoka, “Making good codes for classical-quantum channel coding via quantum hypothesis testing,” IEEE Transactions on Information Theory , vol. 53, no. 6, pp. 2261–2266, June 2007
2007
Cited alongside, same era.
B. J. Yen and J. H. Shapiro, “Multiple-access bosonic communications,” Physical Review A , vol. 72, p. 062312, December 2005, arXiv:quant-ph/0506171. [Online]. Available: http://link.aps.org/doi/10.1103/PhysRevA.72.062312
2008
Cited alongside, same era.
2009
Cited alongside, same era.
T. Tao, Topics in Random Matrix Theory , ser. Graduate Studies in Mathematics. American Mathematical Society, 2012, vol. 132, see also http://terrytao.wordpress.com/2010/01/03/254a-notes-1-concentration-of-measure
2010
Cited alongside, same era.
2011
Cited alongside, same era.
2013
Later among the works it cites.
2014
Closest in time.
2014
Closest in time.
2014
Closest in time.
2014
Closest in time.
2014
Closest in time.
2014
Closest in time.