Distillation Protocols that Involve Local Distinguishing: Composing Upper and Lower Bounds on Locally Accessible Information
arXiv:quant-ph/0505137 · doi:10.1103/PhysRevA.74.052332
Abstract
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 higher number of parties, the lower bound is on accessible information by separable operations. We show that for any given density matrix (of arbitrary number of parties and dimensions), there exists an ensemble, the ''Scrooge ensemble'', which averages to the given density matrix and whose locally accessible information saturates the lower bound. Moreover, we use this lower bound along with a previously obtained upper bound to obtain bounds on the yield of singlets in distillation protocols that involve local distinguishing.
4 pages, 1 eps figure, Revtex4; v2: important additions
References in corpus (4)
Cited by in corpus (12)
- Distinguishability of quantum states under restricted families of measurements with an application to quantum data hiding
- Exclusion Principle for Quantum Dense Coding
- Locally distinguishing quantum states with limited classical communication
- Entanglement Distillation; A Discourse on Bound Entanglement in Quantum Information Theory
- Separability and entanglement in superpositions of quantum states
- Locally Accessible Information of Multisite Quantum Ensembles Violates Monogamy
- Unextendible entangled bases and more nonlocality with less entanglement
- Incompatibility of local measurements provide advantage in local quantum state discrimination
- Coherence measure of ensembles with nonlocality without entanglement
- A classical interpretation of the Scrooge distribution
- Minimal-error quantum state discrimination versus robustness of entanglement:More indistinguishability with less entanglement
- Distributed Quantum Dense Coding Enhanced With Non-classical Routing