Entanglement concentration requires no classical communication, but the best prior art result for diluting to N copies of a partially entangled state requires an amount of communication on the order of sqrt(N) bits. Our main result is to prove this prior art result optimal up to a constant factor; any procedure for creating N partially entangled states from singlets requires Omega(sqrt(N)) bits of classical communication. Previously not even a constant bound was known for approximate entanglement transforms.
We also prove a lower bound on the inefficiency of the process: to dilute singlets to N copies of a partially entangled state, the entropy of entanglement must decrease by Omega(sqrt(N)).
We consider asymptotic convertibility of an arbitrary sequence of bipartite pure states into another by local operations and classical communication (LOCC). We adopt an information-spectrum approach to address cases where each element of the sequences is not necessarily in tensor power of a bipartite pure state. We derive necessary and sufficient conditions for the LOCC convertibility of one sequence to another in terms of spectral entropy rates of entanglement of the sequences. Based on these results, we also provide simple proofs for previously known results on the optimal rates of entanglem…
We compute entanglement cost and distillable entanglement of states supported on symmetric subspace. Not only giving general formula, we apply them to the output states of optimal cloning machines. Surprisingly, under some settings, the optimal n to m clone and true m copies are the same in entanglement measures. However, they differ in the error exponent of entanglement dilution. We also presented a general theory of entanglement dilution which is applicable to any non-i.i.d sequence of states.
Recently a new entanglemenet dilution scheme has been constructed by Lo and Popescu. This paper points out that this result has a deep implication that the entanglement measure for bipartite pure states is independent of the distance between entangled two systems.
We study the amount of communication needed for two parties to transform some given joint pure state into another one, either exactly or with some fidelity. Specifically, we present a method to lower bound this communication cost even when the amount of entanglement does not increase. Moreover, the bound applies even if the initial state is supplemented with unlimited entanglement in the form of EPR pairs, and the communication is allowed to be quantum mechanical. We then apply the method to the determination of the communication cost of asymptotic entanglement concentration and dilution. Whil…
Single-shot entanglement manipulation of states and channels revisited
University of Calgary（卡尔加里大学）；Institute for Quantum Science and Technology, University of Calgary（卡尔加里大学量子科学与技术研究所）；Institute for Quantum Computing, Baidu Research（百度研究院量子计算研究所）
We present a class of tight monogamy relations in terms of Rényi-$α$ entanglement, which are tighter than the monogamy relations of multiqubit entanglement just based on the power of the Rényi-$α$ entanglement for $α\geq 2$ and the power $η>1$. For $2>α\geq\frac{\sqrt{7}-1}{2}$ and the power $η>2$, we establish a class of tight monogamy relations of multiqubit entanglement with larger lower bounds than the existing monogamy relations of multiqubit entanglement.
We investigate the tight monogamy and polygamy relations of multiparty entanglement for arbitrary quantum states. By using the power of the bipartite measure of entanglement, we establish a class of tight monogamy relations of multiparty entanglement with larger lower bounds than the existing monogamy relations. We also give a class of tight polygamy relations of multiparty entanglement with smaller upper bounds than the existing polygamy relations, by using the power of the entanglement of assistance. It is shown that these new monogamy and polygamy relations are tighter than the former resul…
We establish a characterization of multi-qubit entanglement constraints in terms of non-negative power of entanglement measures based on unified-$(q,s)$ entropy. Using the Hamming weight of the binary vector related with the distribution of subsystems, we establish a class of tight monogamy inequalities of multi-qubit entanglement based on the $α$th-power of unified-$(q,s)$ entanglement for $α\geq 1$. For $0 \leq β\leq 1$, we establish a class of tight polygamy inequalities of multi-qubit entanglement in terms of the $β$th-power of unified-$(q,s)$ entanglement of assistance. Thus our results c…
We establish tight upper and lower bounds for the Entanglement of Formation of an arbitrary two-mode Gaussian state employing necessary properties of Gaussian channels. Both bounds are strictly given by the Entanglement of Formation of symmetric Gaussian states, which are simply constructed from the reduced states obtained by partial trace of the original one.
The first stage of the hybrid quantum repeaters is entanglement generation based on transmission of pulses in coherent states over a lossy channel. Protocols to make entanglement with only one type of error are favorable for rendering subsequent entanglement distillation efficient. Here we provide the tight upper bound on performances of these protocols that is determined only by the channel loss. In addition, we show that this bound is achievable by utilizing a proposed protocol [arXiv:0811.3100] composed of a simple combination of linear optical elements and photon-number-resolving detectors…
Quantum entanglement for multiparty system has a unique feature when it comes to sharing its property among various subsystems. This is famously stated as the monogamy of entanglement. The traditional monogamy of concurrence for tripartite system was proved in a sum form. Recently, it was found that concurrence also respects a monogamy in the product form. Here, we prove a tight monogamy relation in the product form for the concurrence of pure tripartite systems. We illustrate our relation with several examples, including the canonical three qubit states, where this monogamy relation is satura…
Quantum entanglement cannot be unlimitedly shared among arbitrary number of qubits. Larger the number of entangled pairs in an N-qubit system, smaller the degree of bi-partite entanglement is. We analyze a system of N qubits in which an arbitrary pair of particles is entangled. We show that the maximum degree of entanglement (measured in the concurrence) between any pair of qubits is 2/N. This tight bound can be achieved when the qubits are prepared in a pure symmetric (with respect to permutations) state with just one qubit in the basis state |0> and the others in the basis state |1>.
We analyze tight informationally complete measurements for arbitrarily large multipartite systems and study their configurations of entanglement. We demonstrate that tight measurements cannot be exclusively composed neither of fully separable nor maximally entangled states. We establish an upper bound on the maximal number of fully separable states allowed by tight measurements and investigate the distinguished case, in which every measurement operator carries the same amount of entanglement. Furthermore, we introduce the notion of nested tight measurements, i.e. multipartite tight information…
We derive lower limits on the inefficiency and classical communication costs of dilution between two-term bipartite pure states that are partially entangled. We first calculate explicit relations between the allowable error and classical communication costs of entanglement dilution using the protocol of Lo-Popescu and then consider a two-stage dilution from singlets with this protocol followed by some unknown protocol for conversion between partially entangled states. Applying the lower bounds on classical communication and inefficiency of Harrow-Lo and Hayden-Winter to this two-stage protocol…
We propose a Bell inequality for high-dimensional bipartite systems obtained by binning local measurement outcomes and show that it is tight. We find a binning method for even d-dimensional measurement outcomes for which this Bell inequality is maximally violated by maximally entangled states. Furthermore, we demonstrate that the Bell inequality is applicable to continuous variable systems and yields strong violations for two-mode squeezed states.
We show that quantum entanglement has a very close classical analogue, namely secret classical correlations. The fundamental analogy stems from the behavior of quantum entanglement under local operations and classical communication and the behavior of secret correlations under local operations and public communication. A large number of derived analogies follow. In particular teleportation is analogous to the one-time-pad, the concept of ``pure state'' exists in the classical domain, entanglement concentration and dilution are essentially classical secrecy protocols, and single copy entangleme…
We establish a general method for proving bounds on the information that can be extracted via arbitrary entangled measurements on tensor products of hidden subgroup coset states. When applied to the symmetric group, the method yields an Omega(n log n) lower bound on the number of coset states over which we must perform an entangled measurement in order to obtain non-negligible information about a hidden involution. These results are tight to within a multiplicative constant and apply, in particular, to the case relevant for the Graph Isomorphism problem. Part of our proof was obtained after le…
We use the entanglement sampling techniques developed by Dupuis, Fawzi and Wehner to find a lower bound on the entanglement needed by a coalition of cheater attacking the quantum position verification protocol using the four BB84 states in the scenario where the cheaters have no access to a quantum channel but share a (possibly mixed) entangled state $\tildeΦ$. For a protocol using n qubits, a necessary condition for cheating is that the max- relative entropy of entanglement $E_{\max}(\tildeΦ)\ge n-O(\log n)$. This improves previously known best lower bound by a factor $\sim4$, and it is essen…
We find tight lower and upper bounds on the entanglement of a superposition of two bipartite states in terms of the entanglement of the two states constituting the superposition. Our upper bound is dramatically tighter than the one presented in Phys. Rev. Lett 97, 100502 (2006) and our lower bound can be used to provide lower bounds on different measures of entanglement such as the entanglement of formation and the entanglement of subspaces. We also find that in the case in which the two states are one-sided orthogonal, the entanglement of the superposition state can be expressed explicitly in…
For two qubits in a pure state there exists a one-to-one relation between the entanglement measure (the concurrence ${\cal C}$) and the maximal violation ${\cal M}$ of a Bell inequality. No such relation exists for the three-qubit analogue of ${\cal C}$ (the tangle $τ$), but we have found that numerical data is consistent with a simple set of upper and lower bounds for $τ$ given ${\cal M}$. The bounds on $τ$ become tighter with increasing ${\cal M}$, so they are of practical use. The Svetlichny form of the Bell inequality gives tighter bounds than the Mermin form. We show that the bounds can b…
We derive tight quadratic inequalities for all kinds of hybrid separable-inseparable $n$-particle density operators on an arbitrary dimensional space. This methodology enables us to truly derive a tight quadratic inequality as tests for full $n$-partite entanglement in various Bell-type correlation experiments on the systems that may not be identified as a collection of qubits, e.g., those involving photons measured by incomplete detectors. It is also proved that when the two measured observables are assumed to precisely anti-commute, a stronger quadratic inequality can be used as a witness of…
We investigate how the genuine multipartite entanglement is distributed among the components of superposed states. Analytical lower and upper bounds for the usual multipartite negativity and the genuine multipartite entanglement negativity are derived. These bounds are shown to be tight by detailed examples.
An upper bound on the low-entanglement remote state preparation (RSP) ebits vs. bits tradeoff curve (Bennett et al.,quant-ph/0006044) is found using techniques of classical information theory. We prove our coding scheme to be optimal amongst an important class of protocols, and conjecture the bound to be tight.
We give an explicit tight lower bound for the entanglement of formation for arbitrary bipartite mixed states by using the convex hull construction of a certain function. This is achieved by revealing a novel connection among the entanglement of formation, the well-known Peres-Horodecki and realignment criteria. The bound gives a quite simple and efficiently computable way to evaluate quantitatively the degree of entanglement for any bipartite quantum state.
The parameterized entanglement monotone, the $q$-concurrence, is also a reasonable parameterized entanglement measure. By exploring the properties of the $q$-concurrence with respect to the positive partial transposition and realignment of density matrices, we present tight lower bounds of the $q$-concurrence for arbitrary $q\geqslant 2$. Detailed examples are given to show that the bounds are better than the previous ones.
Probabilities of measurement outcomes of two-particle entangled states give a physically transparent interpretation of the concurrence and of the I-concurrence as entanglement measures. The (I)-concurrence can thus be measured experimentally. The tight connection between these measures and Bell inequalities is highlighted.
Quantum communication between remote superconducting systems is being studied intensively to increase the number of integrated superconducting qubits and to realize a distributed quantum computer. Since optical photons must be used for communication outside a dilution refrigerator, the direct conversion of microwave photons to optical photons has been widely investigated. However, the direct conversion approach suffers from added photon noise, heating due to a strong optical pump, and the requirement for large cooperativity. Instead, for quantum communication between superconducting qubits, we…
We investigate monogamy relations related to the Rényi-$α$ entanglement and polygamy relations related to the Rényi-$α$ entanglement of assistance. We present new entanglement monogamy relations satisfied by the $μ$-th power of Rényi-$α$ entanglement with $α\in[\sqrt{7}-1)/2,(\sqrt{13}-1)/2]$ for $μ\geqslant2$, and polygamy relations satisfied by the $μ$-th power of Rényi-$α$ entanglement of assistance with $α\in[\sqrt{7}-1)/2,(\sqrt{13}-1)/2]$ for $0\leqμ\leq1$. These relations are shown to be tighter than the existing ones.
The entanglement of superpositions [Phys. Rev. Lett. 97, 100502 (2006)] is generalized to the multipartite scenario: an upper bound to the multipartite entanglement of a superposition is given in terms of the entanglement of the superposed states and the superposition coefficients. This bound is proven to be tight for a class of states composed by an arbitrary number of qubits. We also extend the result to a large family of quantifiers which includes the negativity, the robustness of entanglement, and the best separable approximation measure.
We give a simple example of the tight connection between entanglement and coherence for pure bipartite systems showing the double role played by entanglement; it allows for the creation of superpositions of macroscopic objects but at the same time makes subsystems lose their quantum mechanical coherence. For this we study the time evolution of the spin coherence in the Stern-Gerlach (SG) experiment. We also show that, contrary to the naive intuition, the spin coherence is lost before the two beams become separated in the spatial coordinates.
We derive an analytical expression for the lower bound of the concurrence of mixed quantum states of composite 2xK systems. In contrast to other, implicitly defined entanglement measures, the numerical evaluation of our bound is straightforward. We explicitly evaluate its tightness for general mixed states of 2x3 systems, and identify a large class of states where our expression gives the exact value of the concurrence.
We prove a set of tight entanglement inequalities for arbitrary $N$-qubit pure states. By focusing on all bi-partite marginal entanglements between each single qubit and its remaining partners, we show that the inequalities provide an upper bound for each marginal entanglement, while the known monogamy relation establishes the lower bound. The restrictions and sharing properties associated with the inequalities are further analyzed with a geometric polytope approach, and examples of three-qubit GHZ-class and W-class entangled states are presented to illustrate the results.
We study the norms of the Bloch vectors for arbitrary $n$-partite quantum states. A tight upper bound of the norms is derived for $n$-partite systems with different individual dimensions. These upper bounds are used to deal with the separability problems. Necessary conditions are presented for $\mathbf m$-separable states in $n$-partite quantum systems. Based on the upper bounds, classification of multipartite entanglement is illustrated with detailed examples.
We investigate tight monogamy relations of multiparty quantum entanglement for any quantum state in this paper. First, we obtain a class of lower bounds for multiparty quantum systems which improve the previous results. Next, we establish a class of tighter monogamy relations in tripartite quantum systems by means of the new inequality. Furthermore, we generalize this relations to multiparty quantum systems. And then we prove the lower bounds we obtained are larger than the existing ones. Detailed examples are provided at last.
We derive analytical upper bounds for the entanglement of generalized Greenberger-Horne-Zeilinger states coupled to locally depolarizing and dephasing environments, and for local thermal baths of arbitrary temperature. These bounds apply for any convex quantifier of entanglement, and exponential entanglement decay with the number of constituent particles is found. The bounds are tight for depolarizing and dephasing channels. We also show that randomly generated initial states tend to violate these bounds, and that this discrepancy grows with the number of particles.
We introduce a method to lower bound an entropy-based measure of genuine multipartite entanglement via nonlinear entanglement witnesses. We show that some of these bounds are tight and explicitly work out their connection to a framework of nonlinear witnesses that were published recently. Furthermore we provide a detailed analysis of these lower bounds in the context of other possible bounds and measures. In exemplary cases we show that only a few local measurements are necessary to determine these lower bounds.
Quantum entanglement distillation protocols are LOCC protocols between Alice and Bob that convert imperfect EPR pairs, or, in general, partially entangled bipartite states into perfect or near-perfect EPR pairs. The classical communication complexity of these protocols is the minimal amount of classical communication needed for the conversion. In this paper, we focus on the communication complexity of protocols that operate with incomplete information, i.e., where the inputs are mixed states and/or prepared adversarially. We study 3 models of imperfect EPR pairs. In the measure-r model, r out …
As two of the most important entanglement measures--the entanglement of formation and the entanglement of distillation--have so far been limited to bipartite settings, the study of other entanglement measures for multipartite systems appears necessary. Here, connections between two other entanglement measures--the relative entropy of entanglement and the geometric measure of entanglement--are investigated. It is found that for arbitrary pure states the latter gives rise to a lower bound on the former. For certain pure states, some bipartite and some multipartite, this lower bound is saturated,…
Although it is well known that the amount of resources that can be asymptotically distilled from a quantum state or channel does not exceed the resource cost needed to produce it, the corresponding relation in the non-asymptotic regime hitherto has not been well understood. Here, we establish a quantitative relation between the one-shot distillable resource yield and dilution cost in terms of transformation errors involved in these processes. Notably, our bound is applicable to quantum state and channel manipulation with respect to any type of quantum resource and any class of free transformat…
Quantum state teleportation is a protocol where a shared entangled state is used as a quantum channel to transmit quantum information between distinct locations. Here we consider the task of estimating entanglement in teleportation experiments. We show that the data accessible in a teleportation experiment allows to put a lower bound on some entanglement measures, such as entanglement negativity and robustness. Furthermore, we show cases in which the lower bounds are tight. The introduced lower bounds can also be interpreted as quantifiers of the nonclassicality of a teleportation experiment. …
Generalized electrostatic quantum swap gate implemented in the chain of 2 double coupled quantum dots using single electron in semiconductor is presented in tight-binding simplistic model specifying both analytic and numerical results. The anticorrelation principle coming from Coulomb electrostatic repulsion is exploited in single electron devices. The formation of quantum entanglement is specified and supported by analytical results. The difference between classical and quantum picture is given. The correlations between geometry of quantum structures and entanglement dynamics are shown in ana…
Quantifying entanglement in a quantum system generally requires a complete quantum tomography followed by the NP-hard computation of an entanglement monotone --- requirements that rapidly become intractable at higher dimensions. Observing entanglement in large quantum systems has consequently been relegated to witnesses that only verify its existence. In this article, we show that the violation of recent entropic witnesses of the Einstein-Podolsky-Rosen paradox also provides tight lower bounds to multiple entanglement measures, such as the entanglement of formation and the distillable entangle…
It is shown that, if the loss of entanglement along a quantum channel is sufficiently small, then approximate quantum error correction is possible, thereby generalizing what happens for coherent information. Explicit bounds are obtained for the entanglement of formation and the distillable entanglement, and their validity naturally extends to other bipartite entanglement measures in between. Robustness of derived criteria is analyzed and their tightness compared. Finally, as a byproduct, we prove a bound quantifying how large the gap between entanglement of formation and distillable entangleme…
We develop a model for a noisy communication channel in which the noise affecting consecutive transmissions is correlated. This model is motivated by fluctuating birefringence of fiber optic links. We analyze the role of entanglement of the input states in optimizing the classical capacity of such a channel. Assuming a general form of an ensemble for two consecutive transmissions, we derive tight bounds on the classical channel capacity depending on whether the input states used for communication are separable or entangled across different temporal slots. This result demonstrates that by an ap…
We exactly evaluate a number of multipartite entanglement measures for a class of graph states, including d-dimensional cluster states (d = 1,2,3), the Greenberger-Horne-Zeilinger states, and some related mixed states. The entanglement measures that we consider are continuous, `distance from separable states' measures, including the relative entropy, the so-called geometric measure, and robustness of entanglement. We also show that for our class of graph states these entanglement values give an operational interpretation as the maximal number of graph states distinguishable by local operations…
By testing the classical correlation violation between two systems, the random number can be expanded and certified without applying classical statistical method. In this work, we propose a new random number expansion protocol without entanglement, and the randomness can be guaranteed only by the 2-dimension quantum witness violation. Furthermore, we only assume that the dimensionality of the system used in the protocol has a tight bound, and the whole protocol can be regarded as a semi-device independent black-box scenario. Comparing with the device independent random number expansion protoco…
The entanglement content of superpositions of quantum states is investigated based on a measure called {\it concurrence}. Given a bipartite pure state in arbitrary dimension written as the quantum superposition of two other such states, we find simple inequalities relating the concurrence of the state to that of its components. We derive an exact expression for the concurrence when the component states are biorthogonal, and provide elegant upper and lower bounds in all other cases. For quantum bits, our upper bound is tighter than the previously derived bound in [Phys. Rev. Lett. 97, 100502 (2…
We exhibit a two-parameter class of states $ρ_{(α,γ)}$, in $2\otimes n$ quantum system for $n\ge 3$, which can be obtained from an arbitrary state by means of local quantum operations and classical communication, and which are invariant under all bilateral %unitary operations %of the form $U\otimes U$ on $2\otimes n$ quantum system. We calculate the negativity of $ρ_{(α,γ)}$, and a lower bound and a tight upper bound on its entanglement of formation. It follows from this calculation that the entanglement of formation of $ρ_{(α,γ)}$ cannot exceed its negativity.
