2008

Min- and Max- Relative Entropies and a New Entanglement Monotone

Datta, Nilanjana

Understand

Two new relative entropy quantities, called the min- and max-relative entropies, are introduced and their properties are investigated.

The well-known min- and max- entropies, introduced by Renner, are obtained from these.
We define a new entanglement monotone, which we refer to as the max-relative entropy of entanglement, and which is an upper bound to the relative entropy of entanglement.
We also generalize the min- and max-relative entropies to obtain smooth min- and max- relative entropies.

Built on

S. Kullback and R. Leibler, “On information and sufficiency,” Ann. Math. Stat. , vol. 22, pp. 79-86, 1951
1951
Earlier work this paper cites.
C.W. Helstrom, Quantum Detection and Estimation Theory
1976
Earlier work this paper cites.
T. S. Han and S. Verdu, “Approximation theory of output statistics,”, IEEE Trans. Inform. Theory , vol. 39, pp. 752–772, 1993
1993
Earlier work this paper cites.
M.Ohya and D.Petz, “Quantum Entropy and Its Use,” Springer-Verlag, 1993
1993
Earlier work this paper cites.
S. Verdu and T. S. Han, “A general formula for channel capacity,” IEEE Trans. Inform. Theory , vol. 40, pp. 1147–1157, 1994
1994
Earlier work this paper cites.
V. Vedral and M.B. Plenio, “Entanglement measures and purification procedures,” Phys. Rev. A , vol. 57, pp. 1147–1157, 1998
1998
Earlier work this paper cites.
A. Winter, “Coding theorem and strong converse for quantum channels,”, IEEE Trans. Inf. Theory , vol. 45, 1999
1999
Earlier work this paper cites.
T. Ogawa and H. Nagaoka, “Strong converse and Stein’s lemma in quantum hypothesis testing,” IEEE Trans. Inform. Theory , vol. 46, pp. 2428–2433, 2000
2000
Earlier work this paper cites.
M. A.Nielsen and I. L.Chuang, Quantum Computation and Quantum Information
2000
Earlier work this paper cites.
T.M. Cover and J.A. Thomas, “Elements of Information Theory,” A Wiley-Interscience Publication
Original
2001
Earlier work this paper cites.
T. S. Han, Information-Spectrum Methods in Information Theory , Springer-Verlag, 2002
2002
Earlier work this paper cites.

Similar

H. Nagaoka and M. Hayashi, “An information-spectrum approach to classical and quantum hypothesis testing for simple hypotheses,” arXiv:quant-ph/0206185 , 2002
2002
Cited alongside, same era.
T. Ogawa and H. Nagaoka, “New proof of the channel coding theorem via hypothesis testing in quantum information theory,” arXiv:quant-ph/0208139 , 2002
2002
Cited alongside, same era.
M. Hayashi and H. Nagaoka, “General formulas for capacity of classical–quantum channels,” IEEE Trans. Inform. Theory , vol. 49, pp. 1753–1768, 2003
2003
Cited alongside, same era.
R. Renner and S. Wolf, “Smooth Rényi entropy and applications,” in Proc. International Symposium on Information Theory
2004
Cited alongside, same era.
R. Renner, “Security of quantum key distribution,” PhD thesis, ETH Zurich, arXiv:quant-ph/0512258 , 2005
2005
Cited alongside, same era.
R. Renner and R. Koenig, “Universally composable privacy amplification against quantum adversaries,” Proc. of TCC 2005, LNCS, Springer , vol. 3378, 2005
2005
Cited alongside, same era.
R. Renner and S. Wolf, “Simple and tight bounds for information reconciliation and privacy amplification,” in Advances in Cryptology — ASIACRYPT 2005
2005
Cited alongside, same era.
M. Horodecki, M. Horodecki, M. Horodecki, J. Oppenheim, A. Sen(De), U. Sen and B. Synak, “Local versus non-local information in quantum information theory: formalism and phenomenon,” Phys. Rev. A , Vol. 71, No. 5, 062325, 2005
2005
Cited alongside, same era.
G. Bowen and N. Datta, “Beyond i.i.d. in quantum information theory,” arXiv:quant-ph/0604013 , Proceedings of the 2006 IEEE International Symposium on Information Theory
2006
Cited alongside, same era.
G. Bowen and N. Datta, “Quantum coding theorems for arbitrary sources, channels and entanglement resources,” arXiv:quant-ph/0610003 , 2006
2006
Cited alongside, same era.
H. Umegaki, “Conditional expectations in an operator algebra IV (entropy and information), Kodai Math. Sem. Rep. , vol. 14, pp. 59-85
Cited in the paper.
R. Bhatia, Matrix Analysis , Springer
Cited in the paper.

Then

M. Hayashi, “General formulas for fixed-length quantum entanglement concentration,” IEEE Trans. Inform. Theory , Vol. 52, No. 5, 1904-1921, 2006
2006
Later among the works it cites.
M.Hayashi, “Quantum Information An Introduction,” Springer, 2006
2006
Later among the works it cites.
G. Bowen and N. Datta, “Entanglement cost for sequences of arbitrary quantum states,” arXiv:0704.1957 , 2007
Original
2007
Later among the works it cites.
K. Matsumoto, “Entanglement cost and distillable entanglement of symmetric states,” arXiv:0708.3129 , 2007
Original
2007
Later among the works it cites.
R. Renner, S. Wolf, and J. Wullschleger, “Trade-offs in information-theoretic multi-party one-way key agreement,” to appear in Proc. of ICITS 2007, 2007
2007
Later among the works it cites.
K.M.R.Audenaert et al. “The Quantum Chernoff Bound,” Phys. Rev. Letts. , vol. 98, 160501, 2007
2007
Later among the works it cites.
G. Bowen and N. Datta, “Asymptotic entanglement manipulation of bipartite pure states,” IEEE Trans. Inform. Theory , vol. 54, pp. 3677-3686, 2008
2008
Closest in time.
R. Koenig, R. Renner and C. Schaffner, “The operational meaning of min- and max- entropy,” arXiv:0807.1338 , 2008
Original
2008
Closest in time.
M. Mosonyi and N. Datta, “Generalized relative entropies and the capacities of classical-quantum channels,” arXiv:0810.3478 , 2008
Original
2008
Closest in time.
N. Datta and R. Renner, “Smooth Rényi Entropies and the Quantum Information Spectrum,” arXiv:0801.0282 ; to appear in IEEE Trans. Inf. Theory, 2009
Original
2009
Closest in time.

Beyond the bibliography

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

Open on alphaXiv

alphaXiv is searching for related work…

Reading the bibliography…