Fetching the paper…

Reading the bibliography…

Smooth R\'enyi Entropy of Ergodic Quantum Information Sources · Around

2007

Smooth R\'enyi Entropy of Ergodic Quantum Information Sources

Schoenmakers, Berry, Tjoelker, Jilles, Tuyls, Pim et al.

Original
PDF
Post on X

Understand

We prove that the average smooth Renyi entropy rate will approach the entropy rate of a stationary, ergodic information source, which is equal to the Shannon entropy rate for a classical information source and the von Neumann entropy rate for a quantum information source.

Built on

M. A. Nielsen and I. L. Chuang, ”Quantum Computation and Quantum Information” , Cambridge University Press, 2000
2000
Earlier work this paper cites.
I. Bjelakovic and A. Szkola, ”The Data Compression Theorem for Ergodic Quantum Information Sources” , 2003. Available as quant-ph/0301043
2003
Earlier work this paper cites.
R. Renner and S. Wolf, ”Smooth Rényi Entropy and Applications , ISIT 2004, p. 233. Full version available as http://qi.ethz.ch/pub/publications/smooth.ps
2004
Earlier work this paper cites.

Similar

R. Renner, ”Security of Quantum Key Distribution” , Diss. ETH No. 16242, PhD Thesis, ETH Zürich, September 2005. Also available as quant-ph/0512258
2005
Cited alongside, same era.
R. Renner and R. König, LNCS 3378, TCC 2005, pp. 407-425
2005
Cited alongside, same era.

Then

R. Renner and S. Wolf, ”Simple and Tight Bounds for Information Reconciliation and Privacy Amplification” , LNCS 3788, Asiacrypt 2005, pp. 199–216
Original
2005
Later among the works it cites.
T. M. Cover and J.A. Thomas, ”Elements of Information Theory” , 2nd edition, Wiley-Interscience, 2006
2006
Later among the works it cites.

Beyond the bibliography

alphaXiv searches the wider corpus for related work and actual follow-ups.

Open on alphaXiv

alphaXiv is searching for related work…