hardware algorithms

Rényi Entanglement of Purification Is Non-additive

Curator's Take

AI Commentary

This article settles a long‑standing question by showing that Rényi entanglement of purification is provably non‑additive for all orders α in the range [0,1), using only two copies of a simple two‑qubit state. By contrast, it confirms additivity for α≥2, sharply delineating where the measure behaves like a conventional resource and where it does not—information that is crucial for theorists designing correlation‑based algorithms or benchmarking hardware with entanglement metrics. The remaining open window [1,2) (including the von Neumann case) highlights an intriguing frontier, suggesting that practical applications will need to account for possible non‑additivity until that gap is closed.

— Mark Eatherly

Summary

Entanglement of purification is a fundamental measure of total correlations whose additivity remains unresolved. We study its additivity for classical states on two qubits at different Rényi orders. For every $α\in[0,1)$, we prove nonadditivity within this family, witnessed by two copies of a single state. We first solve the one-copy optimization exactly for the entire family at every Rényi order. We then restrict the two-copy optimization to a natural finite set of purifications and exhibit one whose entropy is strictly below the product value. In contrast, for $α\in[2,\infty]$ we prove additivity under tensor products within this family. The interval $α\in[1,2)$, including the von Neumann case $α=1$, remains open, and we conjecture additivity there throughout the same family.