Relative Entropy and Squashed Entanglement

We are interested in the properties and relations of entanglement measures. Especially, we focus on the squashed entanglement and relative entropy of entanglement, as well as their analogues and variants. Our first result is a monogamy-like inequality involving the relative entropy of entanglement and its one-way LOCC variant. The proof is accomplished by exploring the properties of relative entropy in the context of hypothesis testing via one-way LOCC operations, and by making use of an argument resembling that by Piani on the faithfulness of regularized relative entropy of entanglement. Following this, we obtain a commensurate and faithful lower bound for squashed entanglement, in the form of one-way LOCC relative entropy of entanglement. This gives a strengthening to the strong subadditivity of von Neumann entropy. Our result improves the trace-distance-type bound derived in Brandão et al. (Commun Math Phys, 306:805–830, 2011), where faithfulness of squashed entanglement was first proved. Applying Pinsker’s inequality, we are able to recover the trace-distance-type bound, even with slightly better constant factor. However, the main improvement is that our new lower bound can be much larger than the old one and it is almost a genuine entanglement measure. We evaluate exactly the relative entropy of entanglement under various restricted measurement classes, for maximally entangled states. Then, by proving asymptotic continuity, we extend the exact evaluation to their regularized versions for all pure states. Finally, we consider comparisons and separations between some important entanglement measures and obtain several new results on these, too.     

Distinguishing arbitrary multipartite basis unambiguously using local operations and classical communication

We show that an arbitrary basis of a multipartite quantum state space consisting of K distant parties such that the kth party has local dimension dk always contains at least N= Sigma(k=1)(K) (dk-1)+1 members that are unambiguously distinguishable using local operations and classical communication (LOCC). We further show that 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 entanglement," but also implies the existence of a locally distinguishable entangled basis.     

Local quantum transformations requiring infinite rounds of classical communication

In this Letter, we investigate the number of measurement and communication rounds needed to implement certain tasks by local quantum operations and classical communication (LOCC), a relatively unexplored topic. To demonstrate the possible strong dependence on the round number, we consider the problem of converting three-qubit entanglement into two-qubit form, specifically in the random distillation setting of [Phys. Rev. Lett. 98, 260501 (2007)]. We find that the number of LOCC rounds needed for a transformation can depend on the amount of entanglement distilled. In fact, for a wide range of transformations, the required number of rounds is infinite (unbounded). This represents the first concrete example of a task needing an infinite number of rounds to implement.     

Entanglement transformation between two-qubit mixed states by LOCC

Based on a new set of entanglement monotones of two-qubit pure states, we give sufficient and necessary conditions that one two-qubit mixed state is transformed into another one by local operations and classical communication (LOCC). This result can be viewed as a generalization of Nielsen's theorem Nielsen (1999) [1]. However, we find that it is more difficult to manipulate the entanglement transformation between single copy of two-qubit mixed states than to do between single copy of two-qubit pure ones.     

Robustness of entanglement for Bell decomposable states

We propose a simple geometrical approach for finding robustness of entanglement for Bell decomposable states of two-qubit quantum systems. It is shown that for these states robustness is equal to the concurrence. We also present an analytical expression for two separable states that wipe out all entanglement of these states. Random robustness of these states is also obtained. We also obtain robustness of a class of states obtained from Bell decomposable states via some special local operations and classical communications (LOCC).Received: 28 October 2002, Published online: 5 August 2003PACS: 03.65.Ud Entanglement and quantum nonlocality (e.g. EPR paradox, Bell's inequalities, GHZ states, etc.)     

Entanglement cost in practical scenarios

We quantify the one-shot entanglement cost of an arbitrary bipartite state, that is, the minimum number of singlets needed by two distant parties to create a single copy of the state up to a finite accuracy, by using local operations and classical communication only. This analysis, in contrast to the traditional one, pertains to scenarios of practical relevance, in which resources are finite and transformations can be achieved only approximately. Moreover, it unveils a fundamental relation between two well-known entanglement measures, namely, the Schmidt number and the entanglement of formation. Using this relation, we are able to recover the usual expression of the entanglement cost as a special case.     

Entanglement cost under positive-partial-transpose-preserving operations

We study the entanglement cost under quantum operations preserving the positivity of the partial transpose (PPT operations). We demonstrate that this cost is directly related to the logarithmic negativity, thereby providing the operational interpretation for this entanglement measure. As examples we discuss general Werner states and arbitrary bipartite Gaussian states. Then we prove that for the antisymmetric Werner state PPT cost and PPT entanglement of distillation coincide. This is the first example of a truly mixed state for which entanglement manipulation is asymptotically reversible, which points towards a unique entanglement measure under PPT operations.     

Sufficient and Necessary Conditions of Entanglement Transformations Between Mixed States

Based on a new measure of entanglement for finite-dimensional bi-particle pure states, we give sufficient and necessary conditions that a bi-particle mixed state ρ can be transformed into another mixed state σ by local operations and classical communication (LOCC). This result can be regarded as a generalization of Nielsen’s theorem (Nielsen, Phys. Rev. Lett. 83:436, 1999). However, we find that it is more difficult to determine the entanglement transformations between mixed states than to do between pure ones.     

Local Copying of <Emphasis Type="Italic">d</Emphasis>×<Emphasis Type="Italic">d</Emphasis>-dimensional Partially Entangled Pure States

We examine the problem of copying a set of orthogonal, entangled partially (non-maximally) bipartite pure states with an entangled blank state under the restriction to local operations and classical communication (LOCC), and show a protocol for copying these states by LOCC. The necessary and sufficient condition for locally copying partially entangled pure states is then represented. As a result, we find that the problem of local copying these entangled states can be regarded to some extent as that of catalytic transformation between them by LOCC.     

No-flipping as a consequence of no-signalling and non-increase of entanglement under LOCC

Non-existence of universal flipper for arbitrary quantum states is a fundamental constraint on the allowed operations performed on physical systems. The largest set of qubits that can be flipped by a single machine is a great circle of the Bloch-sphere. In this Letter, 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, in both the cases, there is no violation of the two principles if and only if the set of states to be flipped, form a great circle.     

Deterministically distinguishing a remote Bell state

It has been proven that, with a single copy provided, the four Bell states cannot be distinguished by local operations and classical communications (LOCC). Traditionally, a Bell basis projective measurement is needed to distinguish the four Bell states, which is usually carried out with a local interference between two particles. This paper presents an interesting protocol that allows two remote parties to distinguish four Bell states deterministically. We prove that our protocol of distinguishing remote Bell states is beyond LOCC.     

Bidirectional Quantum States Sharing

With the help of the shared entanglement and LOCC, multidirectional quantum states sharing is considered. We first put forward a protocol for implementing four-party bidirectional states sharing (BQSS) by using eight-qubit cluster state as quantum channel. In order to extend BQSS, we generalize this protocol from four sharers to multi-sharers utilizing two multi-qubit GHZ-type states as channel, and propose two multi-party BQSS schemes. On the other hand, we generalize the three schemes from two senders to multi-senders with multi GHZ-type states of multi-qubit as quantum channel, and give a multidirectional quantum states sharing protocol. In our schemes, all receivers can reconstruct the original unknown single-qubit state if and only if all sharers can cooperate. Only Pauli operations, Bell-state measurement and single-qubit measurement are used in our schemes, so these schemes are easily realized in physical experiment and their successful probabilities are all one.     

Comment on “Local Copying of d×d-dimensional Partially Entangled Pure States”

Recently, Li et al. (Int. J. Theor. Phys. 48:2777, 2009) derived a necessary and sufficient condition for LOCC cloning of a set of bipartite orthogonal partially but equally entangled state. We demonstrates that, the result is based on a wrong observation regarding a set of non-maximally entangled states with equal entanglement. We also provide a simple example in favor of our comment.     

Deterministic LOCC transformation of three-qubit pure states and entanglement transfer

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_{AB}$, C_AC$C_{AC}$, C_BC$C_{BC}$, the tangle τ_ABC${\tau }_{ABC}$ and the fifth parameter J₅$J_5$ of Acín et al. (2000) Ref. [19], while the other new one is the entanglement charge Q_e$Q_{\text{e}}$. The order of the partially ordered set is defined by the possibility of a deterministic LOCC transformation from a state to another state. In this sense, the present condition is an extension of Nielsen’s work (Nielsen (1999) [14]) to three-qubit pure states. We also clarify the rules of transfer and dissipation of the entanglement which is caused by deterministic LOCC transformations. Moreover, the minimum number of times of measurements to reproduce an arbitrary deterministic LOCC transformation between three-qubit pure states is given.     

A Note on the Relationship Between Genuinely Coherence and Generalized Entanglement Monotones

International Journal of Theoretical Physics - We find a one to one mapping between genuinely incoherent operations and special one-way local operations and classical communication(LOCC) for...     

Entanglement irreversibility from quantum discord and quantum deficit

We relate the problem of irreversibility of entanglement with the recently defined measures of quantum correlation--quantum discord and one-way quantum deficit. We show that the entanglement of formation is always strictly larger than the coherent information and the entanglement cost is also larger in most cases. We prove irreversibility of entanglement under local operations and classical communication for a family of entangled states. This family is a generalization of the maximally correlated states for which we also give an analytic expression for the distillable entanglement, the relative entropy of entanglement, the distillable secret key, and the quantum discord.     

Revisiting Impossible Quantum Operations Using Principles of No-Signaling and Nonincrease of Entanglement Under LOCC

In this letter, we show the impossibility of the general operation introduced by Pati (Phys. Rev. A 66:062319, 2002) using two different but consistent principles (i) no-signaling (ii) non increase of entanglement under LOCC.     

A Framework for Bounding Nonlocality of State Discrimination

We consider the class of protocols that can be implemented by local quantum operations and classical communication (LOCC) between two parties. In particular, we focus on the task of discriminating a known set of quantum states by LOCC. Building on the work in the paper Quantum nonlocality without entanglement (Bennett et al., Phys Rev A 59:1070–1091, 1999), we provide a framework for bounding the amount of nonlocality in a given set of bipartite quantum states in terms of a lower bound on the probability of error in any LOCC discrimination protocol. We apply our framework to an orthonormal product basis known as the domino states and obtain an alternative and simplified proof that quantifies its nonlocality. We generalize this result for similar bases in larger dimensions, as well as the “rotated” domino states, resolving a long-standing open question (Bennett et al., Phys Rev A 59:1070–1091, 1999).     

On the Chernoff Distance for Asymptotic LOCC Discrimination of Bipartite Quantum States

Motivated by the recent discovery of a quantum Chernoff theorem for asymptotic state discrimination, we investigate the distinguishability of two bipartite mixed states under the constraint of local operations and classical communication (LOCC), in the limit of many copies. While for two pure states a result of Walgate et al. shows that LOCC is just as powerful as global measurements, data hiding states (DiVincenzo et al.) show that locality can impose severe restrictions on the distinguishability of even orthogonal states. Here we determine the optimal error probability and measurement to discriminate many copies of particular data hiding states (extremal d × d Werner states) by a linear programming approach. Surprisingly, the single-copy optimal measurement remains optimal for n copies, in the sense that the best strategy is measuring each copy separately, followed by a simple classical decision rule. We also put a lower bound on the bias with which states can be distinguished by separable operations.