We introduce the concentrated information of tripartite quantum states. For three parties Alice, Bob, and Charlie, it is defined as the maximal mutual information achievable between Alice and Charlie via local operations and classical communication performed by Charlie and Bob. We derive upper and lower bounds to the concentrated information, and obtain a closed expression for it on several classes of states including arbitrary pure tripartite states in the asymptotic setting. We show that distillable entanglement, entanglement of assistance, and quantum discord can all be expressed in terms of the concentrated information, thus revealing its role as a unifying informational primitive. We finally investigate quantum state merging of mixed states with and without additional entanglement. The gap between classical and quantum concentrated information is proven to be an operational figure of merit for mixed state merging in the absence of additional entanglement. Contrary to the pure state merging, our analysis shows that classical communication in both directions can provide an advantage for merging of mixed states.
We introduce the concentrated information of tripartite quantum states. For three parties Alice, Bob, and Charlie, it is defined as the maximal mutual information achievable between Alice and Charlie via local operations and classical communication performed by Charlie and Bob. We derive upper and lower bounds to the concentrated information, and obtain a closed expression for it on several classes of states including arbitrary pure tripartite states in the asymptotic setting. We show that distillable entanglement, entanglement of assistance, and quantum discord can all be expressed in terms of the concentrated information, thus revealing its role as a unifying informational primitive. We finally investigate quantum state merging of mixed states with and without additional entanglement. The gap between classical and quantum concentrated information is proven to be an operational figure of merit for mixed state merging in the absence of additional entanglement. Contrary to the pure state merging, our analysis shows that classical communication in both directions can provide an advantage for merging of mixed states.
Suppose two distant observers Alice and Bob share a pure biparticle entangled state secretly chosen from a set, it is shown that Alice (Bob) can probabilistic concentrate the state to a maximally entangled state by applying local operations and classical communication (LQCC) if and only if the states in the set share the same marginal density operator for her (his) subsystem. Applying this result, we present probabilistic superdense coding and show that perfect purification of mixed state is impossible using only LQCC on individual particles.
Abstract Quantum state merging is one of the most important protocols in quantum information theory. In this task two parties aim to merge their parts of a pure tripartite state by making use of additional singlets while preserving correlations with a third party. We study a variation of this scenario where the shared state is not necessarily pure, and the merging parties have free access to local operations, classical communication, and positive partial transpose (PPT) entangled states. We provide general conditions for a state to admit perfect merging, and present a family of fully separable states which cannot be perfectly merged if the merging parties have no access to additional singlets. We also show that free PPT entangled states do not give any advantage for merging of pure states, and the conditional entropy plays the same role as in standard quantum state merging quantifying the rate of additional singlets needed to perfectly merge the state.
Local pure states are an important resource for quantum computing. The problem of distilling local pure states from mixed ones can be cast in an information theoretic paradigm. The bipartite version of this problem where local purity must be distilled from an arbitrary quantum state shared between two parties, Alice and Bob, is closely related to the problem of separating quantum and classical correlations in the state and in particular, to a measure of classical correlations called the one-way distillable common randomness. In Phys. Rev. A 71, 062303 (2005), the optimal rate of local purity distillation is derived when many copies of a bipartite quantum state are shared between Alice and Bob, and the parties are allowed unlimited use of a unidirectional dephasing channel. In the present paper, we extend this result to the setting in which the use of the channel is bounded. We demonstrate that in the case of a classical-quantum system, the expression for the local purity distilled is efficiently computable and provide examples with their tradeoff curves.
We consider the task of distilling local purity from a noisy quantum state ρABC, wherein we provide a protocol for three parties, Alice, Bob and Charlie, to distill local purity (at a rate P) from many independent copies of a given quantum state ρABC. The three parties have access to their respective subsystems of ρABC, and are only allowed to use local unitary operations. In addition, Alice and Bob can communicate with Charlie using a one-way multiple-access dephasing channel of link rates R1and R2, respectively. The objective of the protocol is to minimize the usage of the dephasing channel (in terms of rates R1and R2) while maximizing the asymptotic purity that can be jointly distilled from ρABC. To achieve this, we employ ideas from distributed measurement compression protocols, and in turn, characterize a set of sufficient conditions on (P, R1,R2) in terms of quantum information theoretic quantities such that P amount of purity can be distilled using rates R1and R2.
In the task of assisted coherence distillation via the set of operations X, where X is either local incoherent operations and classical communication (LICC), local quantum-incoherent operations and classical communication (LQICC), separable incoherent operations (SI), or separable quantum incoherent operations (SQI), two parties, namely Alice and Bob, share many copies of a bipartite joint state. The aim of the process is to generate the maximal possible coherence on the subsystem of Bob. In this paper, we investigate the assisted coherence distillation of some special mixed states, the states with vanished basis-dependent discord and Werner states. We show that all the four sets of operations are equivalent for assisted coherence distillation, whenever Alice and Bob share one of those mixed quantum states. Moreover, we prove that the assisted coherence distillation of the former can reach the upper bound, namely QI relative entropy, while that of the latter can not. Meanwhile, we also present a sufficient condition such that the assistance of Alice via the set of operations X can not help Bob improve his distillable coherence, and this condition is that the state shared by Alice and Bob has vanished basis-dependent discord.
Quantum information distribution in a tripartite state plays a fundamental role in quantum information processes. Here we investigate how a bipartite unitary transformation UAB redistributes the quantum mutual information with the third party C in a tripartite pure state ${|\ensuremath{\psi}\ensuremath{\rangle}}_{ABC}$ in a ${d}_{A}\ifmmode\times\else\texttimes\fi{}{d}_{B}\ifmmode\times\else\texttimes\fi{}{d}_{C}$-dimensional Hilbert space. In particular, we focus on finding out the optimal unitary transformation UAB∗ that maximizes the quantum mutual entropy between party A and party $C, I(A:C)=S({\ensuremath{\rho}}_{A})\ensuremath{-}S({\ensuremath{\rho}}_{B})+S({\ensuremath{\rho}}_{C})$. We show that the mutual entropy I(A:C) is upper bounded by $2S({\ensuremath{\rho}}_{C})$ derived from the Araki-Lieb inequality. This upper bound can be realized via an optimal unitary transformation for any pure state with the rank rC of ${\ensuremath{\rho}}_{C}$ satisfying ${r}_{C}\ensuremath{\le}{d}_{A}$. For a generic pure state with rC>dA, the upper bound cannot be realized by any bipartite unitary transformation. To maximize the mutual entropy in the later case, we propose a fast numerical algorithm to produce an approximate optimal unitary transformation, where our optimization is transformed into a modified number partition problem. The validness of our algorithm is confirmed by its comparison with the results from the Adam algorithm for parameterized unitary transformations. Our approximate algorithm thus provides a practical protocol to implement redistribution of quantum mutual information for a tripartite quantum state with high dimensions.