Noisy channel coding via privacy amplification and information reconciliation

IEEE Transactions on Information Theory

Volumn 57, Issue 11, 2011, Pages 7377-7385

  Renes, Joseph M ^a   Renner, Renato ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Channel coding; information reconciliation; privacy amplification; quantum information; Slepian Wolf coding; smooth entropies

Indexed keywords

CLASSICAL INFORMATION; INFORMATION RECONCILIATION; OF QUANTUM-INFORMATION; OPTIMAL PROTOCOLS; PRIVACY AMPLIFICATION; PRIVATE INFORMATION; QUANTUM CHANNEL; QUANTUM INFORMATION; SIDE INFORMATION; SLEPIAN-WOLF CODING;

AMPLIFICATION; CHANNEL CODING; DATA COMPRESSION; ENTROPY; OPTIMIZATION; QUANTUM OPTICS;

CODES (SYMBOLS);

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

References (32)

1. T. M. Cover and J. A. Thomas, Elements of Information Theory 2nd Edition, 2nd ed. New York: Wiley-Interscience, 2006.
2. A. Abeyesinghe, I. Devetak, P. Hayden, and A. Winter, "The mother of all protocols: restructuring quantum informations family tree," Proc. Roy. Soc. A, vol. 465, no. 2108, pp. 2537-2563, Aug. 2009.
3. R. Renner and S. Wolf, "Smooth Renyi entropy and applications," in Proc. 2004 Int. Symp. Information Theory, 2004, p. 233.
4. R. Renner, "Security of QuantumKey Distribution," Ph.D. dissertation, ETH Zürich, Zürich, Switzerland, 2005.
5. M. Tomamichel, R. Colbeck, and R. Renner, "Duality between smooth Min-and Max-Entropies," IEEE Trans. Inf. Theory, vol. 56, pp. 4674-4681, 2010.
6. M. Tomamichel, R. Colbeck, and R. Renner, "A fully quantum asymptotic equipartition property," IEEE Trans. Inf. Theory, vol. 55, no. 12, pp. 5840-5847, Nov. 2009.
7. C. E. Shannon, "A mathematical theory of communication," Bell Sys. Tech. J., vol. 27, pp. 379-423, Jul. 1948.
8. A. D. Wyner, "The Wire-Tap channel," Bell Sys. Tech. J., vol. 54, no. 8, pp. 1355-1387, Oct. 1975.
9. 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, Apr. 1993.
10. U. Maurer and S. Wolf, "Information-theoretic key agreement: From weak to strong secrecy for free," in Ser. Lecture Notes on Computer Science, B. Preneel, Ed. Berlin, Germany: Springer/Berlin/Heidelberg, 2000, vol. 1807.
11. A. Holevo, "The capacity of the quantum channel with general signal states," IEEE Trans. Inf. Theory, vol. 44, no. 1, pp. 269-273, Jan. 1998. (Pubitemid 128737894)
12. B. Schumacher and M. D. Westmoreland, "Sending classical information via noisy quantum channels," Phys. Rev. A, vol. 56, no. 1, p. 131, Jul. 1997.
13. I. Devetak, "The private classical capacity and quantum capacity of a quantum channel," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 44-55, Jan. 2005. (Pubitemid 40145986)
14. R. Renner, S. Wolf, and J. Wullschleger, "The single-serving channel capacity," in Proc. IEEE Int. Symp. Information Theory, 2006, pp. 1424-1427. (Pubitemid 351244332)
15. M. Mosonyi and N. Datta, "Generalized relative entropies and the capacity of classical-quantum channels," J. Mathematical Physics, vol. 50, no. 7, pp. 072104-14, Jul. 2009.
16. M. Hayashi and H. Nagaoka, "General formulas for capacity of classical-quantum channels," IEEE Trans. Inf. Theory, vol. 49, no. 7, pp. 1753-1768, 2003.
17. G. Bowen and N. Datta, Quantum Coding Theorems for Arbitrary Sources, Channels and Entanglement Resources, arXiv:quant-ph/0610003 2006.
18. L. Wang and R. Renner, One-Shot Classical-Quantum Capacity and Hypothesis Testing, arXiv: 1007.5456 2010.
19. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
20. X. Ma, N. Varnica, and A. Kavcic, "Matched information rate codes for binary ISI channels," in Proc. IEEE Int. Symp. Information Theory, 2002, p. 269. (Pubitemid 34964889)
21. J. Soriaga and P. Siegel, "On distribution shaping codes for partial-response channels," in Proc. 41st Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Oct. 2003, pp. 468-477.
22. 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. 170502-4, May 2008.
23. M. B. Hastings, "Superadditivity of communication capacity using entangled inputs," Nat. Phys., vol. 5, no. 4, pp. 255-257, Apr. 2009.
24. J. M. Renes, "Duality of privacy amplification against quantum adversaries and data compression with quantum side information," Proc. Roy. Soc., Dec. 2010.
25. M. Tomamichel and R. Renner, "The uncertainty relation for smooth entropies," Phys. Rev. Lett., vol. 106, p. 110506, Mar. 2011.
26. P. Hayden, M. Horodecki, A. Winter, and J. Yard, "A decoupling approach to the quantum capacity," Open Syst. & Inf. Dynam., vol. 15, no. 1, pp. 7-19, Mar. 2008.
27. 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, Sep. 2009.
28. R. Renner and R. König, "Universally composable privacy amplification against quantum adversaries," in Proc. 2nd Theory of Cryptography Conf., ser. Lecture Notes in Computer Science, Cambridge, MA, Feb. 2005, vol. 3378, pp. 407-425. (Pubitemid 41231175)
29. R. König and R. Renner, "Sampling of Min-Entropy Relative to Quantum Knowledge," IEEE Trans. Inf. Theory, vol. 57, no. 7, pp. 4760-4787, Jul. 2011.
30. M. Tomamichel, C. Schaffner, A. Smith, and R. Renner, "Leftover hashing against quantum side information," IEEE Trans. Inf. Theory, vol. 57, no. 8, pp. 5524-5535, Aug. 2011.
31. J. M. Renes and R. Renner, "One-shot classical data compression with quantum side information and the distillation of common randomness or secret keys," IEEE Trans. Inf. Theory, IEEE CLN 10-686, to be published.
32. R. Alicki and M. Fannes, "Continuity of quantum conditional information," J. Phys. A: Mathemat. and Gen., vol. 37, no. 5, pp. L55-L57, 2004. (Pubitemid 38214163)