Classical communication plays a crucial role to distinguish locally a class of quantum states. Despite considerable advances, we have very little knowledge about the number of measurement and communication rounds needed to implement a discrimination task by local quantum operations and classical communications (in short, LOCC). In this letter, we are able to show the relation between round numbers with the local discrimination of a set of pure bipartite orthogonal quantum states. To demonstrate the possible strong dependence on the round numbers, we consider a class of orthogonal product states in $d\otimes d$, which require at least $2d-2$ round of classical communications. Curiously the round number can be reduced to $d$ by the assistance of one-ebit of entanglement as resource and can be reduced further by assistance of more entanglement. We are also able to show that the number of LOCC rounds needed for a discrimination task may depend on the amount of entanglement assistances.
We investigate the time evolution of the entanglement of assistance when one subsystem undergoes the action of local noisy channels. A general factorization law is presented for the evolution equation of entanglement of assistance. Our results demonstrate that the dynamics of the entanglement of assistance is determined by the action of a noisy channel on the pure maximally entangled state, in which the entanglement reduction turns out to be universal for all quantum states entering the channel. This single quantity will make it easy to characterize the entanglement dynamics of entanglement of…
We investigate the entanglement of assistance which quantifies capabilities of producing pure bipartite entangled states from a pure tripartite state. The lower bound and upper bound of entanglement of assistance are obtained. In the light of the upper bound, monogamy constraints are proved for arbitrary n-qubit states.
We prove a new polygamy relation of multi-party quantum entanglement in terms of Rényi-$α$ entanglement of assistance for $\left( {\sqrt 7 - 1} \right)/2\leqα\leq \left( {\sqrt 13 - 1} \right)/2$. This class of polygamy inequality reduces to the polygamy inequality based on entanglement of assistance since Rényi-$α$ entanglement is a generalization of entanglement of formation. We further show that the polygamy inequality also holds for the $μ$th power of Rényi-$α$ entanglement of assistance.
We propose an approach to distribute high-fidelity long-range entanglement in a quantum network assisted by the entanglement supplied by auxiliary short-range paths between the network nodes. Entanglement assistance in the form of shared catalyst states is utilized to maximize the efficiency of entanglement concentration transformations over the edges of the network. The catalyst states are recycled for use in adaptive operations at the network nodes and replenished periodically using the auxiliary short-range paths. The rate of long-range entanglement distribution using such entanglement assi…
Coherence and entanglement are fundamental concepts in resource theory. The coherence (entanglement) of assistance is the coherence (entanglement) that can be extracted assisted by another party with local measurement and classical communication. We introduce and study the general coherence of assistance. First, in terms of real symmetric concave functions on the probability simplex, the coherence of assistance and the entanglement of assistance are shown to be in one-to-one correspondence. We then introduce two classes of quantum states: the assisted maximally coherent states and the assisted…
The entanglement of assistance quantifies the entanglement that can be generated between two parties, Alice and Bob, given assistance from a third party, Charlie, when the three share a tripartite state and where the assistance consists of Charlie initially performing a measurement on his share and communicating the result to Alice and Bob through a one-way classical channel. We argue that if this quantity is to be considered an operational measure of entanglement, then it must be understood to be a tripartite rather than a bipartite measure. We compare it with a distinct tripartite measure th…
The newfound importance of ``entanglement as a resource'' in quantum computation and quantum communication compels us to quantify it in as many distinct ways as possible. Here we explore a new measure of entanglement for mixed quantum states of bipartite systems, which we name the Entanglement of Assistance. We show it to be the maximum average entanglement of all pure-state ensembles consistent with the given density matrix. In this sense, the Entanglement of Assistance is a quantity directly dual to the more standard Entanglement of Formation. With the help of lower and upper bounds, we calc…
Certain quantum information tasks require entanglement of assistance, namely a reduction of a tripartite entangled state to a bipartite entangled state via local measurements. We establish that 'concurrence of assistance' (CoA) identifies capabilities and limitations to producing pure bipartite entangled states from pure tripartite entangled states and prove that CoA is an entanglement monotone for $(2\times2\times n)$-dimensional pure states. Moreover, if the CoA for the pure tripartite state is at least as large as the concurrence of the desired pure bipartite state, then the former may be t…
We consider the maximum bipartite entanglement that can be distilled from a single copy of a multipartite mixed entangled state, where we focus mostly on $d\times d\times n$-dimensional tripartite mixed states. We show that this {\em assisted entanglement}, when measured in terms of the generalized concurrence (named G-concurrence) is (tightly) bounded by an entanglement monotone, which we call the G-concurrence of assistance. The G-concurrence is one of the possible generalizations of the concurrence to higher dimensions, and for pure bipartite states it measures the {\em geometric mean} of t…
We consider a variant of the entanglement of assistance, as independently introduced by D.P. DiVincenzo {\em et al.} ({\tt quant-ph/9803033}) and O. Cohen (Phys. Rev. Lett. {\bf 80}, 2493 (1998)). Instead of considering three-party states in which one of the parties, the assistant, performs a measurement such that the remaining two parties are left with on average as much entanglement as possible, we consider four-party states where two parties play the role of assistants. We answer several questions that arise naturally in this scenario, such as (i) how much more entanglement can be produced …
We show that bipartite entanglement distribution (or entanglement of assistance) in multipartite quantum systems is by nature polygamous. We first provide an analytic upper bound for the concurrence of assistance in bipartite quantum systems, and derive a polygamy inequality of multipartite entanglement in arbitrary dimensional quantum systems.
In the present paper we introduce and study Bosonic Gaussian classical-quantum (c-q) channels; the embedding of the classical input into quantum is always possible and therefore the classical entanglement-assisted capacity C_{ea} under appropriate input constraint is well defined. We prove a general property of entropy increase for weak complementary channel, that implies the equality C_{ea}=C (where C is the unassisted capacity) for certain class of c-q Gaussian channel under appropriate energy-type constraint. On the other hand, we show by explicit example that the inequality C<C_{ea} is not…
Entanglement monogamy is a fundamental property of multipartite entangled states. We investigate the monogamy relations for multiqubit generalized W-class states. Analytical monogamy inequalities are obtained for the concurrence of assistance, the entanglement of formation and the entanglement of assistance.
We establish a unified view of polygamy of multi-qubit entanglement. We first introduce a two-parameter generalization of entanglement of assistance namely unified entanglement of assistance for bipartite quantum states, and provide an analytic lowerbound in two-qubit systems. We show a broad class of polygamy inequalities of multi-qubit entanglement in terms of unified entanglement of assistance that encapsulates all known multi-qubit polygamy inequalities as special cases. We further show that this class of polygamy inequalities can be improved into tighter inequalities for three-qubit syste…
Finding the optimal encoding strategies can be challenging for communication using quantum channels, as classical and quantum capacities may be superadditive. Entanglement assistance can often simplify this task, as the entanglement-assisted classical capacity for any channel is additive, making entanglement across channel uses unnecessary. If the entanglement assistance is limited, the picture is much more unclear. Suppose the classical capacity is superadditive, then the classical capacity with limited entanglement assistance could retain superadditivity by continuity arguments. If the class…
We investigate the monogamy relations related to the concurrence and the entanglement of formation. General monogamy inequalities given by the αth power of concurrence and entanglement of formation are presented for N-qubit states. The monogamy relation for entanglement of assistance is also established. Based on these general monogamy relations, the residual entanglement of concurrence and entanglement of formation are studied. Some relations among the residual entanglement, entanglement of assistance, and three tangle are also presented.
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…
We find that the asymptotic entanglement of assistance of a general bipartite mixed state is equal to the smaller of its two local entropies. Our protocol gives rise to the asymptotically optimal EPR pair distillation procedure for a given tripartite pure state, and we show that it actually yields EPR and GHZ states; in fact, under a restricted class of protocols, which we call "one-way broadcasting", the GHZ-rate is shown to be optimal. This result implies a capacity theorem for quantum channels where the environment helps transmission by broadcasting the outcome of an optimally chosen measur…
Monogamy relations characterize the distributions of entanglement in multipartite systems. We investigate monogamy relations for multiqubit generalized W-class states. We present new analytical monogamy inequalities for the concurrence of assistance, which are shown to be tighter than the existing ones. Furthermore, analytical monogamy inequalities are obtained for the negativity of assistance.
Entanglement resources can increase transmission rates substantially. Unfortunately, entanglement is a fragile resource that is quickly degraded by decoherence effects. In order to generate entanglement for optical communication, the transmitter and the receiver first prepare entangled spin-photon pairs locally, and then the photon at the transmitter is sent to the receiver through an optical fiber or free space. Without feedback, the transmitter does not know whether the entangled photon has reached the receiver. The present work introduces a new model of unreliable entanglement assistance, w…
We propose a condition for a measure of quantum correlation to be polygamous without the traditional polygamy inequality. It is shown to be equivalent to the standard polygamy inequalities for any continuous measure of quantum correlation with the polygamy power. We then show that any entanglement of assistance is polygamous but not monogamous and any faithful entanglement measure is not polygamous.
We investigate the polygamy relations related to the concurrence of assistance for any multipartite pure states. General polygamy inequalities given by the $α$th $(0\leq α\leq 2)$ power of concurrence of assistance is first presented for multipartite pure states in arbitrary-dimensional quantum systems. We further show that the general polygamy inequalities can even be improved to be tighter inequalities under certain conditions on the assisted entanglement of bipartite subsystems. Based on the improved polygamy relations, lower bound for distribution of bipartite entanglement is provided in a…
Communication rates over quantum channels can be boosted by entanglement, via superadditivity phenomena or entanglement assistance. Superadditivity refers to the capacity improvement from entangling inputs across multiple channel uses. Nevertheless, when unlimited entanglement assistance is available, the entanglement between channel uses becomes unnecessary -- the entanglement-assisted (EA) capacity of a single-sender and single-receiver channel is additive. We generalize the additivity of EA capacity to general multiple-access channels (MACs) for the total communication rate. Furthermore, fo…
Quantum information theory determines the maximum rates at which information can be transmitted through physical systems described by quantum mechanics. Here we consider the communication protocol known as quantum reading. Quantum reading is a protocol for retrieving the information stored in a digital memory by using a quantum probe, e.g., shining quantum states of light to read an optical memory. In a variety of situations using a quantum probe enhances the performances of the reading protocol in terms of fidelity, data density and energy dissipation. Here we review and characterize the quan…
We evaluate the one-shot entanglement of assistance for an arbitrary bipartite state. This yields another interesting result, namely a characterization of the one-shot distillable entanglement of a bipartite pure state. This result is shown to be stronger than that obtained by specializing the one-shot hashing bound to pure states. Finally, we show how the one-shot result yields the operational interpretation of the asymptotic entanglement of assistance proved in [Smolin et al., Phys. Rev. A 72, 052317 (2005)].
Two-qubit operations may be characterized by their capacities for communication, both with and without free entanglement, and their capacity for creating entanglement. We establish a set of inequalities that give an ordering to the capacities of two-qubit unitary operations. Specifically, we show that the capacities for entanglement creation and bidirectional communication without entanglement assistance are at least as great as half the bidirectional communication capacity with entanglement assistance. In addition, we show that the bidirectional communication that can be performed using an en…
In this paper, we study the number of rounds of communication needed to implement certain tasks by local quantum operations and classical communication (LOCC). We find that the class of LOCC operations becomes strictly more powerful as more rounds of classical communication are permitted. Specifically, for every $n$, there always exists an $n$ round protocol that is impossible to implement in $n-2$ rounds. Furthermore, we show that certain entanglement transformations are possible if and only if the protocol uses an infinite (unbounded) number of rounds. Interestingly, the number of rounds req…
We consider multi-qubit systems and relate quantitatively the problems of generating cluster states with high value of concurrence of assistance, and that of generating states with maximal bipartite entanglement. We prove an upper bound for the concurrence of assistance. We consider dynamics of spin-1/2 systems that model qubits, with different couplings and possible presence of magnetic field to investigate the appearance of the discussed entanglement properties. We find that states with maximal bipartite entanglement can be generated by an XY Hamiltonian, and their generation can be controll…
Unlocking Exponential and Unbounded Robust Gains in Shannon Capacity of Classical Multiple Access Channels with Causal CSIT via Quantum Entanglement Assistance
We investigate the polygamy relations of multipartite quantum states. General polygamy inequalities are given in the $α$th $(α\geq 2)$ power of concurrence of assistance, $β$th $(β\geq1)$ power of entanglement of assistance, and the squared convex-roof extended negativity of assistance (SCRENoA).
We investigate the quantum-secure covert-communication capabilities of lossy thermal-noise bosonic channels, the quantum-mechanical model for many practical channels. We determine the expressions for the covert capacity of these channels: $L_{\text{no-EA}}$, when Alice and Bob share only a classical secret, and $L_{\text{EA}}$, when they benefit from entanglement assistance. We find that entanglement assistance alters the fundamental scaling law for covert communication. Instead of $L_{\text{no-EA}}\sqrt{n}-r_{\text{no-EA}}(n)$, $r_{\text{no-EA}}(n)=o(\sqrt{n})$, entanglement assistance allows…
Using entanglement of assistance, we establish a general polygamy inequality of multi-party entanglement in arbitrary dimensional quantum systems. For multi-party closed quantum systems, we relate our result with the monogamy of entanglement to show that the entropy of entanglement is an universal entanglement measure that bounds both monogamy and polygamy of multi-party quantum entanglement.
We introduce and study the l1 norm of coherence of assistance both theoretically and operationally. We first provide an upper bound for the l1 norm of coherence of assistance and show a necessary and sufficient condition for the saturation of the upper bound. For two and three dimensional quantum states, the analytical expression of the l1 norm of coherence of assistance is given. Operationally, the mixed quantum coherence can always be increased with the help of another party' s local measurement and one way classical communication since the l1 norm of coherence of assistance, as well as the …
For a classical channel, neither the Shannon capacity, nor the sum of conditional probabilities corresponding to the cases of successful transmission can be increased by the use of shared entanglement, or, more generally, a non-signaling resource. Yet, perhaps somewhat counterintuitively, entanglement assistance can help and actually elevate the chances of success even in a one-way communicational task that is to be completed by a single-shot use of a noiseless classical channel. To quantify the help that a non-signaling resource provides to a noiseless classical channel, one might ask how man…
Entanglement is known to boost the efficiency of classical communication. In distributed computation, for instance, exploiting entanglement can reduce the number of communicated bits or increase the probability to obtain a correct answer. Entanglement-assisted classical communication protocols usually consist of two successive rounds: first a Bell test round, in which the parties measure their local shares of the entangled state, and then a communication round, where they exchange classical messages. Here, we go beyond this standard approach and investigate adaptive uses of entanglement: we al…
We investigate polygamy relations of multipartite entanglement in arbitrary-dimensional quantum systems. By improving an inequality and using the $β$th ($0\leqβ\leq1$) power of entanglement of assistance, we provide a new class of weighted polygamy inequalities of multipartite entanglement in arbitrary-dimensional quantum systems. We show that these new polygamy relations are tighter than the ones given in [Phys. Rev. A 97, 042332 (2018)].
Three experiments, with an IBM superconducting quantum computer, are presented, where the setting combinations on a three qubit GHZ(like) state were selected by two additional assistant qubits. The average of the polynomial of Mermin for the three entangled qubits was calculated; the results showed violation of the inequality of Mermin. However, given that the assistant qubits selected, imposed and informed the type of settings, it was possible to interpret the results in terms of arranged relations among hidden variables of the assistants and the entanglement BEFORE each shot; the hidden vari…
We study the generation of maximally correlated states of two qubits in the absence of quantum entanglement. We show that stationary maximally correlated states can be generated under the assistance of a collective dissipative dynamics. The absence of entanglement necessarily requires maximal entanglement to an environment. The conditions under which two qubits can be maximally correlated to a finite environment are studied. We find the existence of maximally correlated states without entanglement for $3 \otimes 3$ bipartite quantum states
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…
Quantum entanglement plays essential roles in quantum information processing. The monogamy and polygamy relations characterize the entanglement distributions in the multipartite systems. We present a class of monogamy inequalities related to the $μ$th power of the entanglement measure based on Rényi-$α$ entropy, as well as polygamy relations in terms of the $μ$th powered of Rényi-$α$ entanglement of assistance. These monogamy and polygamy relations are shown to be tighter than the existing ones.
We show that for tripartite quantum pure states of qubits, all the kinds of entanglement in terms of SLOCC classification are experimentally measurable by simple projective measurements, provided that four copies of the composite quantum system are available. In particular, the entanglement of reduced density matrices, even though they are mixed states, can be exactly determined in experiment. Concurrence of assistance is also shown to be measurable by introducing an interesting equations with explicit physical meanings.
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…
Non-signaling assistance in prepare-and-measure scenarios with classical communication
Instituto de Física Gleb Wataghin, Universidade Estadual de Campinas（坎皮纳斯州立大学格莱布·瓦塔金物理研究所）；Instituto de Matemática, Estatística e Computação Científica, Universidade Estadual de Campinas（坎皮纳斯州立大学数学、统计与科学计算研究所）；Sorbonne Université, CNRS, LIP6（索邦大学法国国家科学研究中心LIP6实验室）；International Centre for Theory of Quantum Technologies, University of Gdańsk（格但斯克大学量子技术理论国际中心）；Naturwissenschaftlich-Technische Fakultät, Universität Siegen（锡根大学自然科学技术学院）
