Entanglement percolation in random quantum networks
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914504325988352 |
|---|---|
| author | Romancino, Alessandro Romero-Pallejà, Jordi Palma, G. Massimo Sanpera, Anna |
| author_facet | Romancino, Alessandro Romero-Pallejà, Jordi Palma, G. Massimo Sanpera, Anna |
| contents | Entanglement percolation aims at generating maximal entanglement between any two nodes of a quantum network 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 CEP may become the optimal LOCC strategy in sufficiently heterogeneous quantum networks. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_10189 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Entanglement percolation in random quantum networks Romancino, Alessandro Romero-Pallejà, Jordi Palma, G. Massimo Sanpera, Anna Quantum Physics Entanglement percolation aims at generating maximal entanglement between any two nodes of a quantum network 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 CEP may become the optimal LOCC strategy in sufficiently heterogeneous quantum networks. |
| title | Entanglement percolation in random quantum networks |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2602.10189 |