Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2508.18024 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910004720697344 |
|---|---|
| author | Chen, Si-Yi Cacciapuoti, Angela Sara Caleffi, Marcello |
| author_facet | Chen, Si-Yi Cacciapuoti, Angela Sara Caleffi, Marcello |
| contents | The extraction of EPR pairs and n-qubits GHZ states among remote nodes in quantum networks constitutes the resource primitives for end-to-end and on-demand communications. However, the Bell-VM problem, which determines whether a given graph state can be transformed into a set of Bell pairs on specific vertices (not necessarily remote), is known to be NP-complete. In this paper, we extend this problem, not only by focusing on nodes remote within generic graph states, but also by determining the number of extractable n-qubit remote GHZ states -- beside the number of remote EPR pairs. The rationale for tackling the extraction of GHZ states among remote nodes, rather than solely remote EPR pairs, is that a GHZ state enables the dynamic extraction of an EPR pair between any pair of nodes sharing the state. This, in turn, implies the ability of accommodating the traffic requests on-the-fly. Specially, we propose a polynomial-time algorithm for solving the aforementioned NP-complete problem. Our results demonstrate that the proposed algorithm is able to effectively adapt to generic graph states for extracting entanglement resources across remote nodes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_18024 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Polynomial-time Extraction of Entanglement Resources Chen, Si-Yi Cacciapuoti, Angela Sara Caleffi, Marcello Quantum Physics The extraction of EPR pairs and n-qubits GHZ states among remote nodes in quantum networks constitutes the resource primitives for end-to-end and on-demand communications. However, the Bell-VM problem, which determines whether a given graph state can be transformed into a set of Bell pairs on specific vertices (not necessarily remote), is known to be NP-complete. In this paper, we extend this problem, not only by focusing on nodes remote within generic graph states, but also by determining the number of extractable n-qubit remote GHZ states -- beside the number of remote EPR pairs. The rationale for tackling the extraction of GHZ states among remote nodes, rather than solely remote EPR pairs, is that a GHZ state enables the dynamic extraction of an EPR pair between any pair of nodes sharing the state. This, in turn, implies the ability of accommodating the traffic requests on-the-fly. Specially, we propose a polynomial-time algorithm for solving the aforementioned NP-complete problem. Our results demonstrate that the proposed algorithm is able to effectively adapt to generic graph states for extracting entanglement resources across remote nodes. |
| title | Polynomial-time Extraction of Entanglement Resources |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2508.18024 |