Papers › One-half reflected entropy is not a lower bound for entanglement of purification
One-half reflected entropy is not a lower bound for entanglement of purification
Josiah Couch, Phuc Nguyen, Sarah Racz, Georgios Stratis, Yuxuan Zhang
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.
In recent work, Akers et al. proved that the entanglement of purification Eₚ(A:B) is bounded below by half of the q-R\'enyi reflected entropy S_R^((q))(A:B) for all q≥2, showing that Eₚ(A:B) = 1/2 S_R^((q))(A:B) for a class of random tensor network states. Naturally, the authors raise the question of whether a similar bound holds at q = 1. Our work answers that question in the negative by finding explicit counter-examples, which we arrive at through numerical optimization. Nevertheless, this result does not preclude the possibility that restricted sets of states, such as CFT states with semi-classical gravity duals, could obey the bound in question.
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