Convex Optimization
Entanglement of formation and concurrence
Quantum Information & Computation
Cryptographic distinguishability measures for quantum-mechanical states
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Let S(ρ) = -Tr(ρ log ρ) be the von Neumann entropy of an N-dimensional quantum state ρ and e2(ρ) the second elementary symmetric polynomial of the eigenvalues of ρ. We prove the inequality S(ρ)≤c(N)√e2(ρ) where c(N) = log(N) √2N/N-1. This generalizes an inequality given by Fuchs and Graaf [1] for the case of one qubit, i.e., N = 2. Equality is achieved if and only if ρ is either a pure or the maximally mixed state. This inequality delivers new bounds for quantities of interest in quantum information theory, such as upper bounds for the minimum output entropy and the entanglement of formation as well as a lower bound for the Holevo channel capacity.