Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0103131 · Physical Review A

Classification of nonasymptotic bipartite pure-state entanglement transformations

Somshubhro Bandyopadhyay, Vwani Roychowdhury, Ujjwal Sen

Published May 3, 2002• 27 citations
arXivHTMLPDF

Abstract

We show that deterministic and conclusive transformation properties of bipartite entanglement in the nonasymptotic scenario (when many but a finite number of copies of a source state are collectively manipulated) are fundamentally different from those in both the single-copy and asymptotic limits. For instance, by generalizing the notion of local comparability of entanglement in the single-copy case, we provide a complete classification of bipartite entanglement transformations in the nonasymptotic scenario. We also show that, unlike the asymptotic case, collective operations need not always be advantageous for the many-copy case. In particular, we show that (1) there exists a class of states for which the optimal conclusive transformation probability decreases exponentially with increasing number of copies, even if the source state has more entropy of entanglement, and (2) optimal conclusive transformation probability need not be a monotonic function of the number of copies.

DOI
10.1103/physreva.65.052315

Related papers

Exact and asymptotic measures of multipartite pure-state entanglement

Charles H. Bennett, Sandu Popescu, Daniel Rohrlich +2 more

Hoping to simplify the classification of pure entangled states of multi $(m)\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ quantum systems, we study exactly and asymptotically (in $n)$ reversible transformations among $n\mathrm{th}$ tensor powers of such states (i.e., $n$ copies of the state shared among the same $m$ parties) under local quantum operations and classical communication (LOCC). For exact transformations, we show that two states whose marginal one-party entropies agree are either locally unitarily equivalent or else LOCC incomparable. In particular we show that two tripartite Greenberger-Horne-Zeilinger states are LOCC incomparable to three bipartite Einstein-Podolsky-Rosen (EPR) states symmetrically shared among the three parties. Asymptotic transformations yield a simpler classification than exact transformations; for example, they allow all pure bipartite states to be characterized by a single parameter---their partial entropy---which may be interpreted as the number of EPR pairs asymptotically interconvertible to the state in question by LOCC transformations. We show that $m\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ pure states having an $m\ensuremath{-}\mathrm{w}\mathrm{a}\mathrm{y}$ Schmidt decomposition are similarly parametrizable, with the partial entropy across any nontrivial partition representing the number of standard quantum superposition or ``cat'' states $|{0}^{\ensuremath{\bigotimes}m}〉+|{1}^{\ensuremath{\bigotimes}m}〉$ asymptotically interconvertible to the state in question. For general $m\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ states, partial entropies across different partitions need not be equal, and since partial entropies are conserved by asymptotically reversible LOCC operations, a multicomponent entanglement measure is needed, with each scalar component representing a different kind of entanglement, not asymptotically interconvertible to the other kinds. In particular we show that the $m=4$ cat state is not isentropic to, and therefore not asymptotically interconvertible to, any combination of bipartite and tripartite states shared among the four parties. Thus, although the $m=4$ cat state can be prepared from bipartite EPR states, the preparation process is necessarily irreversible, and remains so even asymptotically. For each number of parties $m$ we define a minimal reversible entanglement generating set (MREGS) as a set of states of minimal cardinality sufficient to generate all $m\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ pure states by asymptotically reversible LOCC transformations. Partial entropy arguments provide lower bounds on the size of the MREGS, but for $m>2$ we know no upper bounds. We briefly consider several generalizations of LOCC transformations, including transformations with some probability of failure, transformations with the catalytic assistance of states other than the states we are trying to transform, and asymptotic LOCC transformations supplemented by a negligible $[o(n)]$ amount of quantum communication.

arXiv:quant-ph/9908073•Physical Review A•Dec 12, 2000•432 citations

Tripartite entanglement and quantum relative entropy

Ernesto F. Galvão, Martin Bodo Plenio, S. Virmani

We establish relations between tripartite pure state entanglement and additivity properties of the bipartite relative entropy of entanglement. Our results pertain to the asymptotic limit of local manipulations on a large number of copies of the state. We show that additivity of the relative entropy would imply that there are at least two inequivalent types of asymptotic tripartite entanglement. The methods used include the application of some useful lemmas that enable us to analytically calculate the relative entropy for some classes of bipartite states.

arXiv:quant-ph/0008089•Journal of Physics A Mathematical and General•Nov 24, 2000•36 citations

Asymptotic Entanglement Manipulation of Bipartite Pure States

Garry Bowen, Nilanjana Datta

Entanglement of pure states of bipartite quantum systems has been shown to have a unique measure in terms of the von Neumann entropy of the reduced states of either of its subsystems. The measure is established under entanglement manipulation of an asymptotically large number of copies of the bipartite pure state. In this paper, two different asymptotic measures of entanglement for arbitrary sequences of bipartite pure states are established. These are shown to coincideonly whenthe sequence isinformation stable, in terms of the quantum spectral information rates of its corresponding sequence of subsystem states. Additional bounds on the optimal rates of entanglement manipulation protocols in quantum information theory are also presented. These include bounds given by generalizations of the coherent information bounds, Rains' bound, and the relative entropy of entanglement.

arXiv:quant-ph/0610199•IEEE Transactions on Information Theory•Jul 24, 2008•18 citations

Efficiency of deterministic entanglement transformation

Runyao Duan, Yuan Feng, Zhengfeng Ji +1 more

We prove that sufficiently many copies of a bipartite entangled pure state can always be transformed into some copies of another one with certainty by local quantum operations and classical communication. The efficiency of such a transformation is characterized by deterministic entanglement exchange rate, and it is proved to be always positive and bounded from top by the infimum of the ratios of Renyi's entropies of source state and target state. A careful analysis shows that the deterministic entanglement exchange rate cannot be increased even in the presence of catalysts. As an application, we show that there can be two incomparable states with deterministic entanglement exchange rate strictly exceeding 1.

arXiv:quant-ph/0410046•Physical Review A•Feb 10, 2005•5 citations

Entanglement monotones

Guifré Vidal

In the context of quantifying entanglement we study those functions of a multipartite state which do not increase under the set of local transformations. A mathematical characterization of these monotone magnitudes is presented. They are then related to optimal strategies of conversion of shared states. More detailed results are presented for pure states of bipartite systems. It is shown that more than one measure is required simultaneously in order to quantify completely the non-local resources contained in a bipartite pure state, while examining how this fact does not hold in the so-called asymptotic limit. Finally, monotonicity under local transformations is proposed as the only natural requirement for measures of entanglement.

arXiv:quant-ph/9807077•Journal of Modern Optics•Feb 1, 2000•821 citations

The Asymptotic Spectrum of LOCC Transformations

Asger Kjærulff Jensen, Péter Vrana

We study the exact, non-deterministic conversion of multipartite pure quantum states into one-another via local operations and classical communication (LOCC) and asymptotic entanglement transformation under such channels. In particular, we consider the maximal number of copies of any given target state that can be extracted exactly from many copies of any given initial state as a function of the exponential decay in the success probability, known as the converse error exponent. We give a formula for the optimal rate presented as an infimum over the asymptotic spectrum of LOCC conversion. A full understanding of exact asymptotic extraction rates between pure states in the converse regime thus depends on a full understanding of this spectrum. We present a characterization of spectral points and use it to describe the spectrum in the bipartite case. This leads to a full description of the spectrum and thus an explicit formula for the asymptotic extraction rate between pure bipartite states, given a converse error exponent. This extends the result on entanglement concentration in [1], where the target state is fixed as the Bell state. In the limit of vanishing converse error exponent, the rate formula provides an upper bound on the exact asymptotic extraction rate between two states, when the probability of success goes to 1. In the bipartite case, we prove that this bound holds with equality.

arXiv:1807.05130•IEEE Transactions on Information Theory•Jul 16, 2019•17 citations
We show that deterministic and conclusive transformation properties of bipartite entanglement in the nonasymptotic scenario (when many but a finite number of copies of a source state are collectively manipulated) are fundamentally different from those in both the single-copy and asymptotic limits. For instance, by generalizing the notion of local comparability of entanglement in the single-copy case, we provide a complete classification of bipartite entanglement transformations in the nonasymptotic scenario. We also show that, unlike the asymptotic case, collective operations need not always be advantageous for the many-copy case. In particular, we show that (1) there exists a class of states for which the optimal conclusive transformation probability decreases exponentially with increasing number of copies, even if the source state has more entropy of entanglement, and (2) optimal conclusive transformation probability need not be a monotonic function of the number of copies.
Hoping to simplify the classification of pure entangled states of multi $(m)\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ quantum systems, we study exactly and asymptotically (in n)n)n) reversible transformations among nthn\mathrm{th}nth tensor powers of such states (i.e., nnn copies of the state shared among the same mmm parties) under local quantum operations and classical communication (LOCC). For exact transformations, we show that two states whose marginal one-party entropies agree are either locally unitarily equivalent or else LOCC incomparable. In particular we show that two tripartite Greenberger-Horne-Zeilinger states are LOCC incomparable to three bipartite Einstein-Podolsky-Rosen (EPR) states symmetrically shared among the three parties. Asymptotic transformations yield a simpler classification than exact transformations; for example, they allow all pure bipartite states to be characterized by a single parameter---their partial entropy---which may be interpreted as the number of EPR pairs asymptotically interconvertible to the state in question by LOCC transformations. We show that $m\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ pure states having an $m\ensuremath{-}\mathrm{w}\mathrm{a}\mathrm{y}$ Schmidt decomposition are similarly parametrizable, with the partial entropy across any nontrivial partition representing the number of standard quantum superposition or ``cat'' states $|{0}^{\ensuremath{\bigotimes}m}〉+|{1}^{\ensuremath{\bigotimes}m}〉$ asymptotically interconvertible to the state in question. For general $m\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ states, partial entropies across different partitions need not be equal, and since partial entropies are conserved by asymptotically reversible LOCC operations, a multicomponent entanglement measure is needed, with each scalar component representing a different kind of entanglement, not asymptotically interconvertible to the other kinds. In particular we show that the m=4m=4m=4 cat state is not isentropic to, and therefore not asymptotically interconvertible to, any combination of bipartite and tripartite states shared among the four parties. Thus, although the m=4m=4m=4 cat state can be prepared from bipartite EPR states, the preparation process is necessarily irreversible, and remains so even asymptotically. For each number of parties mmm we define a minimal reversible entanglement generating set (MREGS) as a set of states of minimal cardinality sufficient to generate all $m\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ pure states by asymptotically reversible LOCC transformations. Partial entropy arguments provide lower bounds on the size of the MREGS, but for m>2m>2m>2 we know no upper bounds. We briefly consider several generalizations of LOCC transformations, including transformations with some probability of failure, transformations with the catalytic assistance of states other than the states we are trying to transform, and asymptotic LOCC transformations supplemented by a negligible [o(n)][o(n)][o(n)] amount of quantum communication.
We establish relations between tripartite pure state entanglement and additivity properties of the bipartite relative entropy of entanglement. Our results pertain to the asymptotic limit of local manipulations on a large number of copies of the state. We show that additivity of the relative entropy would imply that there are at least two inequivalent types of asymptotic tripartite entanglement. The methods used include the application of some useful lemmas that enable us to analytically calculate the relative entropy for some classes of bipartite states.
Entanglement of pure states of bipartite quantum systems has been shown to have a unique measure in terms of the von Neumann entropy of the reduced states of either of its subsystems. The measure is established under entanglement manipulation of an asymptotically large number of copies of the bipartite pure state. In this paper, two different asymptotic measures of entanglement for arbitrary sequences of bipartite pure states are established. These are shown to coincideonly whenthe sequence isinformation stable, in terms of the quantum spectral information rates of its corresponding sequence of subsystem states. Additional bounds on the optimal rates of entanglement manipulation protocols in quantum information theory are also presented. These include bounds given by generalizations of the coherent information bounds, Rains' bound, and the relative entropy of entanglement.
We prove that sufficiently many copies of a bipartite entangled pure state can always be transformed into some copies of another one with certainty by local quantum operations and classical communication. The efficiency of such a transformation is characterized by deterministic entanglement exchange rate, and it is proved to be always positive and bounded from top by the infimum of the ratios of Renyi's entropies of source state and target state. A careful analysis shows that the deterministic entanglement exchange rate cannot be increased even in the presence of catalysts. As an application, we show that there can be two incomparable states with deterministic entanglement exchange rate strictly exceeding 1.
In the context of quantifying entanglement we study those functions of a multipartite state which do not increase under the set of local transformations. A mathematical characterization of these monotone magnitudes is presented. They are then related to optimal strategies of conversion of shared states. More detailed results are presented for pure states of bipartite systems. It is shown that more than one measure is required simultaneously in order to quantify completely the non-local resources contained in a bipartite pure state, while examining how this fact does not hold in the so-called asymptotic limit. Finally, monotonicity under local transformations is proposed as the only natural requirement for measures of entanglement.
We study the exact, non-deterministic conversion of multipartite pure quantum states into one-another via local operations and classical communication (LOCC) and asymptotic entanglement transformation under such channels. In particular, we consider the maximal number of copies of any given target state that can be extracted exactly from many copies of any given initial state as a function of the exponential decay in the success probability, known as the converse error exponent. We give a formula for the optimal rate presented as an infimum over the asymptotic spectrum of LOCC conversion. A full understanding of exact asymptotic extraction rates between pure states in the converse regime thus depends on a full understanding of this spectrum. We present a characterization of spectral points and use it to describe the spectrum in the bipartite case. This leads to a full description of the spectrum and thus an explicit formula for the asymptotic extraction rate between pure bipartite states, given a converse error exponent. This extends the result on entanglement concentration in [1], where the target state is fixed as the Bell state. In the limit of vanishing converse error exponent, the rate formula provides an upper bound on the exact asymptotic extraction rate between two states, when the probability of success goes to 1. In the bipartite case, we prove that this bound holds with equality.