Papers › Witnessing Negative Conditional Entropy
Witnessing Negative Conditional Entropy
Mahathi Vempati, Nirman Ganguly, Indranil Chakrabarty, Arun K Pati
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Quantum states that possess negative conditional von Neumann entropy provide quantum advantage in several information-theoretic protocols including superdense coding, state merging, distributed private randomness distillation and one-way entanglement distillation. While entanglement is an important resource, only a subset of entangled states have negative conditional von Neumann entropy. Despite this utility, a proper resource theory for conditional von Neumann entropy has not been developed, unlike that of entanglement. We pave the way for such a resource theory by characterizing the class of free states (density matrices having non-negative conditional von Neumann entropy) as convex and compact. This allows us to prove the existence of a Hermitian operator (a witness) for the detection of states having negative conditional entropy for bipartite systems in arbitrary dimensions. We construct a family of such witnesses and prove that the expectation value of any of them in a state is an upper bound to the conditional entropy of the state. We pose the problem of obtaining a tight upper bound to the set of conditional entropies of states in which an operator gives the same expectation value as a convex optimization problem. We solve it numerically for a two qubit case and find that this enhances the usefulness of our witnesses. We also find that for a particular witness, the estimated tight upper bound matches the value of conditional entropy for Werner states. We explicate the utility of our work in the detection of useful states in the above-mentioned protocols.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections