I show that two distant parties can transform pure entangled states to arbitrary pure states by stochastic local operations and classical communication (SLOCC) at the single copy level, if they share bound entangled states. This is the effect of bound entanglement since this entanglement processing is impossible by SLOCC alone. A similar effect of bound entanglement exists in three qubits where two incomparable entangled states of GHZ (Greenberger, Horne, and Zeilinger) and W can be interconverted. In general, multipartite settings composed by N distant parties, all N-partite pure entangled states are interconvertible by SLOCC with the assistance of bound entangled states with positive partial transpose.
I show that bound entanglement strongly influences the quantum entanglement processing of pure states: If N distant parties share appropriate bound entangled states with positive partial transpose, all N‐partite pure entangled states become inter‐convertible by stochastic local operations and classical communication (SLOCC) at the single copy level. This implies that the Schmidt rank of a bipartite pure entangled state can be increased, and that two incomparable tripartite entanglement of the GHZ and W type can be inter‐converted by the assistance of bound entanglement. Further, I propose the simplest experimental scheme for the demonstration of the corresponding bound‐entanglement‐assisted SLOCC. This scheme does not need quantum gates and is feasible for the current experimental technology of linear optics.
We studied pure state transformations using local operations assisted by finitely many rounds of classical communication (
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 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). 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. 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 and show how easily computable bounds on some entanglement measures can be derived by restricting to
LOCCIN.
The primary goals of this thesis are two-fold: i) calculating the optimal entanglement transformation rate between two multipartite pure states via stochastic local operations and classical communication (SLOCC), and ii) showing the properties of a common resource for a set of multi-partite pure state via local operations and classical communication (LOCC) or SLOCC.We introduce a notion of entanglement transformation rate to characterize the asymptotic comparability of two multi-partite pure entangled states under SLOCC.For two well known SLOCC inequivalent three-qubit states: Greenberger-Horne-Zeilinger (GHZ) state and W state, we show that the entanglement transformation rate from GHZ state to W state is exactly 1.We then apply similar techniques to obtain a lower bound on the entanglement transformation rates from an N -partite GHZ state to a class of Dicke states.Then, we discuss the common resource for a set of pure states.We have completely solved the bipartite pure states case by explicitly constructing a unique optimal common resource state for any given set of states via LOCC.In the multi-partite setting, the general problem becomes quite complicated, and we focus on finding non-trivial common resources for the whole multi-partite state space of given dimensions.We show thatis a nontrivial common resource for three-qubit systems via LOCC.We also obtain a number of interesting properties of non-trivial common resource states for two N -qubit pure states and multi-partite systems via SLOCC.
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.