Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0403134 · Physical Review A

Locally accessible information and distillation of entanglement

Sibasish Ghosh A, Pramod S. Joag, Guruprasad Kar, Samir Kunkri, Anirban Roy

Published Jan 18, 2005• 13 citations
arXivHTMLPDF

Abstract

A different type of complementarity relation is found between locally accessible information and final average entanglement for a given ensemble. It is also shown that in some well-known distillation protocols, this complementary relation is optimally satisfied. We discuss the interesting trade-off between locally accessible information and distillable entanglement for some states.

DOI
10.1103/physreva.71.012321

Related papers

Distillation Protocols: Output Entanglement and Local Mutual Information

Michał Horodecki, Jonathan Oppenheim, Aditi Sen +1 more

A complementary behavior between local mutual information and average output entanglement is derived for arbitrary bipartite ensembles. This leads to bounds on the yield of entanglement in distillation protocols that involve disinguishing. This bound is saturated in the hashing protocol for distillation, for Bell-diagonal states.

arXiv:quant-ph/0405185•Physical Review Letters•Oct 20, 2004•33 citations

Local distinguishability of quantum states and the distillation of entanglement

P.-X. Chen, C.-Z. Li

This paper tries to probe the relation between the local distinguishability of orthogonal quantum states and the distillation of entanglement. An new interpretation for the distillation of entanglement and the distinguishability of orthogonal quantum states in terms of information is given, respectively. By constraining our discussion on a special protocol we give a necessary and sufficient condition for the local distinguishability of the orthogonal pure states, and gain the maximal yield of the distillable entanglement. It is shown that the information entropy, the locally distinguishability of quantum states and the distillation of entanglement are closely related.

arXiv:quant-ph/0210139•Quantum Information and Computation•May 1, 2003•4 citations

Distillation protocols that involve local distinguishing: Composing upper and lower bounds on locally accessible information

Aditi Sen, Ujjwal Sen, Maciej Lewenstein

We find a universal lower bound on locally accessible information for arbitrary bipartite quantum ensembles, when one of the parties is two dimensional. In higher dimensions and in a higher number of parties, the bound is on accessible information by separable operations. We show that for any given density matrix (of an arbitrary number of parties and dimensions), there exists an ensemble, which averages to the given density matrix and whose locally accessible information saturates the lower bound. Moreover, we give a general method to obtain bounds on the yield of singlets in distillation protocols that involves local distinguishing, by using lower and upper bounds on locally accessible information. We then illustrate it by using our lower bound, along with a previously obtained upper bound, on locally accessible information.

arXiv:quant-ph/0505137•Physical Review A•Nov 22, 2006•13 citations

Distinguishing locally of quantum states and the distillation of entanglement

ping-xing. chen, Cheng-Zu Li

This paper try to probe the relation of distinguishing locally and distillation of entanglement. The distinguishing information (DI) and the maximal distinguishing information (MDI) of a set of pure states are defined. The interpretation of distillation of entanglement in term of information is given. The relation between the maximal distinguishing information and distillable entanglement is gained. As a application of this relation the distillable entanglement of Bell-diagonal states is present.

arXiv:quant-ph/0202165•Feb 27, 2002•0 citations

Universal distillation of quantum entanglement

Ryuji Takagi, Kaito Watanabe, Takaya Matsuura +2 more

Distillable entanglement---the maximum rate of Bell states extractable from the given noisy entangled states via local operations and classical communication (LOCC)---has been a central quantity to characterize the operational value of entangled states. However, this operational meaning had been known to be valid only under a crucial assumption: both parties know the description of the input state and can choose the protocol tailored to it, which does not necessarily reflect the natural operational setting. Here, we show that the distillable entanglement is the fundamental operational quantity even without this assumption. We present a universal LOCC protocol---whose description does not depend on the input state and thus works universally for any input---that achieves the distillable entanglement of an arbitrary unknown input state. Our result therefore lifts the distillable entanglement to a robust notion of an operationally meaningful quantity and clarifies that input-state knowledge is not necessary to achieve the optimal rate of entanglement distillation. Our protocol is based on state merging for compound states, together with the uniform convergence property of the finite-block quantity toward distillable entanglement.

quant-pharXiv:2609.40215•Oct 1, 2026•0 citations

Computational entanglement distillation beyond pure states: efficient protocols and fundamental limitations

Takeru Utsumi, Jacopo Rizzo, Ryuji Takagi +1 more

The information-theoretic approach to entanglement typically relies on arbitrarily many input copies and unboundedly complex operations; however, the available resources are constrained in reality. This motivates the study of entanglement theory with limited resources. One of its central questions is which quantities characterize entanglement manipulations, and so far, only the idealized case of pure states has been well explored. In this work, we address entanglement distillation from mixed states and identify the Rényi coherent information as the quantity determining the optimal rate in the worst case under two distinct resource constraints. We first characterize the sample-efficient regime, in which unbounded computational power is allowed. Our universal protocol achieves this rate without knowledge of the input state under certain polynomial rank constraints. This rate is optimal among universal protocols: we construct states whose distillable entanglement is nearly extensive, yet from which no universal sample-efficient protocol attains a rate above their Rényi coherent information. We then push this characterization to the computationally efficient frontier: the same bound holds for any efficient protocol even when the input state is known, and another universal protocol achieves this rate efficiently under additional polynomial constraints on the marginal ranks. Overall, our results give the Rényi coherent information a novel operational meaning in two computational settings: universal distillation with limited copies and efficient distillation even with knowledge of the input state.

quant-pharXiv:2610.06787•Oct 6, 2026•0 citations
A different type of complementarity relation is found between locally accessible information and final average entanglement for a given ensemble. It is also shown that in some well-known distillation protocols, this complementary relation is optimally satisfied. We discuss the interesting trade-off between locally accessible information and distillable entanglement for some states.
This paper tries to probe the relation between the local distinguishability of orthogonal quantum states and the distillation of entanglement. An new interpretation for the distillation of entanglement and the distinguishability of orthogonal quantum states in terms of information is given, respectively. By constraining our discussion on a special protocol we give a necessary and sufficient condition for the local distinguishability of the orthogonal pure states, and gain the maximal yield of the distillable entanglement. It is shown that the information entropy, the locally distinguishability of quantum states and the distillation of entanglement are closely related.
We find a universal lower bound on locally accessible information for arbitrary bipartite quantum ensembles, when one of the parties is two dimensional. In higher dimensions and in a higher number of parties, the bound is on accessible information by separable operations. We show that for any given density matrix (of an arbitrary number of parties and dimensions), there exists an ensemble, which averages to the given density matrix and whose locally accessible information saturates the lower bound. Moreover, we give a general method to obtain bounds on the yield of singlets in distillation protocols that involves local distinguishing, by using lower and upper bounds on locally accessible information. We then illustrate it by using our lower bound, along with a previously obtained upper bound, on locally accessible information.
This paper try to probe the relation of distinguishing locally and distillation of entanglement. The distinguishing information (DI) and the maximal distinguishing information (MDI) of a set of pure states are defined. The interpretation of distillation of entanglement in term of information is given. The relation between the maximal distinguishing information and distillable entanglement is gained. As a application of this relation the distillable entanglement of Bell-diagonal states is present.
Distillable entanglement---the maximum rate of Bell states extractable from the given noisy entangled states via local operations and classical communication (LOCC)---has been a central quantity to characterize the operational value of entangled states. However, this operational meaning had been known to be valid only under a crucial assumption: both parties know the description of the input state and can choose the protocol tailored to it, which does not necessarily reflect the natural operational setting. Here, we show that the distillable entanglement is the fundamental operational quantity even without this assumption. We present a universal LOCC protocol---whose description does not depend on the input state and thus works universally for any input---that achieves the distillable entanglement of an arbitrary unknown input state. Our result therefore lifts the distillable entanglement to a robust notion of an operationally meaningful quantity and clarifies that input-state knowledge is not necessary to achieve the optimal rate of entanglement distillation. Our protocol is based on state merging for compound states, together with the uniform convergence property of the finite-block quantity toward distillable entanglement.
The information-theoretic approach to entanglement typically relies on arbitrarily many input copies and unboundedly complex operations; however, the available resources are constrained in reality. This motivates the study of entanglement theory with limited resources. One of its central questions is which quantities characterize entanglement manipulations, and so far, only the idealized case of pure states has been well explored. In this work, we address entanglement distillation from mixed states and identify the Rényi coherent information as the quantity determining the optimal rate in the worst case under two distinct resource constraints. We first characterize the sample-efficient regime, in which unbounded computational power is allowed. Our universal protocol achieves this rate without knowledge of the input state under certain polynomial rank constraints. This rate is optimal among universal protocols: we construct states whose distillable entanglement is nearly extensive, yet from which no universal sample-efficient protocol attains a rate above their Rényi coherent information. We then push this characterization to the computationally efficient frontier: the same bound holds for any efficient protocol even when the input state is known, and another universal protocol achieves this rate efficiently under additional polynomial constraints on the marginal ranks. Overall, our results give the Rényi coherent information a novel operational meaning in two computational settings: universal distillation with limited copies and efficient distillation even with knowledge of the input state.