Papers
Topics
Authors
Recent
2000 character limit reached

Long Distance Entanglement Generation in 2D Networks (1008.3584v1)

Published 20 Aug 2010 in quant-ph

Abstract: We consider 2D networks composed of nodes initially linked by two-qubit mixed states. In these networks we develop a global error correction scheme that can generate distance-independent entanglement from arbitrary network geometries using rank two states. By using this method and combining it with the concept of percolation we also show that the generation of long distance entanglement is possible with rank three states. Entanglement percolation and global error correction have different advantages depending on the given situation. To reveal the trade-off between them we consider their application on networks containing pure states. In doing so we find a range of pure-state schemes, each of which has applications in particular circumstances: For instance, we can identify a protocol for creating perfect entanglement between two distant nodes. However, this protocol can not generate a singlet between any two nodes. On the other hand, we can also construct schemes for creating entanglement between any nodes, but the corresponding entanglement fidelity is lower.

Summary

We haven't generated a summary for this paper yet.

Slide Deck Streamline Icon: https://streamlinehq.com

Whiteboard

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.