Concentrating Tripartite Quantum Information

Streltsov, Alexander; Lee, Soojoon; Adesso, Gerardo

doi:10.1103/physrevlett.115.030505

Cited by 65 publications

(120 citation statements)

References 39 publications

Supporting

Mentioning

120

Contrasting

Order By: Relevance

“…In particular, it has been used to explain the quantum advantage of many emerging quantum computation tasks, including quantum state merging [6], deterministic quantum computation with one qubit [7], Deutsch-Jozsa algorithm [8], and Grover search algorithm [9]. The resource theory of coherence also provides a basis for interpreting the wave nature of a quantum system [10,11] and the essence of quantum correlations such as quantum entanglement [12][13][14][15][16][17] and various discordlike quantum correlations [7,[17][18][19][20][21][22].…”

Section: Introductionmentioning

confidence: 99%

Steered quantum coherence as a signature of quantum phase transitions in spin chains

Gao

Fan

2020

Phys. Rev. A

View full text Add to dashboard Cite

We propose to use the steered quantum coherence (SQC) as a signature of quantum phase transitions (QPTs). By considering various spin chain models, including the transverse-field Ising model, XY model, and XX model with three-spin interaction, we showed that the SQC and its first-order derivative succeed in signaling different critical points of QPTs. In particular, the SQC method is effective for any spin pair chosen from the chain, and the strength of SQC, in contrast to entanglement and quantum discord, is insensitive to the distance (provided it is not very short) of the tested spins, which makes it convenient for practical use as there is no need for careful choice of two spins in the chain.

show abstract

Section: Introductionmentioning

confidence: 99%

Steered quantum coherence as a signature of quantum phase transitions in spin chains

Gao

Fan

2020

Phys. Rev. A

View full text Add to dashboard Cite

show abstract

“…This follows from the fact that in this situation Bob and Charlie can achieve perfect asymptotic merging for the purification of ρ just by using LOCC [1,2,8]. Moreover, equation (8) also implies that states satisfying equation (7) have nonzero measure in the set of all states, since this is evidently true for states satisfying equation (8).…”

Section: Perfect Asymptotic Pqsmmentioning

confidence: 96%

“…In contrast to standard quantum state merging, Bob and Charlie can use unlimited amount of PPT entangled states, see figure 1 for illustration. The situation where Bob and Charlie do not have access to PPT entangled states is known as LOCC quantum state merging (LQSM), and has been introduced in [8].…”

Section: Introductionmentioning

confidence: 99%

Quantum state merging with bound entanglement

Streltsov

2020

New J. Phys.

Self Cite

View full text Add to dashboard Cite

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.

show abstract

“…To do this, Charlie uses an ancillary quantum register R, general state is as σ ABCR = ρ ABC ⊗ρ R , now Bob and Charlie perform an LOCC protocol to maximizes the mutual information between Alice and Charlie. The corresponding maximal mutual information between Alice and Charlie is called concentrated information [27] I(ρ ABC ) = max…”

Section: Concentrated Information and Uncertainty Lower Boundmentioning

confidence: 99%

“…It can be said explicitly that Charlie can improve its uncertainty about Alice's measurement outcomes with the help of Bob. In this case, the CI and the one-way CI is equal, and are given by [27] I(ρ AB ⊗ρ C ) = I → (ρ AB ⊗ρ C ) = I(A: B)−D(A|B), (18) where D(A|B) is quantum discord [29]. We study a case in which Alice, Bob and Charlie share a tripartite state of the following form…”

Section: B Example IImentioning

confidence: 99%

Reducing the entropic uncertainty lower bound in the presence of quantum memory via LOCC

Adabi¹,

Haseli²,

Salimi³

2016

EPL

View full text Add to dashboard Cite

The uncertainty principle sets lower bound on the uncertainties of two incompatible observables measured on a particle. The uncertainty lower bound can be reduced by considering a particle as a quantum memory entangled with the measured particle. In this paper, we consider a tripartite scenario in which a quantum state has been shared between Alice, Bob, and Charlie. The aim of Bob and Charlie is to minimize Charlie's lower bound about Alice's measurement outcomes. To this aim, they concentrate their correlation with Alice in Charlie's side via a cooperative strategy based on local operations and classical communication. We obtain lower bound for Charlie's uncertainty about Alice's measurement outcomes after concentrating information and compare it with the lower bound without concentrating information in some examples. We also provide a physical interpretation of the entropic uncertainty lower bound based on the dense coding capacity.

show abstract

Concentrating Tripartite Quantum Information

Cited by 65 publications

References 39 publications

Steered quantum coherence as a signature of quantum phase transitions in spin chains

Steered quantum coherence as a signature of quantum phase transitions in spin chains

Quantum state merging with bound entanglement

Reducing the entropic uncertainty lower bound in the presence of quantum memory via LOCC

Contact Info

Product

Resources

About