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

Communications in Theoretical Physics

Simple Procedure for Entanglement Transformation of Bipartite Pure States

Chun-Wang Wu, Ping‐Xing Chen, Cheng-Zu Li

Published Mar 1, 2008• 0 citations
Publisher

Abstract

An explicit procedure for transforming one bipartite entangled state into another via local operations and classical communication (LOCC) is presented. Our procedure is much simper than the previous ones in the sense that, it only involves two steps and the explicit expression of local general measurement used in the procedure can be obtained by solving a set of linear equations. Furthermore, this procedure is still applicable in high dimensional case.

DOI
10.1088/0253-6102/49/3/28

Related papers

Algorithm for entanglement transformation of pure states

Yongming Li

The quantum entanglement is the necessary resource,which could realize some quantum tasks.It is very important to study the algorithm for the entanglement transformation between the quantum states determinately or probability.An algorithm first is presented that transforms one pure bipartite quantum state into a mixed bipartite by Local Operations and Classical Communication(LOCC),this algorithm is much simpler than the original algorithm.The algorithm for the transformation between two pure bipartite states with catalysis by LOCC is then discussed.

Computer Engineering and Applications Journal•Jan 1, 2008•0 citations

Approximate and ensemble local entanglement transformations for multipartite states

David Gunn, Martin Hebenstreit, Cornelia Spee +2 more

Understanding multipartite entanglement is a key goal in quantum information. Entanglement in pure states can be characterized by considering transformations under local operations assisted by classical communication (LOCC). However, it has been shown that, for $n\ensuremath{\ge}5$ parties, multipartite pure states are generically isolated, i.e., they can be neither reached nor transformed under LOCC. Nonetheless, in any real laboratory, one never deterministically transforms a pure initial state exactly to a pure target state. Instead, one transforms a mixed state near the initial state to an ensemble that is on average close to the target state. This motivates studying approximate LOCC transformations. After reviewing in detail the known results in the bipartite case, we present the gaps that remain open in the multipartite case. While the analysis of the multipartite setting is much more technically involved due to the existence of different stochastic LOCC (SLOCC) classes, certain features simplify in the approximate setting. In particular, we show that it is sufficient to consider pure initial states, that it is sufficient to consider LOCC protocols with finitely many rounds of communication, and that approximate transformations can be approximated by ensemble transformations within an SLOCC class. Then we formally define a hierarchy of different forms of approximate transformations that are relevant from a physical point of view. Whereas this hierarchy collapses in the bipartite case, we show that this is not the case for the multipartite setting, which is fundamentally richer. To wit, we show that optimal multipartite approximate transformations are not generally deterministic, that ensemble transformations within an SLOCC class can achieve a higher fidelity than deterministic transformations within an SLOCC class, and that there are approximate transformations with no deterministic transformations nearby.

arXiv:2307.05192•Physical Review A•Nov 1, 2023•1 citation

Entanglement manipulation of multipartite pure states with finite rounds of classical communication

Julio I. de Vicente, Cornelia Spee, David Sauerwein +1 more

We studied pure state transformations using local operations assisted by finitely many rounds of classical communication (${\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}$) [C. Spee, J. I. de Vicente, D. Sauerwein, and B. Kraus [Phys. Rev. Lett. (to be published)], arXiv:1606.04418]. Here, we present the details of some of the proofs and generalize the construction of examples of state transformations via ${\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}$ which require a probabilistic step. However, we also present explicit examples of SLOCC classes where any separable transformation can be realized by a protocol in which each step is deterministic (all-det-${\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}$). Such transformations can be considered as natural generalizations of bipartite transformations. Furthermore, we provide examples of pure state transformations which are possible via separable transformations, but not via ${\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}$. We also analyze an interesting genuinely multipartite effect which we call locking or unlocking the power of other parties. This means that one party can prevent or enable the implementation of LOCC transformations by other parties. Moreover, we investigate the maximally entangled set restricted to ${\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}$ and show how easily computable bounds on some entanglement measures can be derived by restricting to ${\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}$.

arXiv:1607.05145•Physical Review A•Jan 23, 2017•56 citations

Approximate transformations and robust manipulation of bipartite pure-state entanglement

Guifré Vidal, Daniel Jonathan, Michael A. Nielsen

We analyze approximate transformations of pure entangled quantum states by local operations and classical communication, finding explicit conversion strategies which optimize the fidelity of transformation. These results allow us to determine the most faithful teleportation strategy via an initially shared partially entangled pure state. They also show that procedures for entanglement manipulation such as entanglement catalysis [Jonathan and Plenio, Phys. Rev. Lett. 83, 3566 (1999)] are robust against perturbation of the states involved, and motivate the notion of nonlocal fidelity, which quantifies the difference in the entangled properties of two quantum states.

arXiv:quant-ph/9910099•Physical Review A•Jun 12, 2000•138 citations

Entangled Pure State Transformations via Local Operations Assisted by Finitely Many Rounds of Classical Communication

Cornelia Spee, Julio I. de Vicente, David Sauerwein +1 more

We consider generic pure n-qubit states and a general class of pure states of arbitrary dimensions and arbitrarily many subsystems. We characterize those states which can be reached from some other state via local operations assisted by finitely many rounds of classical communication (LOCC_{N}). For n qubits with n>3, we show that this set of states is of measure zero, which implies that the maximally entangled set is generically of full measure if restricted to the practical scenario of LOCC_{N}. Moreover, we identify a class of states for which any LOCC_{N} protocol can be realized via a concatenation of deterministic steps. We show, however, that in general there exist state transformations which require a probabilistic step within the protocol, which highlights the difference between bipartite and multipartite LOCC.

arXiv:1606.04418•Physical Review Letters•Jan 27, 2017•65 citations

Partial recovery of entanglement in bipartite-entanglement transformations

Somshubhro Bandyopadhyay, Vwani Roychowdhury, Farrokh Vatan

Any deterministic bipartite-entanglement transformation involving finite copies of pure states and carried out using local operations and classical communication (LOCC) results in a net loss of entanglement. We show that for almost all such transformations, partial recovery of lost entanglement is achievable by using $2\ifmmode\times\else\texttimes\fi{}2$ auxiliary entangled states, no matter how large the dimensions of the parent states are. For the rest of the special cases of deterministic LOCC transformations, we show that the dimension of the auxiliary entangled state depends on the presence of equalities in the majorization relations of the parent states. We show that genuine recovery is still possible using auxiliary states in dimensions less than that of the parent states for all patterns of majorization relations except only one special case.

arXiv:quant-ph/0105019•Physical Review A•Apr 10, 2002•10 citations
An explicit procedure for transforming one bipartite entangled state into another via local operations and classical communication (LOCC) is presented. Our procedure is much simper than the previous ones in the sense that, it only involves two steps and the explicit expression of local general measurement used in the procedure can be obtained by solving a set of linear equations. Furthermore, this procedure is still applicable in high dimensional case.
The quantum entanglement is the necessary resource,which could realize some quantum tasks.It is very important to study the algorithm for the entanglement transformation between the quantum states determinately or probability.An algorithm first is presented that transforms one pure bipartite quantum state into a mixed bipartite by Local Operations and Classical Communication(LOCC),this algorithm is much simpler than the original algorithm.The algorithm for the transformation between two pure bipartite states with catalysis by LOCC is then discussed.
Understanding multipartite entanglement is a key goal in quantum information. Entanglement in pure states can be characterized by considering transformations under local operations assisted by classical communication (LOCC). However, it has been shown that, for $n\ensuremath{\ge}5$ parties, multipartite pure states are generically isolated, i.e., they can be neither reached nor transformed under LOCC. Nonetheless, in any real laboratory, one never deterministically transforms a pure initial state exactly to a pure target state. Instead, one transforms a mixed state near the initial state to an ensemble that is on average close to the target state. This motivates studying approximate LOCC transformations. After reviewing in detail the known results in the bipartite case, we present the gaps that remain open in the multipartite case. While the analysis of the multipartite setting is much more technically involved due to the existence of different stochastic LOCC (SLOCC) classes, certain features simplify in the approximate setting. In particular, we show that it is sufficient to consider pure initial states, that it is sufficient to consider LOCC protocols with finitely many rounds of communication, and that approximate transformations can be approximated by ensemble transformations within an SLOCC class. Then we formally define a hierarchy of different forms of approximate transformations that are relevant from a physical point of view. Whereas this hierarchy collapses in the bipartite case, we show that this is not the case for the multipartite setting, which is fundamentally richer. To wit, we show that optimal multipartite approximate transformations are not generally deterministic, that ensemble transformations within an SLOCC class can achieve a higher fidelity than deterministic transformations within an SLOCC class, and that there are approximate transformations with no deterministic transformations nearby.
We studied pure state transformations using local operations assisted by finitely many rounds of classical communication (LOCCIN{\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}LOCCIN​) [C. Spee, J. I. de Vicente, D. Sauerwein, and B. Kraus [Phys. Rev. Lett. (to be published)], arXiv:1606.04418]. Here, we present the details of some of the proofs and generalize the construction of examples of state transformations via LOCCIN{\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}LOCCIN​ which require a probabilistic step. However, we also present explicit examples of SLOCC classes where any separable transformation can be realized by a protocol in which each step is deterministic (all-det-LOCCIN{\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}LOCCIN​). Such transformations can be considered as natural generalizations of bipartite transformations. Furthermore, we provide examples of pure state transformations which are possible via separable transformations, but not via LOCCIN{\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}LOCCIN​. We also analyze an interesting genuinely multipartite effect which we call locking or unlocking the power of other parties. This means that one party can prevent or enable the implementation of LOCC transformations by other parties. Moreover, we investigate the maximally entangled set restricted to LOCCIN{\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}LOCCIN​ and show how easily computable bounds on some entanglement measures can be derived by restricting to LOCCIN{\text{LOCC}}_{I\phantom{\rule{-0.30em}{0ex}}N}LOCCIN​.
We analyze approximate transformations of pure entangled quantum states by local operations and classical communication, finding explicit conversion strategies which optimize the fidelity of transformation. These results allow us to determine the most faithful teleportation strategy via an initially shared partially entangled pure state. They also show that procedures for entanglement manipulation such as entanglement catalysis [Jonathan and Plenio, Phys. Rev. Lett. 83, 3566 (1999)] are robust against perturbation of the states involved, and motivate the notion of nonlocal fidelity, which quantifies the difference in the entangled properties of two quantum states.
We consider generic pure n-qubit states and a general class of pure states of arbitrary dimensions and arbitrarily many subsystems. We characterize those states which can be reached from some other state via local operations assisted by finitely many rounds of classical communication (LOCC_{N}). For n qubits with n>3, we show that this set of states is of measure zero, which implies that the maximally entangled set is generically of full measure if restricted to the practical scenario of LOCC_{N}. Moreover, we identify a class of states for which any LOCC_{N} protocol can be realized via a concatenation of deterministic steps. We show, however, that in general there exist state transformations which require a probabilistic step within the protocol, which highlights the difference between bipartite and multipartite LOCC.
Any deterministic bipartite-entanglement transformation involving finite copies of pure states and carried out using local operations and classical communication (LOCC) results in a net loss of entanglement. We show that for almost all such transformations, partial recovery of lost entanglement is achievable by using $2\ifmmode\times\else\texttimes\fi{}2$ auxiliary entangled states, no matter how large the dimensions of the parent states are. For the rest of the special cases of deterministic LOCC transformations, we show that the dimension of the auxiliary entangled state depends on the presence of equalities in the majorization relations of the parent states. We show that genuine recovery is still possible using auxiliary states in dimensions less than that of the parent states for all patterns of majorization relations except only one special case.