Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2504.10186 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908797055795200 |
|---|---|
| author | Chen, Si-Yi Cacciapuoti, Angela Sara Caleffi, Marcello |
| author_facet | Chen, Si-Yi Cacciapuoti, Angela Sara Caleffi, Marcello |
| contents | In the Quantum Internet, multipartite entanglement enables a rich and dynamic overlay topology, referred to as artificial topology, upon the physical one, that can be exploited for communication purposes. In fact, the ability to extract $n$-qubits GHZ states and EPR pairs from the original multipartite entangled state constitutes the resource primitives for end-to-end and on-demand quantum communications. Thus, in this paper, we theoretically determine upper and lower bounds for the number of extractable $n$-qubits GHZ states and EPR pairs involving nodes remote in the artificial topology, as well as the achievable size $n$ of remote GHZ states. The theoretical analysis is then complemented by the proposal of a novel algorithm, which provides in polynomial-time a heuristic solution to the above problem. This is remarkable, since the theoretical problem is NP-complete. The performance analysis demonstrates the proposed algorithm is able to effectively manipulate the original and arbitrary graph state for extracting entanglement resources across remote nodes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_10186 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On the Efficient Extraction of Entangled Resources Chen, Si-Yi Cacciapuoti, Angela Sara Caleffi, Marcello Quantum Physics In the Quantum Internet, multipartite entanglement enables a rich and dynamic overlay topology, referred to as artificial topology, upon the physical one, that can be exploited for communication purposes. In fact, the ability to extract $n$-qubits GHZ states and EPR pairs from the original multipartite entangled state constitutes the resource primitives for end-to-end and on-demand quantum communications. Thus, in this paper, we theoretically determine upper and lower bounds for the number of extractable $n$-qubits GHZ states and EPR pairs involving nodes remote in the artificial topology, as well as the achievable size $n$ of remote GHZ states. The theoretical analysis is then complemented by the proposal of a novel algorithm, which provides in polynomial-time a heuristic solution to the above problem. This is remarkable, since the theoretical problem is NP-complete. The performance analysis demonstrates the proposed algorithm is able to effectively manipulate the original and arbitrary graph state for extracting entanglement resources across remote nodes. |
| title | On the Efficient Extraction of Entangled Resources |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2504.10186 |