# Assisted entanglement distillation

@article{Dutil2011AssistedED,
title={Assisted entanglement distillation},
author={Nicolas Dutil and Patrick M. Hayden},
journal={Quantum Inf. Comput.},
year={2011},
volume={11},
pages={496-520}
}
• Published 9 November 2010
• Computer Science
• Quantum Inf. Comput.
Motivated by the problem of designing quantum repeaters, we study entanglement distillation between two parties, Alice and Bob, starting from a mixed state and with the help of "repeater" stations. To treat the case of a single repeater, we extend the notion of entanglement of assistance to arbitrary mixed tripartite states and exhibit a protocol, based on a random coding strategy, for extracting pure entanglement. The rates achievable by this protocol formally resemble those achievable if the…
3 Citations

## Figures from this paper

Multiparty quantum protocols for assisted entanglement distillation
This work extends the notion of entanglement of assistance to arbitrary states and gives a protocol for extracting pure Entanglement, a new protocol for the task of multiparty state merging, which does not require time-sharing for distributed compression of two senders.
Finite Block Length Analysis on Quantum Coherence Distillation and Incoherent Randomness Extraction
• Computer Science
IEEE Transactions on Information Theory
• 2021
A new assisted incoherent randomness extraction task is introduced and an exact relation between this task and the assisted coherence distillation is established, which strengthens the one-shot relation in the unassisted setting and confirms that this cryptographic framework offers a new perspective to the study of quantum coherencedistillation.
Holographic duality from random tensor networks
• Physics
• 2016
A bstractTensor networks provide a natural framework for exploring holographic duality because they obey entanglement area laws. They have been used to construct explicit toy models realizing many of

## References

SHOWING 1-10 OF 42 REFERENCES
Entanglement of assistance and multipartite state distillation
• Computer Science
• 2005
It is found that the asymptotic entanglement of assistance of a general bipartite mixed state is equal to the smaller of its two local entropies, which implies a capacity theorem for quantum channels where the environment helps transmission by broadcasting the outcome of an optimally chosen measurement.
• Computer Science
• 2006
An asymPTotic bipartite entanglement-distillation protocol that outperforms all existing asymptotic schemes and is based on the breeding protocol with the incorporation of two-way classical communication.
Distillation of secret key and entanglement from quantum states
• Computer Science
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
• 2005
A coding theorem is proved to achieve the ‘wire–tapper’ bound, the difference of the mutual information Alice–Bob and that of Alice–Eve, for so–called classical–quantum-quantum–correlations, via one–way public communication, which yields information–theoretic formulae for the distillable secret key.
Quantum repeaters based on entanglement purification
• Physics, Computer Science
• 1999
A scheme is presented that allows entanglement purification over arbitrary long channels and tolerates errors on the percent level and requires a polynomial overhead in time, and an overhead in local resources that grows only logarithmically with the length of the channel.
General theory of assisted entanglement distillation
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
Distilling entanglement from arbitrary resources
• Computer Science
• 2010
We obtain the general formula for the optimal rate at which singlets can be distilled from any given noisy and arbitrarily correlated entanglement resource by means of local operations and classical
Mixed-state entanglement and quantum error correction.
• Computer Science
Physical review. A, Atomic, molecular, and optical physics
• 1996
It is proved that an EPP involving one-way classical communication and acting on mixed state M (obtained by sharing halves of Einstein-Podolsky-Rosen pairs through a channel) yields a QECC on \ensuremath{\chi} with rate Q=D, and vice versa, and it is proved Q is not increased by adding one- way classical communication.
One-shot Multiparty State Merging
• Computer Science
ArXiv
• 2010
A protocol for performing state merging when multiple parties share a single copy of a mixed state is presented, and the entanglement cost is analyzed in terms of min- and max-entropies.
Entanglement distribution in pure-state quantum networks
• Computer Science, Physics
• 2008
It is proved that perfectEntanglement can be established on large distances with probability one in a finite number of steps, provided the initial entanglement shared by neighboring nodes is large enough.
Interpolation of recurrence and hashing entanglement distillation protocols
• Computer Science
• 2005
This work constructs interesting entanglement distillation protocols by interpolating between the recurrence and hashing protocols, resulting in an improvement of the distillation rate for all mixed Bell diagonal entangled states, even for the ones with very high fidelity.