Long Distance Entanglement Generation in 2D Networks

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.

10 pages, 9 figures, 1 table

References in corpus (9)

• Thresholds for topological codes in the presence of loss
• Entanglement Distribution in Pure-State Quantum Networks
• Entanglement percolation in quantum complex networks
• On the role of memory errors in quantum repeaters
• Multipartite entanglement percolation
• One-shot entanglement generation over long distances in noisy quantum networks
• Fidelity threshold for long-range entanglement in quantum networks
• Entanglement Percolation with Bipartite Mixed States
• Singlet Generation in Mixed State Quantum Networks

Cited by in corpus (5)

• Distribution of entanglement in large-scale quantum networks
• Complex Quantum Networks: a Topical Review
• Limited path entanglement percolation in quantum complex networks
• Braess Paradox in a quantum network
• Percolation of secret correlations in a network