Dimensionally sharp inequalities for the linear entropy
From MaRDI portal
Abstract: We derive an inequality for the linear entropy, that gives sharp bounds for all finite dimensional systems. The derivation is based on generalised Bloch decompositions and provides a strict improvement for the possible distribution of purities for all finite dimensional quantum states. It thus extends the widely used concept of entropy inequalities from the asymptotic to the finite regime, and should also find applications in entanglement detection and efficient experimental characterisations of quantum states.
Recommendations
Cites work
- A new inequality for the von Neumann entropy
- Bloch vectors for qudits
- Description of States in Quantum Mechanics by Density Matrix and Operator Techniques
- Inequalities for the ranks of multipartite quantum states
- Infinitely Many Constrained Inequalities for the von Neumann Entropy
- Information theory and network coding
- Properties of q-entropies
- Quantum computation and quantum information. 10th anniversary edition
- Some inequalities for quantum Tsallis entropy related to the strong subadditivity
- Subadditivity of q-entropies for q>1
- The inequalities of quantum information theory
- Uncertainty and information: foundations of generalized information theory.
Cited in
(6)- Coherence-based inequality for the discrimination of three-qubit GHZ and W class
- Linear entropy fails to predict entanglement behavior in low-density fermionic systems
- On the sharpness of the zero-entropy-density conjecture
- On the entropy of linear factors
- Linear dependence structure of the entropy space
- Entropy-energy inequalities for qudit states
This page was built for publication: Dimensionally sharp inequalities for the linear entropy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2332438)