arXiv:1310.3244 · Journal of Mathematical Physics

Asymptotic entanglement transformation between W and GHZ states

Péter Vrana, Matthias Christandl

Published Feb 1, 2015• 44 citations

Abstract

We investigate entanglement transformations with stochastic local operations and classical communication in an asymptotic setting using the concepts of degeneration and border rank of tensors from algebraic complexity theory. Results well-known in that field imply that GHZ states can be transformed into W states at rate 1 for any number of parties. As a generalization, we find that the asymptotic conversion rate from GHZ states to Dicke states is bounded as the number of subsystems increases and the number of excitations is fixed. By generalizing constructions of Coppersmith and Winograd and by using monotones introduced by Strassen, we also compute the conversion rate from W to GHZ states.

DOI: 10.1063/1.4908106

Related papers

Obtaining a W State from a Greenberger-Horne-Zeilinger State via Stochastic Local Operations and Classical Communication with a Rate Approaching Unity

Nengkun Yu, Cheng Guo, Runyao Duan

We introduce a notion of the entanglement transformation rate to characterize the asymptotic comparability of two multipartite pure entangled states under stochastic local operations and classical communication (SLOCC). For two well known SLOCC inequivalent three-qubit states |GHZ⟩=(1/2)(|000⟩+|111⟩) and |W⟩=(1/3)(|100⟩+|010⟩+|001⟩), we show that the entanglement transformation rate from |GHZ⟩ to |W⟩ is exactly 1. That means that we can obtain one copy of the W state from one copy of the Greenberg-Horne-Zeilinger (GHZ) state by SLOCC, asymptotically. 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, and prove the tightness of this bound for some special cases which naturally generalize the |W⟩ state. A new lower bound on the tensor rank of the matrix permanent is also obtained by evaluating the tensor rank of Dicke states.

arXiv:1309.4833Physical Review LettersApr 21, 201465 citations

Error Exponents for Entanglement Transformations From Degenerations

Dávid Bugár, Péter Vrana

This paper explores the trade-off relation between the rate and the strong converse exponent for asymptotic LOCC transformations between pure multipartite states. Any single-copy probabilistic transformation between a pair of states implies that an asymptotic transformation at rate 1 is possible with an exponentially decreasing success probability. However, it is possible that an asymptotic transformation is feasible with nonzero probability, but there is no transformation between any finite number of copies with the same rate, even probabilistically. In such cases it is not known if the optimal success probability decreases exponentially or faster. A fundamental tool for showing the feasibility of an asymptotic transformation is degeneration. Any degeneration gives rise to a sequence of stochastic LOCC transformations from copies of the initial state plus a sublinear number of GHZ states to the same number of copies of the target state. These protocols involve parameters that can be freely chosen, but the choice affects the success probability. In this paper, we characterize an asymptotically optimal choice of the parameters and derive a single-letter expression for the error exponent of the resulting protocol. In particular, this implies an exponential lower bound on the success probability when the stochastic transformation arises from a degeneration.

arXiv:2409.01130IEEE Transactions on Information TheoryJan 27, 20251 citation

Bounds on probability of transformations between multipartite pure states

Wei Cui, Wolfram Helwig, Hoi‐Kwong Lo

For a tripartite pure state of three qubits, it is well known that there are two inequivalent classes of genuine tripartite entanglement, namely the Greenberger-Horne-Zeilinger (GHZ) class and the W class. Any two states within the same class can be transformed into each other with stochastic local operations and classical communication with a nonzero probability. The optimal conversion probability, however, is only known for special cases. Here, lower and upper bounds are derived for the optimal probability of transformation from a GHZ state to other states of the GHZ class. A key idea in the derivation of the upper bounds is to consider the action of the local operations and classical communications (LOCC) protocol on a different input state, namely $1/\sqrt{2}[|000\ensuremath{\rangle}\ensuremath{-}|111\ensuremath{\rangle}]$, and to demand that the probability of an outcome remains bounded by 1. We also find an upper bound for more general cases by using the constraints of the so-called interference term and 3-tangle. Moreover, some of the results are generalized to the case in which each party holds a higher dimensional system. In particular, the GHZ state generalized to three qutrits; that is, $|{\mathrm{GHZ}}_{3}\ensuremath{\rangle}=1/\sqrt{3}[|000\ensuremath{\rangle}+|111\ensuremath{\rangle}+|222\ensuremath{\rangle}]$ shared among three parties can be transformed to any tripartite three-qubit pure state with probability 1 via LOCC. Some of our results can also be generalized to the case of a multipartite state shared by more than three parties.

arXiv:0910.3295Physical Review AJan 19, 201013 citations

Persistent Tensors and Multiqudit Entanglement Transformation

Masoud Gharahi, Vladimir Lysikov

We construct a lower bound of the tensor rank for a new class of tensors, which we call persistent tensors . We present three specific families of persistent tensors, of which the lower bound is tight. We show that there is a chain of degenerations between these three families of minimal-rank persistent tensors that can be used to study the entanglement transformation between them. In addition, we show that these three families of persistent tensors are indeed different generalizations of multiqubit W states within multiqudit systems and are geometrically in the orbit closure of multiqudit GHZ states. Consequently, we show that one can obtain every one of the generalizations of W state from a multiqudit GHZ state via asymptotic Stochastic Local Operations and Classical Communication (SLOCC) with rate one. Finally, we extend the obtained lower bound of the tensor rank to direct sums with persistent summands and to even more general combinations of tensors, which we call block pyramidal tensors . As a result, we show that the tensor rank is multiplicative under the Kronecker and tensor products of minimal-rank persistent tensors with the GHZ tensor.

arXiv:2211.00652QuantumJan 31, 20242 citations

Tripartite Entanglement Transformations and Tensor Rank

Eric Chitambar, Runyao Duan, Yaoyun Shi

A basic question regarding quantum entangled states is whether one can be probabilistically converted to another through local operations and classical communication exclusively. While the answer for bipartite systems is known, we show that for tripartite systems, this question encodes some of the most challenging open problems in mathematics and computer science. In particular, we show that there is no easy general criterion to determine the feasibility, and in fact, the problem is NP hard. In addition, we find obtaining the most efficient algorithm for matrix multiplication to be precisely equivalent to determining the maximum rate to convert the Greenberger-Horne-Zeilinger state to a triangular distribution of three EPR states. Our results are based on connections between multipartite entanglement and tensor rank (also called Schmidt rank), a key concept in algebraic complexity theory.

arXiv:0805.2977Physical Review LettersOct 2, 200874 citations

Error exponents for tripartite-to-bipartite entanglement transformations

Péter Vrana

We consider distillation of ebits between a specified pair of subsystems from pure tripartite states by local operations and classical communication. It is known that, allowing an asymptotically vanishing error, the maximal rate is the minimum of the von Neumann entropies of the two corresponding marginals, and under asymptotic stochastic local operations and classical communication the maximal rate is given by a minimization over a one-parameter family of entanglement measures. In this paper, we determine the direct and strong converse error exponents, and the optimal rate for deterministic transformations.

arXiv:2507.13778Jul 18, 20250 citations