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.

On the Efficient Extraction of Entangled Resources / Chen, Si-Yi; Cacciapuoti, Angela Sara; Caleffi, Marcello. - In: IEEE TRANSACTIONS ON COMMUNICATIONS. - ISSN 0090-6778. - 74:(2026), pp. 3517-3531. [10.1109/tcomm.2025.3650374]

On the Efficient Extraction of Entangled Resources

Cacciapuoti, Angela Sara;Caleffi, Marcello
2026

Abstract

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.
2026
On the Efficient Extraction of Entangled Resources / Chen, Si-Yi; Cacciapuoti, Angela Sara; Caleffi, Marcello. - In: IEEE TRANSACTIONS ON COMMUNICATIONS. - ISSN 0090-6778. - 74:(2026), pp. 3517-3531. [10.1109/tcomm.2025.3650374]
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11588/1049399
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact