Search

A key concept of quantum information theory is that accessing information encoded in a quantum system requires us to discriminate between several possible states the system could be in. A natural generalization of this problem, namely, quantum sequence discrimination, appears in various quantum information processing tasks, the objective being to determine the state of a finite sequence of quantum states. Since such a sequence is a composite quantum system, the fundamental question is whether an optimal measurement is local, i.e., comprising measurements on the individual members, or collective, i.e. requiring joint measurement(s). In some known instances of this problem, the optimal measurement is local, whereas in others, it is collective. But, so far, a definite prescription based solely on the problem description has been lacking. In this paper, we prove that if the members of a given sequence are drawn secretly and independently from an ensemble or even from different ensembles, the optimum success probability is achievable by fixed local measurements on the individual members of the sequence, and no collective measurement is necessary. This holds for both minimum-error and unambiguous state discrimination paradigms., Comment: published version

We consider the problem of distinguishing between the elements of a bipartite maximally entangled orthonormal basis using local operations and classical communication (LOCC) and a partially entangled state acting as a resource. We derive an exact formula for the optimum success probability and find that it corresponds to the fully entangled fraction of the resource state. The derivation consists of two steps: First, we consider a relaxation of the problem by replacing LOCC with positive-partial-transpose (PPT) measurements and establish an upper bound on the success probability as the solution of a semidefinite program, and then show that this upper bound is achieved by a teleportation-based LOCC protocol. This further implies that separable and PPT measurements provide no advantage over LOCC for this task. We also present lower and upper bounds on the success probability for distinguishing the elements of an incomplete orthonormal maximally entangled basis in the same setup., Comment: 15 pages; v2: 24 pages, published version - title and abstract slightly modified, a new section discussing the case of an incomplete basis, and other edits for clarity

We consider the problem of determining the state of an unknown quantum sequence without error. The elements of the given sequence are drawn with equal probability from a known set of linearly independent pure quantum states with the property that their mutual inner products are all real and equal. This problem can be posed as an instance of unambiguous state discrimination where the states correspond to that of all possible sequences having the same length as the given one. We calculate the optimum probability by solving the optimality conditions of a semidefinite program. The optimum value is achievable by measuring individual members of the sequence, and no collective measurement is necessary., Comment: v1:17 pages; v2: published version, 19 pages, expanded introduction, better organized proof of the main result, and several minor edits to improve clarity

Signal propagation in biochemical networks is characterized by the inherent randomness in gene expression and fluctuations of the environmental components, commonly known as intrinsic and extrinsic noise, respectively. We present a theoretical framework for noise propagation in a generic two-step cascade (S$\rightarrow$X$\rightarrow$Y) regarding intrinsic and extrinsic noise. We identify different channels of noise transmission that regulate the individual and the overall noise properties of each component. Our analysis shows that the intrinsic noise of S alleviates the general noise and information transmission capacity along the cascade. On the other hand, the intrinsic noise of X and Y acts as a bottleneck of information transmission. We also show a hierarchical relationship among the intrinsic noise levels of S, X, and Y, with S exhibiting the highest level of intrinsic noise, followed by X and then Y. This hierarchy is preserved within the two-step cascade, facilitating the highest information transmission from S to Y via X., Comment: Revised version. 12 pages with 4 figures

Recently, it was shown that if two distant test masses, each in a spatially superposed quantum state, become entangled due to their mutual gravitational interaction, then this entanglement could serve as evidence of the quantum nature of gravity. We extend this treatment to a many-body system in a general setup and study the entanglement properties of the time-evolved state. We exactly compute the time-dependent I-concurrence for every bipartition and obtain the necessary and sufficient condition for the creation of genuine many-body entanglement. We further show that this entanglement is of generalised GHZ type when certain conditions are met. We also evaluate the amount of multipartite entanglement in the system using a set of generalised Meyer-Wallach measures., Comment: v2: Published version; minor changes and edits

In a quantum change point problem, a source emitting particles in a fixed quantum state (default) switches to a different state at some stage, and the objective is to identify when the change happened by measuring a sequence of particles emitted from such a source. Motivated by entanglement-sharing protocols in quantum information, we study this problem within the paradigm of local operations and classical communication (LOCC). Here, we consider a source that emits entangled pairs in a default state, but starts producing another entangled state (mutation) at a later stage. Then, a sequence of entangled pairs prepared from such a source and shared between distant observers cannot be used for quantum information processing tasks as the identity of each entangled pair remains unknown. We show that identifying the change point using LOCC leads to the distillation of free entangled pairs. In particular, if the default and the mutation are mutually orthogonal, there exists an efficient LOCC protocol that identifies the change point without fail and distills a sufficiently large number of pairs. However, if they are nonorthogonal, there is a probability of failure. In this case, we compute the number of entangled pairs that may be obtained on average. We also consider a relaxation of the two-state problem where the mutation is not known a priori, but instead belongs to a known set. Here we show that local distinguishability plays a crucial role: if the default and the possible mutations are locally distinguishable, the problem reduces to the two-state problem with orthogonal states, but if not, one may still identify the mutation, the change point, and distill entanglement, as we illustrate with a concrete example., Comment: v1: 14 pages, 2 figures; v2: 12 pages + appendix (2 pages), 2 figures, result on non-orthogonal states added, reference added, other revisions to improve clarity; v3: published version

We study the problem of transforming a set of pure bipartite states into another using deterministic LOCC (local operations and classical communication). Necessary conditions for the existence of such a transformation are obtained using LOCC constraints on state transformation, entanglement, and distinguishability. These conditions are shown to be independent but not sufficient. We discuss their satisfiability and classify all possible input-output pairs of sets accordingly. We also prove that strict inclusions hold between LOCC, separable, and positive partial transpose operations for set transformation problems., Comment: 21 pages, 1 figure; v2: modified title (LOCC changed to local), revised sections 1,3, and 4 to improve clarity, references added, accepted for publication in PRA; v3: 24 pages, minor typos corrected, published version

The quantum switch describes a quantum operation in which two or more quantum channels act on a quantum system with the order of application determined by the state of an order quantum system. And by suitably choosing the state of the order system, one can create a quantum superposition of the different orders of application, which can perform communication tasks impossible within the framework of the standard quantum Shannon theory. In this paper, we consider the scenario of one-shot heralded qubit communication and ask whether there exist protocols using a given quantum switch or switches that could outperform the given ones. We answer this question in the affirmative. We define a higher-order quantum switch composed of two quantum switches, with their order of application controlled by another order quantum system. We then show that the quantum switches placed in a quantum superposition of their alternative orders can transmit a qubit, without any error, with a probability higher than that achievable with the quantum switches individually. We demonstrate this communication advantage over quantum switches useful as a resource and those that are useless. We also show that there are situations where there is no communication advantage over the individual quantum switches., Comment: 19 pages, 3 figures;v2:revised title and abstract, improved presentation and clarity, added brief discussions on even higher-order quantum switches and experiments, added references; v3: minor changes and improvements, published version

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 contain, in general, any maximally entangled state, and in specific instances, any entangled state., Comment: 20 pages; v2: revised title and abstract, new references added, other minor edits; v3: minor edits to match the published version

Quantum nonlocality has different manifestations that, in general, are revealed by local measurements of the parts of a composite system. In this paper, we study nonlocality arising from a set of orthogonal states that cannot be perfectly distinguished by local operations and classical communication (LOCC). Such a set is deemed nonlocal, for a joint measurement on the whole system is necessary for perfect discrimination of the states with certainty. On the other hand, a set of orthogonal states that can be perfectly distinguished by LOCC is believed to be devoid of nonlocal properties. Here, we show that there exist orthogonal sets that are locally distinguishable but without local redundancy (i.e., they become nonorthogonal on discarding one or more subsystems) whose nonlocality can be activated by local measurements. In particular, a state chosen from such a set can be locally converted, with certainty, into another state, the identity of which can now only be ascertained by global measurement and no longer by LOCC. In other words, a locally distinguishable set without local redundancy may be locally converted into a locally indistinguishable set with certainty. We also suggest an application, namely, local hiding of information, that allows us to locally hide locally available information without losing any part. Once hidden, the information in its entirety can only be retrieved using entanglement., Comment: v2: the issue of local redundancy discussed and addressed, a new example included (at the expense of an old one) where the dimensions of the local subsystems are prime, title and abstract slightly modified; v3: abstract slightly modified, improved clarity; v4: published version

The superposition principle is fundamental to quantum theory. Yet a recent no-go theorem has proved that quantum theory forbids superposition of unknown quantum states, even with nonzero probability. The implications of this result, however, remain poorly understood so far. In this paper we show that the existence of a protocol that superposes two unknown pure states with nonzero probability (allowed to vary over input states) leads to violation of other no-go theorems. In particular, such a protocol can be used to perform certain state discrimination and cloning tasks that are forbidden not only in quantum theory but in no-signaling theories as well., Comment: 4 pages; v2: title change and other minor edits, published version

We study information-disturbance trade-off in generalized entanglement swapping protocols wherein starting from Bell pairs $\left(1,2\right)$ and $\left(3,4\right)$, one performs an arbitrary joint measurement on $\left(2,3\right)$, so that $\left(1,4\right)$ now becomes correlated. We obtain trade-off inequalities between information gain in correlations of $\left(1,4\right)$ and residual information in correlations of $\left(1,2\right)$ and $\left(3,4\right)$ respectively and argue that information contained in correlations (information) is conserved if each inequality is an equality. We show that information is conserved for a maximally entangled measurement but is not conserved for any other complete orthogonal measurement and Bell measurement mixed with white noise. However, rather surprisingly, we find that information is conserved for rank-two Bell diagonal measurements, although such measurements do not conserve entanglement. We also show that a separable measurement on $\left(2,3\right)$ can conserve information, even if, as in our example, the post-measurement states of all three pairs $\left(1,2\right)$, $\left(3,4\right)$, and $\left(1,4\right)$ become separable. This implies correlations from an entangled pair can be transferred to separable pairs in nontrivial ways so that no $information$ is lost in the process., Comment: 7 pages, 2 figures;v2: typos corrected, minor edits, published version

Quantum teleportation with a two-qubit state can be suitably characterized in terms of maximal fidelity and fidelity deviation, where the former is the maximal value of the average fidelity achievable within the standard protocol and local unitary operations and the latter is the standard deviation of fidelity over all input states. In this paper, we consider the problem of characterizing two-qubit states that are optimal for quantum teleportation for a given value of some state property. The optimal states are defined as those states that, for a given value of the state property under consideration, achieve the largest maximal fidelity and also exhibit zero fidelity deviation. We provide a complete characterization of optimal states for a given linear entropy, maximum mean value of the Bell-CHSH observable, and concurrence, respectively. We find that for a given linear entropy or Bell-CHSH violation, the largest maximal fidelity states are optimal, but for a given concurrence, the optimal states form a strict subset of the largest maximal fidelity states., Comment: 25 pages; published version

Quantum teleportation with an arbitrary two-qubit state can be appropriately characterized in terms of maximal fidelity and fidelity deviation. The former quantifies optimality of the process and is defined as the maximal average fidelity achievable within the standard protocol and local unitary strategies, whereas the latter, defined as the standard deviation of fidelity over all input states, is a measure of fidelity fluctuations. The maximal fidelity for a two-qubit state is known and is given by a simple formula that can be exactly computed, but no such formula is known for the fidelity deviation. In this paper, we derive an exact computable formula for the fidelity deviation in optimal quantum teleportation with an arbitrary state of two qubits. From this formula, we obtain the dispersion-free condition, also known as the universality condition: the condition that all input states are teleported equally well and provide a necessary and sufficient condition for a state to be both useful (maximal fidelity larger than the classical bound) and universal (zero fidelity deviation). We also show that for any given maximal fidelity, larger than the classical bound, there always exist dispersion-free or universal states and argue that such states are the most desirable ones within the set of useful states. We illustrate these results with well-known families of two-qubit states: pure entangled states, Bell-diagonal states, and subsets of $X$ states., Comment: 21 pages; minor revisions, references added; accepted for publication in Journal of Physics A; minor typos corrected, published version

Quantum nonlocality is usually associated with entangled states by their violations of Bell-type inequalities. However, even unentangled systems, whose parts may have been prepared separately, can show nonlocal properties. In particular, a set of product states is said to exhibit "quantum nonlocality without entanglement" if the states are locally indistinguishable, i.e. it is not possible to optimally distinguish the states by any sequence of local operations and classical communication. Here, we present a stronger manifestation of this kind of nonlocality in multiparty systems through the notion of local irreducibility. A set of multiparty orthogonal quantum states is defined to be locally irreducible if it is not possible to locally eliminate one or more states from the set while preserving orthogonality of the postmeasurement states. Such a set, by definition, is locally indistinguishable, but we show that the converse doesn't always hold. We provide the first examples of orthogonal product bases on $\mathbb{C}^{d}\otimes\mathbb{C}^{d}\otimes\mathbb{C}^{d}$ for $d=3,4$ that are locally irreducible in all bipartitions, where the construction for $d=3$ achieves the minimum dimension necessary for such product states to exist. The existence of such product bases implies that local implementation of a multiparty separable measurement may require entangled resources across all bipartitions., Comment: 6+8 pages; v2:revised abstract and introduction + minor edits; v3: published version

We characterise non-selective global projective measurements capable of increasing quantum entanglement between two particles. We show that non-selective global projective measurements are capable of increasing entanglement between two particles, in particular, entanglement of any pure non-maximally entangled state can be improved in this way (but not of any mixed state) and we provide detailed analysis for two qubits. It is then shown that Markovian open system dynamics can only approximate such measurements, but this approximation converges exponentially fast as illustrated using Araki-Zurek model. We conclude with numerical evidence that macroscopic bodies in a random pure state do not gain entanglement in a random non-selective global measurement., Comment: 9 pages, 4 figures

We consider the problem of establishing entangled states of optimal singlet fraction and negativity between two remote parties for every use of a noisy quantum channel and trace-preserving LOCC under the assumption that the parties do not share prior correlations. We show that for a family of quantum channels in every finite dimension $d\geq3$, one-shot optimal singlet fraction and entanglement negativity are attained only with appropriate nonmaximally entangled states. We further show that the generalization of the formula that exactly computes one-shot optimal singlet fraction for qubit channels does not hold in general in higher dimensions. A consequence of our results is that the ordering of entangled states in all finite dimensions may not be preserved under trace-preserving LOCC., Comment: 7 pages; v2: minor changes, published version

We study the problem of locally distinguishing pure quantum states using shared entanglement as a resource. For a given set of locally indistinguishable states, we define a resource state to be useful if it can enhance local distinguishability and optimal if it can distinguish the states as well as global measurements and is also minimal with respect to a partial ordering defined by entanglement and dimension. We present examples of useful resources and show that an entangled state need not be useful for distinguishing a given set of states. We obtain optimal resources with explicit local protocols to distinguish multipartite GHZ and Graph states; and also show that a maximally entangled state is an optimal resource under one-way LOCC to distinguish any bipartite orthonormal basis which contains at least one entangled state of full Schmidt rank., Comment: 24 pages; minor changes, typos corrected; published version

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 discrimination., Comment: 8 pages. Bibliography has been re-ordered to match published version

The question whether indeterminism in quantum measurement outcomes is fundamental or is there a possibility of constructing a finer theory underlying quantum mechanics that allows no such indeterminism, has been debated for a long time. We show that within the class of ontological models due to Harrigan and Spekkens, those satisfying preparation-measurement reciprocity must allow indeterminism of the order of quantum theory. Our result implies that one can design quantum random number generator, for which it is impossible, even in principle, to construct a reciprocal deterministic model., Comment: Two column, 7 pages, 1 figure

We classify protocols of entanglement distribution as excessive and non-excessive ones. In a non-excessive protocol, the gain of entanglement is bounded by the amount of entanglement being communicated between the remote parties, while excessive protocols violate such bound. We first present examples of excessive protocols that achieve a significant entanglement gain. Next we consider their use in noisy scenarios, showing that they improve entanglement achieved in other ways and for some situations excessive distribution is the only possibility of gaining entanglement., Comment: 13 pages, 11 figures

We prove limitations on LOCC and separable measurements in bipartite state discrimination problems using techniques from convex optimization. Specific results that we prove include: an exact formula for the optimal probability of correctly discriminating any set of either three or four Bell states via LOCC or separable measurements when the parties are given an ancillary partially entangled pair of qubits; an easily checkable characterization of when an unextendable product set is perfectly discriminated by separable measurements, along with the first known example of an unextendable product set that cannot be perfectly discriminated by separable measurements; and an optimal bound on the success probability for any LOCC or separable measurement for the recently proposed state discrimination problem of Yu, Duan, and Ying., Comment: 22 pages, v2 includes minor corrections

We consider the problem of unambiguous (error-free) discrimination of N linearly independent pure quantum states with prior probabilities, where the goal is to find a measurement that maximizes the average probability of success. We derive an upper bound on the optimal average probability of success using a result on optimal local conversion between two bipartite pure states. We prove that an optimal measurement in general saturates our bound. In the exceptional cases we show that the bound is tight, but not always optimal., Comment: 16 pages. v2: Typos fixed in examples 1 and 2; v3: journal version, abstract slightly modified, partly rewritten for clarity, results unchanged

Maximally entangled states--a resource for quantum information processing--can only be shared through noiseless quantum channels, whereas in practice channels are noisy. Here we ask: Given a noisy quantum channel, what is the maximum attainable purity (measured by singlet fraction) of shared entanglement for single channel use and local trace preserving operations? We find an exact formula of the maximum singlet fraction attainable for a qubit channel and give an explicit protocol to achieve the optimal value. The protocol distinguishes between unital and nonunital channels and requires no local post-processing. In particular, the optimal singlet fraction is achieved by transmitting part of an appropriate pure entangled state, which is maximally entangled if and only if the channel is unital. A linear function of the optimal singlet fraction is also shown to be an upper bound on the distillable entanglement of the mixed state dual to the channel., Comment: 9 pages; Latex; double column; matches the published version

In the task of quantum state exclusion we consider a quantum system, prepared in a state chosen from a known set. The aim is to perform a measurement on the system which can conclusively rule that a subset of the possible preparation procedures can not have taken place. We ask what conditions the set of states must obey in order for this to be possible and how well we can complete the task when it is not. The task of quantum state discrimination forms a subclass of this set of problems. Within this paper we formulate the general problem as a Semidefinite Program (SDP), enabling us to derive sufficient and necessary conditions for a measurement to be optimal. Furthermore, we obtain a necessary condition on the set of states for exclusion to be achievable with certainty and give a construction for a lower bound on the probability of error. This task of conclusively excluding states has gained importance in the context of the foundations of quantum mechanics due to a result of Pusey, Barrett and Rudolph (PBR). Motivated by this, we use our SDP to derive a bound on how well a class of hidden variable models can perform at a particular task, proving an analogue of Tsirelson's bound for the PBR experiment and the optimality of a measurement given by PBR in the process. We also introduce variations of conclusive exclusion, including unambiguous state exclusion, and state exclusion with worst case error., Comment: 8+11 pages. Version 2 includes a new result in Section V providing a lower bound on the probability of error in an exclusion task. Additional references and clarifications based on referee comments have also been incorporated. Version 3 acknowledges funding sources

One of the many interesting features of quantum nonlocality is that the states of a multipartite quantum system cannot always be distinguished as well by local measurements as they can when all quantum measurements are allowed. In this work, we characterize the distinguishability of sets of multipartite quantum states when restricted to separable measurements -- those which contain the class of local measurements but nevertheless are free of entanglement between the component systems. We consider two quantities: The separable fidelity -- a truly quantum quantity -- which measures how well we can "clone" the input state, and the classical probability of success, which simply gives the optimal probability of identifying the state correctly. We obtain lower and upper bounds on the separable fidelity and give several examples in the bipartite and multipartite settings where these bounds are optimal. Moreover the optimal values in these cases can be attained by local measurements. We further show that for distinguishing orthogonal states under separable measurements, a strategy that maximizes the probability of success is also optimal for separable fidelity. We point out that the equality of fidelity and success probability does not depend on an using optimal strategy, only on the orthogonality of the states. To illustrate this, we present an example where two sets (one consisting of orthogonal states, and the other non-orthogonal states) are shown to have the same separable fidelity even though the success probabilities are different., Comment: 19 pages; published version

We provide a construction of sets of (d/2+1) mutually unbiased bases (MUBs) in dimensions d=4,8 using maximal commuting classes of Pauli operators. We show that these incomplete sets cannot be extended further using the operators of the Pauli group. However, specific examples of sets of MUBs obtained using our construction are shown to be strongly unextendible; that is, there does not exist another vector that is unbiased with respect to the elements in the set. We conjecture the existence of such unextendible sets in higher dimensions (d=2^{n}, n>3) as well. Furthermore, we note an interesting connection between these unextendible sets and state-independent proofs of the Kochen-Specker Theorem for two-qubit systems. Our construction also leads to a proof of the tightness of a H_{2} entropic uncertainty relation for any set of three MUBs constructed from Pauli classes in d=4., Comment: 22 pages, v2: minor changes, references added; published version

Uncertainty relations are often considered to be a measure of incompatibility of noncommuting observables. However, such a consideration is not valid in general, motivating the need for an alternate measure that applies to any set of noncommuting observables. We present an operational approach to quantifying incompatibility without invoking uncertainty relations. Our measure aims to capture the incompatibility of noncommuting observables as manifest in the non-orthogonality of their eigenstates. We prove that this measure has all the desired properties: it is zero when the observables commute, strictly greater than zero when they do not, and is maximum when they are mutually unbiased. We also obtain tight upper bounds on this measure for any N noncommuting observables and compute it exactly when the observables are mutually unbiased., Comment: 7 pages; title modified and other minor changes, references added; journal version

To establish an entangled state of optimal fidelity between two distant observers when the available quantum channel is noisy, is a central problem in quantum information theory. We consider an instance of this problem for two-qubit systems when only a single use of the channel and local post-processing by trace preserving operations are allowed. We show that the optimal fidelity is obtained only when part of an appropriate non-maximally entangled state is transmitted through the channel. The entanglement of this state can be vanishingly small when the channel becomes very noisy. Moreover, in the optimal case no further local processing is required to enhance the fidelity. We further show that local post-processing can enhance fidelity if and only if the amount of noise is larger than a critical value and entanglement of the transmitted state is bounded from below. A notable consequence of these results is that the ordering of states under an entanglement monotone can be reversed even when the states undergo the same local interaction via a trace-preserving completely positive map.

It is shown that local distinguishability of orthogonal mixed states can be completely characterized by local distinguishability of their supports irrespective of entanglement and mixedness of the states. This leads to two kinds of upper bounds on the number of perfect LOCC distinguishable orthogonal mixed states. The first one depends only on pure-state entanglement within the supports of the states, and therefore may be easy to compute in many instances. The second bound is optimal in the sense that it optimizes the bounding quantities, not necessarily function of entanglement alone, over all orthogonal mixed state ensembles (satisfying certain conditions) admissible within the supports of the density matrices., Comment: Latex, 12 pages; journal version

Quantum information is nonlocal in the sense that local measurements on a composite quantum system, prepared in one of many mutually orthogonal states, may not reveal in which state the system was prepared. It is shown that in the many copy limit this kind of nonlocality is fundamentally different for pure and mixed quantum states. In particular, orthogonal mixed states may not be distinguishable by local operations and classical communication (LOCC), no matter how many copies are supplied, whereas any set of N orthogonal pure states can be perfectly discriminated with m copies, where, m

We consider the question of perfect local distinguishability of mutually orthogonal bipartite quantum states, with the property that every state can be specified by a unitary operator acting on the local Hilbert space of Bob. We show that if the states can be exactly discriminated by one-way LOCC where Alice goes first, then the unitary operators can also be perfectly distinguished by an orthogonal measurement on Bob's Hilbert space. We give examples of sets of N<=d maximally entangled states in $d \otimes d $ for d=4,5,6 that are not perfectly distinguishable by one-way LOCC. Interestingly for d=5,6 our examples consist of four and five states respectively. We conjecture that these states cannot be perfectly discriminated by two-way LOCC., Comment: Revised version, new proofs added; to appear in New Journal of Physics

The "entanglement cost" of a bipartite measurement is the amount of shared entanglement two participants need to use up in order to carry out the given measurement by means of local operations and classical communication. Here we numerically investigate the entanglement cost of generic orthogonal measurements on two qubits. Our results strongly suggest that for almost all measurements of this kind, the entanglement cost is strictly greater than the average entanglement of the eigenstates associated with the measurements, implying that the nonseparability of a two-qubit orthogonal measurement is generically distinct from the nonseparability of its eigenstates., Comment: Latex, 4 pages, minor changes

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 only of entangled states or is a mix of both entangled and product states, determines the maximum number of perfectly distinguishable states., Comment: Latex, 11 pages, minor changes

For certain joint measurements on a pair of spatially separated particles, we ask how much entanglement is needed to carry out the measurement exactly. For a class of orthogonal measurements on two qubits with partially entangled eigenstates, we present upper and lower bounds on the entanglement cost. The upper bound is based on a recent result by D. Berry [Phys. Rev. A 75, 032349 (2007)]. The lower bound, based on the entanglement production capacity of the measurement, implies that for almost all measurements in the class we consider, the entanglement required to perform the measurement is strictly greater than the average entanglement of its eigenstates. On the other hand, we show that for any complete measurement in d x d dimensions that is invariant under all local Pauli operations, the cost of the measurement is exactly equal to the average entanglement of the states associated with the outcomes., Comment: 14 pages; new result in v4: cost of an arbitrary measurement invariant under local Pauli operations

We study robustness of bipartite entangled states that are positive under partial transposition (PPT). It is shown that almost all PPT entangled states are unconditionally robust, in the sense, both inseparability and positivity are preserved under sufficiently small perturbations in its immediate neighborhood. Such unconditionally robust PPT entangled states lie inside an open PPT entangled ball. We construct examples of such balls whose radii are shown to be finite and can be explicitly calculated. This provides a lower bound on the volume of all PPT entangled states. Multipartite generalization of our constructions are also outlined., Comment: Published version

We prove that any three linearly independent pure quantum states can always be locally distinguished with nonzero probability regardless of their dimension, entanglement, or multipartite structure. Almost always, all three states can be unambiguously identified. The only exceptional case, where one state is locally knowable but the other two are not, is found among multi-qubit states., Comment: 4 Pages, v2 - second corollory corrected, reference added; v3- abstract expanded, proofs elaborated, reference added

We show that the phenomenon of superadditivity of distillable entanglement observed in multipartite quantum systems results from the consideration of states created during the execution of the standard end-to-end quantum teleportation protocol (and a few additional local operations and classical communication (LOCC) steps) on a linear chain of singlets. Some of these intermediate states are tensor products of bound-entangled (BE) states, and hence, by construction possess distillable entanglement, which can be unlocked by simply completing the rest of the LOCC operations required by the underlying teleportation protocol. We use this systematic approach to construct both new and known examples of superactivation of bound entanglement, and first examples of activation of BE states using other BE states. A surprising outcome is the construction of noiseless quantum relay channels with no distillable entanglement between any two parties, except for that between the two end nodes., Comment: 4 pages, 4 figures

We establish duality for monogamy of entanglement: whereas monogamy of entanglement inequalities provide an upper bound for bipartite sharability of entanglement in a multipartite system, we prove that the same quantity provides a \emph{lower} bound for distribution of bipartite entanglement in a multipartite system. Our theorem for monogamy of entanglement is used to establish relations between bipartite entanglement that separate one qubit from the rest vs separating two qubits from the rest., Comment: 12 pages

We report the exact entanglement cost of a class of multiqubit bound entangled states, computed in the context of a universal model for multipartite state preparation. The exact amount of entanglement needed to prepare such states are determined by first obtaining lower bounds using a cut-set approach, and then providing explicit local protocols achieving the lower bound., Comment: Latex, 11 pages: revised version, slightly longer than the published version

We show that the Hilbert space of even number ($\geq4$) of qubits can always be decomposed as a direct sum of four orthogonal subspaces such that the normalized projectors onto the subspaces are activable bound entangled (ABE) states. These states also show a surprising recursive relation in the sense that the states belonging to $2N+2$ qubits are Bell correlated to the states of $2N$ qubits; hence, we refer to these states as Bell-Correlated ABE (BCABE) states. We also study the properties of noisy BCABE states and show that they are very similar to that of two qubit Bell-diagonal states.

We study the robustness of the GHZ (or ``cat'') class of multi-partite states under decoherence. The noise model is described by a general completely positive map for qubits independently coupled to the environment. In particular, the robustness of N-party entanglement is studied in the large N limit when (a) the number of spatially separated subsystems is fixed but the size of each subsystem becomes large (b) the size of the subsystems is fixed while their number becomes arbitrarily large. We obtain conditions for entanglement in these two cases. Among our other results, we show that the parity of an entangled state (i.e., whether it contains an even or odd number of qubits) can lead to qualitatively different robustness of entanglement under certain conditions., Comment: 7 pages, no figures, revised version: title slightly changed and other minor revisions. To appear in Phys. Rev. A

A systematic method for generating bound entangled states in any bipartite system, with ranks ranging from five to full rank, is presented. These states are constructed by mixing separable states with UPB (Unextendible Product Basis) - generated PPT bound entangled states. A subset of this class of PPT bound entangled states, having less than full rank, is shown to satisfy the range criterion [Phys. Lett. A, vol. 232 (1997) 333]., Comment: 6 pages, Latex. Minor corrections and additions. More references added. Accepted for publication in Phys. Rev. A

We show that intrinsic fluctuations in system control parameters impose limits on the ability of two-qubit (exchange) Hamiltonians to generate entanglement starting from mixed initial states. We find three classes for Gaussian and Laplacian fluctuations. For the Ising and XYZ models there are qualitatively distinct sharp entanglement-generation transitions, while the class of Heisenberg, XY, and XXZ Hamiltonians is capable of generating entanglement for any finite noise level. Our findings imply that exchange Hamiltonians are surprisingly robust in their ability to generate entanglement in the presence of noise, thus potentially reducing the need for quantum error correction., Comment: 5 pages, incl. 2 figures. replaced with published version

The discovery of entangled quantum states from which one cannot distill pure entanglement constitutes a fundamental recent advance in the field of quantum information. Such bipartite bound-entangled (BE) quantum states \emph{could} fall into two distinct categories: (1) Inseparable states with positive partial transposition (PPT), and (2) States with negative partial transposition (NPT). While the existence of PPT BE states has been confirmed, \emph{only one} class of \emph{conjectured} NPT BE states has been discovered so far. We provide explicit constructions of a variety of multi-copy undistillable NPT states, and conjecture that they constitute families of NPT BE states. For example, we show that for every pure state of Schmidt rank greater than or equal to three, one can construct n-copy undistillable NPT states, for any $n\geq1$. The abundance of such conjectured NPT BE states, we believe, considerably strengthens the notion that being NPT is only a necessary condition for a state to be distillable., Comment: Latex, 10 pages

We explore classical to quantum transition of correlations by studying the quantum states located just outside of the classically-correlated-states-only neighborhood of the maximally mixed state (the largest separable ball (LSB)). We show that a natural candidate for such states raises the possibility of a layered transition, i.e., an annular region comprising only classical and the classical-like bound entangled states, followed by free or distillable entanglement. Surprisingly, we find the transition to be abrupt for bipartite systems: distillable states emerge arbitrarily close to the LSB. For multipartite systems, while the radius of the LSB remains unknown, we determine the radius of the largest undistillable ball. Our results also provide an upper bound on how noisy shared entangled states can be for executing quantum information processing protocols., Comment: Published Version, 7 pages, Latex

We show that entanglement-assisted transformations of bipartite entangled states can be more efficient than catalysis [D. Jonathan and M. B. Plenio, Phys. Rev. Lett. 83, 3566 (1999)}, i.e., given two incomparable bipartite states not only can the transformation be enabled by performing collective operations with an auxiliary entangled state, but the entanglement of the auxiliary state itself can be enhanced. We refer to this phenomenon as supercatalysis. We provide results on the properties of supercatalysis and its relationship with catalysis. In particular, we obtain a useful necessary and sufficient condition for catalysis, provide several sufficient conditions for supercatalysis and study the extent to which entanglement of the auxiliary state can be enhanced via supercatalysis., Comment: Latex, 5 pages