.png){kind=icon}
.png){kind=icon}
Return
Entanglement percolation in random quantum networks
.png){kind=icon}
OA
AI
A
J
G
A
DOI：10.1088/2058-9565/ae5fca.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Entanglement percolation aims at generating maximal entanglement between any two nodes of a quantum network (QN) by utilizing strategies based solely on local operations and classical communication between the nodes. As it happens in classical percolation theory, the topology of the network is crucial, but also the entanglement shared between the nodes of the network. In a network of identically partially entangled states, the network topology determines the minimum entanglement needed for percolation. In this work, we generalize the protocol to scenarios where the initial entanglement shared between any two nodes of the network is not the same but has some randomness. In such cases, we find that for classical entanglement percolation, only the average initial entanglement is relevant. In contrast, the quantum entanglement percolation protocol (within the q-swap framework) degrades under these more realistic conditions as the width of the distribution increases, suggesting that random classical entanglement percolation may become the optimal LOCC strategy in sufficiently heterogeneous QNs.
Keywords:
Entanglement percolation
Quantum networks
Local operations and classical communication
Randomness
Q-swap protocol
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5
Papers:
1.4K
Citations:
5.1K
Organization
Cited Papers