Quantum computation and quantum information
Quantum computation and quantum information
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
A simple proof of the strong subadditivity inequality
Quantum Information & Computation
The capacity of the quantum channel with general signal states
IEEE Transactions on Information Theory
Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
IEEE Transactions on Information Theory
Fano type quantum inequalities in terms of q-entropies
Quantum Information Processing
| Hi-index | 0.00 |
We consider the quantum f-relative entropy where f is an operator convex function. We define a family of operator convex functions and for that family, we give the equality conditions for the quantum f-relative entropy under various properties including monotonicity and joint convexity. The quantum f-entropy is defined in terms of the quantum f-relative entropy and we study its properties giving the equality conditions in some cases. We then show that the f-generalizations of some well-known information theoretic quantities also satisfy the data processing inequality and give equality conditions for the f-coherent information for the family of functions that we define.