Max- Relative Entropy of Entanglement, alias Log Robustness
arXiv:0807.2536
Abstract
Properties of the max- relative entropy of entanglement are investigated, and its significance as an upper bound to the one shot rate for perfect entanglement dilution, under a particular class of quantum operations, is discussed. It is shown that it is in fact equal to another known entanglement monotone, namely the log robustness. It is known that the latter is not asymptotically continuous and it is not known whether it is weakly additive. However, by suitably modifying the max- relative entropy of entanglement we obtain a quantity which is seen to satisfy both these properties. In fact, the modified quantity is shown to be equal to the regularised relative entropy of entanglement.
Published version; 9 pages, no figures
References in corpus (15)
- The logarithmic negativity: A full entanglement monotone that is not convex
- Entanglement Measures and Purification Procedures
- Quantum Nonlocality without Entanglement
- The operational meaning of min- and max-entropy
- Robustness of entanglement
- Coding Theorem and Strong Converse for Quantum Channels
- An improved bound on distillable entanglement
- How robust is a quantum gate in the presence of noise?
- A uniqueness theorem for entanglement measures
- An Information-Spectrum Approach to Classical and Quantum Hypothesis Testing for Simple Hypotheses
- The Structure of Bipartite Quantum States - Insights from Group Theory and Cryptography
- The asymptotic relative entropy of entanglement
- Smooth Renyi Entropies and the Quantum Information Spectrum
- Entanglement purification via separable superoperators
- Entanglement activation and the robustness of quantum correlations