The reduction of the closest disentangled states

Abstract

We study the closest disentangled state to a given entangled state in any system (multi-party with any dimension). We obtain the set of equations the closest disentangled state must satisfy, and show that its reduction is strongly related to the extremal condition of the local filtering on each party. Although the equations we obtain are not still tractable, we find some sufficient conditions for which the closest disentangled state has the same reduction as the given entangled state. Further, we suggest a prescription to obtain a tight upper bound of the relative entropy of entanglement in two-qubit systems.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…