Fetching the paper…
Reading the bibliography…
Holevo, Schumacher, and Westmoreland's coding theorem guarantees the existence of codes that are capacity-achieving for the task of sending classical data over a channel with classical inputs and quantum outputs.
C. E. Shannon, “A mathematical theory of communication,” Bell System Technical Journal , vol. 27, pp. 379–423, 1948
1948
Earlier work this paper cites.
C. W. Helstrom, “Quantum detection and estimation theory,” Journal of Statistical Physics , vol. 1, pp. 231–252, 1969. [Online]. Available: http://dx.doi.org/10.1007/BF01007479
1969
Earlier work this paper cites.
A. S. Holevo, “An analog of the theory of statistical decisions in noncommutative theory of probability,” Trudy Moscov Mat. Obsc. , vol. 26, pp. 133–149, 1972, english translation: Trans. Moscow Math Soc. 26, 133–149 (1972)
1972
Earlier work this paper cites.
A. S. Holevo, “Bounds for the quantity of information transmitted by a quantum communication channel,” Problems of Information Transmission , vol. 9, pp. 177–183, 1973
1973
Earlier work this paper cites.
E. H. Lieb and M. B. Ruskai, “Proof of the strong subadditivity of quantum-mechanical entropy,” Journal of Mathematical Physics , vol. 14, pp. 1938–1941, 1973
1973
Earlier work this paper cites.
A. Uhlmann, “The “transition probability” in the state space of a *-algebra,” Reports on Mathematical Physics , vol. 9, no. 2, pp. 273–279, 1976
1976
Earlier work this paper cites.
C. W. Helstrom, Quantum Detection and Estimation Theory . New York: Academic, 1976
1976
Earlier work this paper cites.
T. M. Cover and J. A. Thomas, Elements of Information Theory . Wiley-Interscience, 1991
1991
Earlier work this paper cites.
R. Jozsa, “Fidelity for mixed quantum states,” Journal of Modern Optics , vol. 41, no. 12, pp. 2315–2323, 1994
1994
Earlier work this paper cites.
B. Schumacher and M. D. Westmoreland, “Sending classical information via noisy quantum channels,” Physical Review A , vol. 56, no. 1, pp. 131–138, July 1997
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, no. 1, pp. 269–273, January 1998, arXiv:quant-ph/9611023
1998
Earlier work this paper cites.
A. S. Holevo, “Coding theorems for quantum channels,” Tamagawa University Research Review, Tech. Rep. 4, 1998, arXiv:quant-ph/9809023
1998
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.
C. A. Fuchs and J. van de Graaf, “Cryptographic distinguishability measures for quantum-mechanical states,” IEEE Transactions on Information Theory , vol. 45, no. 4, pp. 1216–1227, May 1999, arXiv:quant-ph/9712042
1999
Earlier work this paper cites.
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information . Cambridge University Press, 2000
2000
Earlier work this paper cites.
A. S. Holevo, “Reliability function of general classical-quantum channel,” IEEE Transactions on Information Theory , vol. 46, no. 6, pp. 2256–2261, September 2000, arXiv:quant-ph/9907087
2000
Earlier work this paper cites.
M. Hayashi and H. Nagaoka, “General formulas for capacity of classical-quantum channels,” IEEE Transactions on Information Theory , vol. 49, no. 7, pp. 1753–1768, 2003, arXiv:quant-ph/0206186
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.
——, “Channel combining and splitting for cutoff rate improvement,” IEEE Transactions on Information Theory , vol. 52, no. 2, pp. 628–639, February 2006, arXiv:cs/0508034
2006
Cited alongside, same era.
N. Datta and T. Dorlas, “A quantum version of Feinstein’s theorem and its application to channel coding,” in Proceedings of the IEEE International Symposium on Information Theory , Seattle, Washington, USA, 2006, pp. 441–445
2006
Cited alongside, same era.
2010
Later among the works it cites.
2010
Later among the works it cites.
2010
Later among the works it cites.
2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Hayashi, Quantum Information: An Introduction . Berlin Heidelberg: Springer-Verlag, 2006
2006
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.
H. Nagaoka and M. Hayashi, “An information-spectrum approach to classical and quantum hypothesis testing for simple hypotheses,” IEEE Transactions on Information Theory , vol. 53, no. 2, pp. 534–549, February 2007, arXiv:quant-ph/0206185
2007
Cited alongside, same era.
T. Richardson and R. Urbanke, Modern Coding Theory . Cambridge University Press, 2008
2008
Cited alongside, same era.
2008
Cited alongside, same era.
S. B. Korada, “Polar codes for channel and source coding,” Ph.D. dissertation, École Polytechnique Fédérale de Lausanne, July 2009
2009
Cited alongside, same era.
2009
Cited alongside, same era.
2009
Cited alongside, same era.
2011
Closest in time.
2011
Closest in time.
2011
Closest in time.
2011
Closest in time.
2011
Closest in time.
I. Tal and A. Vardy, “How to construct polar codes,” May 2011, arXiv:1105.6164
2011
Closest in time.
L. Wang and R. Renner, “One-shot classical-quantum capacity and hypothesis testing,” Physical Review Letters , vol. 108, p. 200501, May 2012
2012
Closest in time.
V. Giovannetti, S. Lloyd, and L. Maccone, “Achieving the Holevo bound via sequential measurements,” Physical Review A , vol. 85, p. 012302, January 2012
2012
Closest in time.
2012
Closest in time.
2012
Closest in time.
——, “Polar codes for private classical communication,” 2012, arXiv:1203.5794
2012
Closest in time.