For a multipartite system, we sort out all possible entanglements, each of which is among a set of subsystems. Each entanglement can be measured by a generalized relative entropy of entanglement, which is conserved on average under reversible local operations and classical communication (LOCC) defined for all the parties. Then we derive a series of inequalities of different entanglements that have to be satisfied by any pure state which can be generated by reversible LOCC from the set of all GHZ-like states.
Recently using entanglement as resource to distinguish orthogonal product states by local operations and classical communication (LOCC) has been studied intensively. Zhang. et al. presented protocols to use entanglement to distinguish certain classes of orthogonal product states in $\mathbb{C}^m\otimes \mathbb{C}^n$\cite{Zhang016}. In this paper, we study local distinguishability of multipartite orthogonal product states and provide a practical solution. Our method relies upon a special class of locally indistinguishable multipartite product states introduced by Wang et. al. to build a protoco…
Reversible state transformations under entanglement non-increasing operations give rise to entanglement measures. It is well known that asymptotic local operations and classical communication (LOCC) are required to get a simple operational measure of bipartite pure state entanglement. For bipartite mixed states and multipartite pure states it is likely that a more powerful class of operations will be needed. To this end \cite{BPRST01} have defined more powerful versions of state transformations (or reducibilities), namely LOCCq (asymptotic LOCC with a sublinear amount of quantum communication)…
Using graphs and hypergraphs to systematically model collections of arbitrary subsets of parties representing {\it ensembles (or collections)} of shared multipartite CAT states, we study transformations between such {\it ensembles} under {\it local operations and classical communication (LOCC)}. We show using partial entropic criteria, that any two such distinct ensembles represented by {\it $r$-uniform hypergraphs} with the same number of hyperedges (CAT states), are LOCC incomparable for even integers $r\geq 2$, generalizing results in \cite{mscthesis,sin:pal:kum:sri}. We show that the cardi…
Understanding multipartite entanglement is vital, as it underpins a wide range of phenomena across physics. The study of transformations of states via Local Operations assisted by Classical Communication (LOCC) allows one to quantitatively analyse entanglement, as it induces a partial order in the Hilbert space. However, it has been shown that, for systems with fixed local dimensions, this order is generically trivial, which prevents relating multipartite states to each other with respect to any entanglement measure. In order to obtain a non-trivial partial ordering, we study a physically moti…
Local operations assisted by classical communication (LOCC) constitute the free operations in entanglement theory. Hence, the determination of LOCC transformations is crucial for the understanding of entanglement. We characterize here almost all LOCC transformations among pure multipartite multilevel states. Combined with the analogous results for qubit states shown by Gour \emph{et al.} [J. Math. Phys. 58, 092204 (2017)], this gives a characterization of almost all local transformations among multipartite pure states. We show that nontrivial LOCC transformations among generic, fully entangled…
We discuss the monotonicity under local operations and classical communication (LOCC) of systematically constructed quantities aiming at quantification of entanglement properties of multipartite quantum systems. The so-called generalized multipartite concurrences can qualify as legitimate entanglement measures if they are monotonous under LOCC. In the paper we give a necessary and sufficient criterion for their monotonicity.
Multipartite quantum correlations, in spite of years of intensive research, still leave many questions unanswered. While bipartite entanglement is relatively well understood for Gaussian states, the complexity of mere qualitative characterization grows rapidly with increasing number of parties. Here, we present two schemes for transformations of multipartite permutation invariant Gaussian states by Gaussian local operations and classical communication. To this end, we use a scheme for possible experimental realization, making use of the fact, that in this picture, the whole N - partite state c…
We studied pure state transformations using local operations assisted by finitely many rounds of classical communication ($LOCC_{\mathbb{N}}$) in C. Spee, J.I. de Vicente, D. Sauerwein, B. Kraus, arXiv:1606.04418 (2016). Here, we first of all present the details of some of the proofs and generalize the construction of examples of state transformations via $LOCC_{\mathbb{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-$LOCC_{\mathbb{N…
We can only perform a finite rounds of measurements in protocols with local operations and classical communication (LOCC). In this paper, we propose a set of product states, which require infinite rounds of measurements in order to distinguish this given set of states perfectly by LOCC. Therefore, we can conclude that these sets of states are locally indistinguishable. More accurately, given any multipartite LOCC indistinguishable set where every local system cannot start with a nontrivial measurement, then after appending these states with arbitrarily choosing two nonorthogonal states, we obt…
Characterizing the transformation and classification of multipartite entangled states is a basic problem in quantum information. We study the problem under two most common environments, local operations and classical communications (LOCC), stochastic LOCC and two more general environments, multi-copy LOCC (MCLOCC) and multi-copy SLOCC (MCSLOCC). We show that two transformable multipartite states under LOCC or SLOCC are also transformable under MCLOCC and MCSLOCC. What's more, these two environments are equivalent in the sense that two transformable states under MCLOCC are also transformable un…
Entanglement is a resource in quantum information theory when state manipulation is restricted to Local Operations assisted by Classical Communication (LOCC). It is therefore of paramount importance to decide which LOCC transformations are possible and, particularly, which states are maximally useful under this restriction. While the bipartite maximally entangled state is well known (it is the only state that cannot be obtained from any other and, at the same time, it can be transformed to any other by LOCC), no such state exists in the multipartite case. In order to cope with this fact, we in…
We provide a necessary condition that a quantum measurement can be implemented by the class of protocols known as Local Operations and Classical Communication, or LOCC, including when an error is allowed but must vanish in the limit of an infinite number of rounds, a case referred to as asymptotic LOCC. Our condition unifies, extends, and provides an intuitive, geometric justification for previous results on asymptotic LOCC. We use our condition to answer a variety of long-standing, unsolved problems, including for distinguishability of certain sets of states by LOCC. These include various cla…
Global versus Local Discrimination of Locally Implementable Multipartite Unitaries
Indian Institute of Science Education and Research Thiruvananthapuram（印度科学教育研究所特里凡得琅分校）；Indian Institute of Technology Bhubaneswar（印度技术学院布巴内斯瓦尔分校）；S. N. Bose National Centre for Basic Sciences（S.N. 玻色基础科学国家中心）
We investigate how much amount of Greenberger-Horne-Zeilinger (GHZ) entanglement is required in order to prepare a given multipartite state by local operations and classical communication (LOCC).We present a LOCC procedure that asymptotically converts GHZ states into an arbitrary multipartite pure state, whose conversion rate is given by the multipartite discord of the state. This reveals that the GHZ-entanglement cost of preparing a pure state is not higher than the multipartite discord of the state. It also provides an operational interpretation of multipartite discord for pure states, namel…
We provide a method of designing protocols for implementing multipartite quantum measurements when the parties are restricted to local operations and classical communication (LOCC). For each finite integer number of rounds, $r$, the method succeeds in every case for which an $r$-round protocol exists for the measurement under consideration, and failure of the method has the immediate implication that the measurement under consideration cannot be implemented by LOCC no matter how many rounds of communication are allowed, including when the number of rounds is allowed to be infinite. It turns ou…
Entanglement theory is formulated as a quantum resource theory in which the free operations are local operations and classical communication (LOCC). This defines a partial order among bipartite pure states that makes it possible to identify a maximally entangled state, which turns out to be the most relevant state in applications. However, the situation changes drastically in the multipartite regime. Not only do there exist inequivalent forms of entanglement forbidding the existence of a unique maximally entangled state, but recent results have shown that LOCC induces a trivial ordering: almos…
Multipartite quantum entanglement serves as a resource for spatially separated parties performing distributed quantum information processing. Any multipartite entangled state can be generated from appropriately distributed bipartite entangled states by local operations and classical communication (LOCC), and in this sense, any distributed process based on shared multipartite entanglement and LOCC is simulatable by using only bipartite entangled states and LOCC. We show here that this reduction scenario does not hold when there exists a limitation on the size of the local quantum system of each…
Recently, the problem of discriminating multipartite unitary operations by local operations and classical communication (LOCC) has attracted significant attention. The latest work in the literature on this problem showed that two multipartite unitary operations can always be perfectly distinguished by LOCC when a finite number of runs are allowable. However, in these schemes, local entanglement (an entangled state holden by one party) was required, which seems to imply that local entanglement is necessary for perfect discrimination between unitary operations by LOCC. In this article, we show t…
We provide a method for checking indistinguishability of a set of multipartite orthogonal states by local operations and classical communication (LOCC). It bases on the principle of nonincreasing of entanglement under LOCC. This method originates from the one introduced by Ghosh \emph{et al.} (Phys. Rev. Lett. \textbf{87}, 5807 (2001) (quant-ph/0106148)), though we deal with {\emph pure} states. In the bipartite case, our method is operational, although we do not know whether it can always detect local indistinguishability. We apply our method to show that an arbitrary complete multipartite or…
We develop graph theoretic methods for analysing maximally entangled pure states distributed between a number of different parties. We introduce a technique called {\it bicolored merging}, based on the monotonicity feature of entanglement measures, for determining combinatorial conditions that must be satisfied for any two distinct multiparticle states to be comparable under local operations and classical communication (LOCC). We present several results based on the possibility or impossibility of comparability of pure multipartite states. We show that there are exponentially many such entangl…
In this letter, we show the impossibility of the general operation introduced by Pati [3] using two different but consistent principles (i) no-signalling (ii) non increase of entanglement under LOCC.
In this paper, we mainly study the local distinguishable multipartite quantum states by local operations and classical communication (LOCC) in $m_1\otimes m_2\otimes\ldots\otimes m_n$ , where the quantum system $m_1$ belongs to Alice, $m_2$ belongs to Bob, \ldots and $m_n$ belongs to Susan. We first present the pure tripartite distinguishable orthogonal quantum states by LOCC in $m_1\otimes m_2\otimes m_3$. With the conclusion in $m_1\otimes m_2\otimes m_3$, we prove distinguishability or indistinguishability of some quantum states. At last, we give the $n$-party distinguishable quantum states…
It is shown that while entanglement remains a significant factor in discriminating a set of mutually orthogonal entangled states perfectly by local operations and classical communication (LOCC), entanglement content is not. In particular, for a class of entangled multi-qubit states, the maximum number of perfectly LOCC distinguishable orthogonal states is shown to be independent of the average entanglement of the states, and the spatial configuration with respect to which LOCC operations may be carried out. It is also pointed out that the make-up of an ensemble, that is, whether it consists on…
We explore the question of using an entangled state as a universal resource for implementing quantum measurements by local operations and classical communication (LOCC). We show that for most systems consisting of three or more subsystems, there is no entangled state from the same space that can enable all measurements by LOCC. This is in direct contrast to the bipartite case, where a maximally entangled state is an universal resource. Our results are obtained showing an equivalence between the problem of local state transformation and that of entanglement-assisted local unambiguous state disc…
When a quantum system is distributed to spatially separated parties, it is natural to consider how the system evolves when the parties perform local quantum operations with classical communication (LOCC). However, the structure of LOCC channels is exceedingly complex leaving many important physical problems unsolved. In this paper we consider generalized resource theories of entanglement based on different relaxations to the class of LOCC. The behavior of various entanglement measures is studied under non-entangling channels, as well as the newly introduced classes of dually non-entangling and…
We prove that there is a trade-off relation between the entanglement cost and the number of rounds of communication, for two distant parties to accomplish a bidirectional quantum information task by local operations and classical communication (LOCC). We consider an implementation of a class of two-qubit controlled-unitary gate by LOCC assisted by shared entanglement, in an information theoretical scenario of asymptotically many input pairs and vanishingly small error. We prove the trade-off relation by showing that one ebit of entanglement per pair is necessary to be consumed for implementing…
A necessary and sufficient condition of the possibility of a deterministic local operations and classical communication (LOCC) transformation of three-qubit pure states is given. The condition shows that the three-qubit pure states are a partially ordered set parametrized by five well-known entanglement parameters and a novel parameter; the five are the concurrences $C_{AB}$, $C_{AC}$, $C_{BC}$, the tangle $τ_{ABC}$ and the fifth parameter $J_{5}$ of Ref. [18], while the other new one is the entanglement charge $Q_{e}$. The order of the partially ordered set is defined by the possibility of a …
We give a simple proof, based on time-reversibility and purity, that a complete orthonormal family of pure states which can be perfectly distinguished by LOCC cannot contain any entangled state. Our results are really about the shape of certain states and processes, and are valid in arbitrary categorical probabilistic theories with time-reversal. From the point of view of the resource theory of entanglement, our results can be interpreted to say that free processes can distinguish between the states in a complete orthonormal family only when the states themselves are all free.
We show that an arbitrary basis of a multipartite quantum state space consisting of $K$ distant parties such that the $k$th party has local dimension $d_k$ always contains at least $N=\sum_{k=1}^K (d_k-1)+1$ members that are unambiguously distinguishable using local operations and classical communication (LOCC). We further show this lower bound is optimal by analytically constructing a special product basis having only $N$ members unambiguously distinguishable by LOCC. Interestingly, such a special product basis not only gives a stronger form of the weird phenomenon ``nonlocality without entan…
We construct the protocols to achieve probabilistic and deterministic entanglement transformations for bipartite pure states by means of local operations and classical communication. A new condition on pure contraction transformations is provided.
Entanglement is the resource to overcome the natural limitations of spatially separated parties restricted to Local Operations assisted by Classical Communications (LOCC). Recently two new classes of operational entanglement measures, the source and the accessible entanglement, for arbitrary multipartite states have been introduced. Whereas the source entanglement measures from how many states the state of interest can be obtained via LOCC, the accessible entanglement measures how many states can be reached via LOCC from the state at hand. We consider here pure bipartite as well as multipartit…
The paper [Phys. Lett. A 373 (2009) 3610] by D.-C. Li analyzes the transformation between two-qubit mixed states by local operations and classical communication. We show that the proof of the main theorem, Theorem 2.6 in [Phys. Lett. A 373 (2009) 3610] is not complete. Therefore the generalization of Nielsen's theorem to mixed states still remains an open problem.
Non existence of Universal NOT gate for arbitrary quantum mechanical states is a fundamental constraint on the allowed operations performed on physical systems. The largest set of states that can be flipped by using a single NOT gate is the set of states lying on a great circle of the Bloch-sphere. In this paper, we show the impossibility of universal exact-flipping operation, first by using the fact that no faster than light communication is possible and then by using the principle of "non-increase of entanglement under LOCC". Interestingly, exact flipping of the states of any great circle do…
A strong entanglement monotone, which never increases under local operations and classical communications (LOCC), restricts quantum entanglement manipulation more strongly than the usual monotone since the usual one does not increase on average under LOCC. We propose new strong monotones in mixed-state entanglement manipulation under LOCC. These are related to the decomposability and 1-positivity of an operator constructed from a quantum state, and reveal geometrical characteristics of entangled states. These are lower bounded by the negativity or generalized robustness of entanglement.
In an effort to simplify the classification of pure entangled states of multi (m) -partite quantum systems, we study exactly and asymptotically (in n) reversible transformations among n'th tensor powers of such states (ie n copies of the state shared among the same m parties) under local quantum operations and classical communication (LOCC). With regard to exact transformations, we show that two states whose 1-party entropies agree are either locally-unitarily (LU) equivalent or else LOCC-incomparable. In particular we show that two tripartite Greenberger-Horne-Zeilinger (GHZ) states are LOCC-…
In this paper, we construct $2n-1$ locally indistinguishable orthogonal product states in $\mathbb{C}^n\otimes\mathbb{C}^{4}~(n>4)$ and $\mathbb{C}^n\otimes\mathbb{C}^{5}~(n\geq 5)$ respectively. Moreover, a set of locally indistinguishable orthogonal product states with $2(n+2l)-8$ elements in $\mathbb{C}^n\otimes\mathbb{C}^{2l}~(n\geq 2l>4)$ and a class of locally indistinguishable orthogonal product states with $2(n+2k+1)-7$ elements in $\mathbb{C}^n\otimes\mathbb{C}^{2k+1}~(n\geq 2k+1>5)$ are also constructed respectively. These classes of quantum states are then shown to be distinguishabl…
Entanglement is a resource to overcome the natural restriction of operations used for state manipulation to Local Operations assisted by Classical Communication (LOCC). Hence, a bipartite maximally entangled state is a state which can be transformed deterministically into any other state via LOCC. In the multipartite setting no such state exists. There, rather a whole set, the Maximally Entangled Set of states (MES), which we recently introduced, is required. This set has on the one hand the property that any state outside of this set can be obtained via LOCC from one of the states within the …
The quantification and classification of quantum entanglement is a very important and still open question of quantum information theory. In this paper, we describe an entanglement measure for multipartite pure states (the minimum of Shannon's entropy of orthogonal measurements). This measure is additive, monotone under LOCC, and coincides with the reduced von Neumann entropy on bipartite states. A method for numerical calculation of this measure by genetic algorithms is also presented. Moreover, the minimization of entropy technique is extended to fermionic states.
We consider composability of quantum channels from a limited amount of entanglement via local operations and classical communication (LOCC). We show that any $k$-partially entanglement breaking channel can be composed from an entangled state with Schmidt number of $k$ via one-way LOCC. From the entanglement assisted construction we can reach an alternative definition of partially entanglement breaking channels.
Distributed quantum information processing is a promising platform for scaling up quantum information processing, where small- and intermediate-scale quantum devices are connected by a network of quantum channels for communicating quantum information, so as to cooperate in achieving larger-scale information processing. In such distributed settings, entangled states shared among the multiple devices serve as a resource for achieving nonlocal information processing tasks by local operations and classical communication (LOCC), where transformations of multipartite entangled states play central ro…
Entanglement has been studied extensively for unveiling the mysteries of non-classical correlations between quantum systems. In the bipartite case, there are well known measures for quantifying entanglement such as concurrence, relative entropy of entanglement (REE) and negativity, which cannot be increased via local operations. It was found that for sets of non-maximally entangled states of two qubits, comparing these entanglement measures may lead to different entanglement orderings of the states. On the other hand, although it is not an entanglement measure and not monotonic under local ope…
In this thesis, we investigate two different aspects of entanglement and classical communication in distributed quantum computation (DQC). In the first part, we analyze implementable computation over a given quantum network resource by introducing a new concept, quantum network coding for quantum computation. We consider a setting of networks where quantum communication for each edge of a network is restricted to sending one-qubit, but classical communication is unrestricted. Specifically, we analyze implementable $k$-qubit unitary operations over a certain class of networks, called cluster ne…
We investigate the entanglement of n-mode n-partite Gaussian fermionic states (GFS). First, we identify a reasonable definition of separability for GFS and derive a standard form for mixed states, to which any state can be mapped via Gaussian local unitaries (GLU). As the standard form is unique two GFS are equivalent under GLU if and only if their standard forms coincide. Then, we investigate the important class of local operations assisted by classical communication (LOCC). These are central in entanglement theory as they allow to partially order the entanglement contained in states. We show…
We investigate the possibility of distinguishing a set of mutually orthogonal multipartite quantum states by local operations and classical communication (LOCC). We connect this problem with generators of SU(N) and present a new condition that is necessary for a set of orthogonal states to be locally distinguishable. We show that even in multipartite cases there exists a systematic way to check whether the presented condition is satisfied for a given set of orthogonal states. Based on the proposed checking method, we find that LOCC cannot distinguish three mutually orthogonal states in which t…
It is known that there exist sets of pure orthogonal product states which cannot be perfectly distinguished by local operations and classical communication (LOCC). Such sets are nonlocal sets which exhibit nonlocality without entanglement. These nonlocal sets can be completable or uncompletable. In this work both completable and uncompletable small nonlocal sets of multipartite orthogonal product states are constructed. Apart from nonlocality, these sets have other interesting properties. In particular, the completable sets lead to the construction of a class of complete orthogonal product bas…
Entangled states can help in quantum state discrimination by local operations and classical communication (LOCC). For example, a Bell state is necessary (and sufficient) to perfectly discriminate a set of either three or four Bell states by LOCC. In this paper, we consider the task of LOCC discrimination of the states of noisy Bell ensembles, where a given ensemble consists of the states obtained by mixing the Bell states with an arbitrary two-qubit state with nonzero probabilities. It is proved that a Bell state is required for optimal discrimination by LOCC, even though the ensembles do not …
Quantum entanglement is an indispensable resource for many significant quantum information processing tasks. However, because of the noise in quantum channels, it is difficult to distribute quantum entanglement over a long distance in practice. A solution for this challenge is the quantum repeater which can extend the distance of entanglement distribution. In this scheme, the time consumption of classical communication and local operations takes an important place in perspective of time efficiency. Motivated by this observation, we exploit the basic quantum repeater scheme in perspectives of n…
The class of local operations and classical communication (LOCC) pertains to an important measurement scenario in many quantum communication schemes. While LOCC belongs to the more general class of separable operations (SEP), the exact difference between the two remains a challenging open problem. In this article, we seek to better understand the structure of LOCC and its relationship to SEP by comparing their respective abilities for distilling EPR entanglement from one copy of an $N$-qubit W-class state (i.e. that of the form $\sqrt{x_0}\ket{00...0}+\sqrt{x_1}\ket{10...0}+...+\sqrt{x_n}\ket{…
Based on the idea of measuring the factorizability of a given density matrix, we propose a pairwise analysis strategy for quantifying and understanding multipartite entanglement. The methodology proves very effective as it immediately guarantees, in addition to the usual entanglement properties, additivity and strong super additivity. We give a specific set of quantities that fulfill the protocol and which, according to our numerical calculations, make the entanglement measure an LOCC non-increasing function. The strategy allows a redefinition of the structural concept of global entanglement.
Entanglement monotone is defined as a convex measure of entanglement that does not increase on average under local operations and classical communication (LOCC). Here we call an entanglement monotone a strict entanglement monotone (SEM) if it decreases strictly on average under LOCC. We show that, for any convex roof extended entanglement monotone that on pure states is given by a function of the reduced states, if the function is strictly concave, then it is a SEM. Moreover, we prove that the negativity and the relative entropy of entanglement, which are not defined by the convex roof structu…
