Fetching the paper…
Reading the bibliography…
We show that optimal protocols for noisy channel coding of public or private information over either classical or quantum channels can be directly constructed from two more primitive information-theoretic tools: privacy amplification and information reconciliation, also known as data compression with side information.
C. E. Shannon, “A mathematical theory of communication,” Bell Sys. Tech. J. , vol. 27, pp. 379–423, Jul. 1948
1948
Earlier work this paper cites.
R. G. Gallager, Information Theory and Reliable Communication . Wiley, Jan. 1968
1968
Earlier work this paper cites.
A. D. Wyner, “The Wire-Tap channel,” Bell Sys. Tech. J. , vol. 54, no. 8, pp. 1355–1387, Oct. 1975
1975
Earlier work this paper cites.
R. Ahlswede and I. Csiszar, “Common randomness in information theory and cryptography. i. secret sharing,” IEEE Trans. Inf. Theory , vol. 39, no. 4, pp. 1121–1132, 1993
1993
Earlier work this paper cites.
B. Schumacher and M. D. Westmoreland, “Sending classical information via noisy quantum channels,” Phys. Rev. A , vol. 56, no. 1, p. 131, Jul. 1997
1997
Earlier work this paper cites.
A. Holevo, “The capacity of the quantum channel with general signal states,” IEEE Trans. Inf. Theory , vol. 44, no. 1, pp. 269–273, 1998
1998
Earlier work this paper cites.
U. Maurer and S. Wolf, “Information-Theoretic key agreement: From weak to strong secrecy for free,” ser. Lecture Notes on Computer Science, B. Preneel, Ed., vol. 1807. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000
2000
Earlier work this paper cites.
X. Ma, N. Varnica, and A. Kavčić, “Matched information rate codes for binary ISI channels,” in Proceedings of the 2002 IEEE International Symposium on Information Theory , 2002, p. 269
2002
Earlier work this paper cites.
M. Hayashi and H. Nagaoka, “General formulas for capacity of classical-quantum channels,” Information Theory, IEEE Transactions on , vol. 49, no. 7, pp. 1753–1768, 2003
2003
Earlier work this paper cites.
J. Soriaga and P. Siegel, “On distribution shaping codes for partial-response channels,” in Proceedings of the 41st Annual Allerton Conference on Communication, Control, and Computing , Monticello, Illinois, Oct. 2003, pp. 468–477
2003
Earlier work this paper cites.
R. Renner and S. Wolf, “Smooth renyi entropy and applications,” in Proceedings of the 2004 International Symposium on Information Theory , 2004, p. 233
2004
Earlier work this paper cites.
R. Alicki and M. Fannes, “Continuity of quantum conditional information,” Journal of Physics A: Mathematical and General , vol. 37, no. 5, pp. L55–L57, 2004
2004
Cited alongside, same era.
R. Renner, “Security of quantum key distribution,” Ph.D. dissertation, ETH Zürich, Sep. 2005
2005
Cited alongside, same era.
I. Devetak, “The private classical capacity and quantum capacity of a quantum channel,” IEEE Trans. Inf. Theory , vol. 51, no. 1, pp. 44– 55, 2005
2005
Cited alongside, same era.
R. Renner and R. König, “Universally composable privacy amplification against quantum adversaries,” in Second Theory of Cryptography Conference , ser. Lecture Notes in Computer Science, vol. 3378/2005. Cambridge, MA: Springer, Feb. 2005, pp. 407–425
2005
Cited alongside, same era.
T. M. Cover and J. A. Thomas, Elements of Information Theory 2nd Edition , 2nd ed. Wiley-Interscience, Jul. 2006
M. Tomamichel, R. Colbeck, and R. Renner, “A fully quantum asymptotic equipartition property,” IEEE Transactions on Information Theory , vol. 55, no. 12, pp. 5840–5847, Nov. 2009
2009
Later among the works it cites.
M. Mosonyi and N. Datta, “Generalized relative entropies and the capacity of classical-quantum channels,” Journal of Mathematical Physics , vol. 50, no. 7, pp. 072 104–14, Jul. 2009
2009
Later among the works it cites.
M. B. Hastings, “Superadditivity of communication capacity using entangled inputs,” Nat Phys , vol. 5, no. 4, pp. 255–257, Apr. 2009
2009
Later among the works it cites.
R. König, R. Renner, and C. Schaffner, “The operational meaning of min- and Max-Entropy,” IEEE Trans. Inf. Theory , vol. 55, no. 9, pp. 4337–4347, 2009
2009
Later among the works it cites.
M. Tomamichel, R. Colbeck, and R. Renner, “Duality between smooth Min- and Max-Entropies,” IEEE Trans. on Inf. Theory , vol. 56, pp. 4674-4681, 2010
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2006
Cited alongside, same era.
R. Renner, S. Wolf, and J. Wullschleger, “The Single-Serving channel capacity,” in Information Theory, 2006 IEEE International Symposium on , 2006, pp. 1424–1427
2006
Cited alongside, same era.
G. Bowen and N. Datta, “Quantum coding theorems for arbitrary sources, channels and entanglement resources,” arXiv:quant-ph/0610003 , Sep. 2006
2006
Cited alongside, same era.
R. König and R. Renner, “Sampling of min-entropy relative to quantum knowledge,” arXiv: 0712.4291 , Dec. 2007
2007
Cited alongside, same era.
G. Smith, J. M. Renes, and J. A. Smolin, “Structured codes improve the Bennett-Brassard-84 quantum key rate,” Phys. Rev. Lett. , vol. 100, no. 17, pp. 170 502–4, May 2008
2008
Cited alongside, same era.
P. Hayden, M. Horodecki, A. Winter, and J. Yard, “A decoupling approach to the quantum capacity,” Open Systems & Information Dynamics , vol. 15, no. 1, pp. 7–19, Mar. 2008
2008
Cited alongside, same era.
A. Abeyesinghe, I. Devetak, P. Hayden, and A. Winter, “The mother of all protocols: restructuring quantum informations family tree,” Proc. R. Soc. A , vol. 465, no. 2108, pp. 2537–2563, Aug. 2009
2009
Cited alongside, same era.
2010
Closest in time.
L. Wang and R. Renner, “One-Shot Classical-Quantum capacity and hypothesis testing,” arXiv: 1007.5456 , Jul. 2010
2010
Closest in time.
J. M. Renes, “Duality of privacy amplification against quantum adversaries and data compression with quantum side information,” Proc. Roy. Soc. A , published online before print Dec. 2010; doi:10.1098/rspa.2010.0445
2010
Closest in time.
M. Tomamichel and R. Renner, “The uncertainty relation for smooth entropies,” arXiv: 1009.2015 , Sep. 2010
2010
Closest in time.
M. Tomamichel, C. Schaffner, A. Smith, and R. Renner, “Leftover hashing against quantum side information,” arXiv: 1002.2436 , Feb. 2010
2010
Closest in time.
J. M. Renes and R. Renner, “One-Shot classical data compression with quantum side information and the distillation of common randomness or secret keys,” arXiv: 1008.0452 , Aug. 2010
2010
Closest in time.