A classification of incomparable states

Abstract

Let (\| > ,| φ>) be an incomparable pair of states ((| | φ>)), , i.e., (| >) and (| φ>) cannot be transformed to each other with probability one by local transformations and classical communication (LOCC). We show that incomparable states can be multiple-copy transformable, , i.e., there can exist a k, such that (| > k+1 | φ> k+1), i.e., (k+1) copies of (| >) can be transformed to (k+1) copies of (| φ>) with probability one by LOCC but (| > n | φ> n ∀ n≤ k). We call such states k-copy LOCC incomparable. We provide a necessary condition for a given pair of states to be k-copy LOCC incomparable for some k. We also show that there exist states that are neither k-copy LOCC incomparable for any k nor catalyzable even with multiple copies. We call such states strongly incomparable. We give a sufficient condition for strong incomparability. We demonstrate that the optimal probability of a conclusive transformation involving many copies, (pmax(| > m | φ> m)) can decrease exponentially with the number of source states (m), even if the source state has more entropy of entanglement.

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…