Distillable entanglement under dually non-entangling operations
Ludovico Lami, Bartosz Regula

TL;DR
This paper provides an exact formula for entanglement distillation under dually non-entangling operations, showing that all entangled states can be distilled and revealing fundamental irreversibility in entanglement manipulation.
Contribution
It introduces a regularised formula for DNE distillable entanglement, connecting it to a modified relative entropy, and establishes bounds and irreversibility results in entanglement theory.
Findings
DNE distillable entanglement equals a modified regularised relative entropy.
Entanglement can be distilled from any entangled state under DNE.
Entanglement cost remains unchanged under DNE, indicating irreversibility.
Abstract
Computing the exact rate at which entanglement can be distilled from noisy quantum states is one of the longest-standing questions in quantum information. We give an exact solution for entanglement distillation under the set of dually non-entangling (DNE) operations -- a relaxation of the typically considered local operations and classical communication, comprising all channels which preserve the sets of separable states and measurements. We show that the DNE distillable entanglement coincides with a modified version of the regularised relative entropy of entanglement in which the arguments are measured with a separable measurement. Ours is only the second known regularised formula for the distillable entanglement under any class of free operations in entanglement theory, after that given by Devetak and Winter for (one-way) local operations and classical communication. An immediate…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Mechanics and Applications · Quantum Computing Algorithms and Architecture
