Derives several new quantum bit thread prescriptions equivalent to quantum extremal surfaces for static holographic states and introduces entanglement distribution functions organized into the entropohedron convex polytope.
A new inequality for the von Neumann entropy
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Strong subadditivity of von Neumann entropy, proved in 1973 by Lieb and Ruskai, is a cornerstone of quantum coding theory. All other known inequalities for entropies of quantum systems may be derived from it. Here we prove a new inequality for the von Neumann entropy which we prove is independent of strong subadditivity: it is an inequality which is true for any four party quantum state, provided that it satisfies three linear relations (constraints) on the entropies of certain reduced states.
fields
hep-th 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Quantum Bit Threads and the Entropohedron
Derives several new quantum bit thread prescriptions equivalent to quantum extremal surfaces for static holographic states and introduces entanglement distribution functions organized into the entropohedron convex polytope.