Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2409.08173

Quantum Entanglement Allocation through a Central Hub

Yu-Ao Chen, Xia Liu, Chenghong Zhu, Lei Zhang, Junyu Liu, Xin Wang

Published Sep 12, 2024• 6 citations
arXivHTMLPDF

Abstract

Establishing a fully functional quantum internet relies on the efficient allocation of multipartite entangled states, which enables advanced quantum communication protocols, secure multipartite quantum key distribution, and distributed quantum computing. In this work, we propose local operations and classical communication (LOCC) protocols for allocating generalized $N$-qubit W states within a centralized hub architecture, where the central hub node preshares Bell states with each end node. We develop a detailed analysis of the optimality of the resources required for our proposed W-state allocation protocol and the previously proposed GHZ-state protocol. Our results show that these protocols deterministically and exactly distribute states using only $N$ qubits of quantum memory within the central system, with communication costs of $2N - 2$ and $N$ classical bits for the W and GHZ states, respectively. These resource-efficient LOCC protocols are further proven to be optimal within the centralized hub architecture, outperforming conventional teleportation protocols for entanglement distribution in both memory and communication costs. Our results provide a more resource-efficient method for allocating essential multipartite entangled states in quantum networks, paving the way for the realization of a quantum internet with enhanced efficiency.

DOI
10.48550/arxiv.2409.08173

Related papers

Secure and Efficient Entanglement Distribution Protocols for Near-Term Quantum Internet

Nicholas Skjellum, Mohamed Shaban, Muhammad Ismail

Quantum information technology has the potential to revolutionize computing, communications, and security. To fully realize its potential, quantum processors with millions of qubits are needed, which are still far from being accomplished. Thus, it is important to establish quantum networks to enable distributed quantum computing to leverage existing and near-term quantum processors into more powerful resources. This paper proposes an efficient entanglement distribution protocol for classical-quantum networks with a limited number of quantum links, enabling quantum teleportation in near-term hybrid networks. The proposed protocol uses entanglement swapping and classical network coding to distribute entanglements efficiently while overcoming bottlenecks and minimizing qubit and link usage. Experimental results show that the proposed protocol requires quantum resources that scale linearly with network size, with individual nodes only requiring a fixed number of qubits. For small network sizes of up to three transceiver pairs, the proposed protocol outperforms the benchmark by using 17% fewer qubit resources, achieving 8.8% higher accuracy, and with a 35% faster simulation time. The percentage improvement increases significantly for large network sizes. We also propose a protocol for securing entanglement distribution against malicious entanglements using quantum state encoding through rotation. Our analysis shows that this method requires no communication overhead and reduces the chance of a malicious node retrieving the teleported state to 7.2%. The achieved results point toward a protocol that enables a highly scalable, efficient, and secure near-term quantum Internet.

International Conference on Computer Communications and Networks (ICCCN)•Jul 29, 2024•0 citations

Secure and Efficient Entanglement Distribution Protocol for Near-Term Quantum Internet

Nicholas Skjellum, Shaban, Mohamed, Muhammad Ismail

Quantum information technology has the potential to revolutionize computing, communications, and security. To fully realize its potential, quantum processors with millions of qubits are needed, which is still far from being accomplished. Thus, it is important to establish quantum networks to enable distributed quantum computing to leverage existing and near-term quantum processors into more powerful resources. This paper introduces a protocol to distribute entanglements among quantum devices within classical-quantum networks with limited quantum links, enabling more efficient quantum teleportation in near-term hybrid networks. The proposed protocol uses entanglement swapping to distribute entanglements efficiently in a butterfly network, then classical network coding is applied to enable quantum teleportation while overcoming network bottlenecks and minimizing qubit requirements for individual nodes. Experimental results show that the proposed protocol requires quantum resources that scale linearly with network size, with individual nodes only requiring a fixed number of qubits. For small network sizes of up to three transceiver pairs, the proposed protocol outperforms the benchmark by using 17% fewer qubit resources, achieving 8.8% higher accuracy, and with a 35% faster simulation time. The percentage improvement increases significantly for large network sizes. We also propose a protocol for securing entanglement distribution against malicious entanglements using quantum state encoding through rotation. Our analysis shows that this method requires no communication overhead and reduces the chance of a malicious node retrieving a quantum state to 7.2%. The achieved results point toward a protocol that enables a highly scalable, efficient, and secure near-term quantum Internet.

arXiv:2312.05775•Dec 10, 2023•2 citations

Entanglement assisted quantum communication protocols

Amélie Piveteau

Quantum entanglement plays a central role in many quantum communication protocols. It allows distant particles to share correlations beyond the limits of classical interactions. Entanglement is essential for superdense coding, quantum teleportation, and secure cryptographic key distribution in quantum communication. It is also a pillar for developing quantum networks, where the management and distribution of entanglement are crucial for connecting distant nodes. Although perfect entanglement is a sought-after ideal, experimental imperatives, including entanglement distribution over long distances, often limit the quality of entangled states. An important question is whether weaker entanglement still offers advantages. First, we study more general tasks than dense coding to show that simpler measurements, combined with entanglement, allow advantageous and sometimes even optimal qubit communication protocols to be obtained. We also demonstrate that simple measurements can generate quantum correlations that cannot be modelled by two classical communication bits and can constitute an optimal protocol with quantum resources. We implement a novel Bell-type inequality tailored for certifying full network non-locality (FNN) to develop certification methods guaranteeing security on an entanglement-based network. Our experiment uses two pairs of polarised entangled photons in a network configuration with three nodes, briefly referred to as a bilocal network scenario. Finally, we show that weakly entangled states can improve communication over a qubit channel using only separate (local) measurements on isotropic non-steerable two-qubit states, without interference, of individual photons, across two communication tasks: secret sharing and its stochastic variant.

•Jan 1, 2026•0 citations

Distributing Multipartite Entanglement over Noisy Quantum Networks

Luís Bugalho, Bruno Coelho Coutinho, Francisco A. Monteiro +1 more

A quantum internet aims at harnessing networked quantum technologies, namely by distributing bipartite entanglement between distant nodes. However, multipartite entanglement between the nodes may empower the quantum internet for additional or better applications for communications, sensing, and computation. In this work, we present an algorithm for generating multipartite entanglement between different nodes of a quantum network with noisy quantum repeaters and imperfect quantum memories, where the links are entangled pairs. Our algorithm is optimal for GHZ states with 3 qubits, maximising simultaneously the final state fidelity and the rate of entanglement distribution. Furthermore, we determine the conditions yielding this simultaneous optimality for GHZ states with a higher number of qubits, and for other types of multipartite entanglement. Our algorithm is general also in the sense that it can optimise simultaneously arbitrary parameters. This work opens the way to optimally generate multipartite quantum correlations over noisy quantum networks, an important resource for distributed quantum technologies.

arXiv:2103.14759•Quantum•Feb 9, 2023•83 citations

Strategies for optimizing performance and resource overhead in quantum networks

S. Siddardha Chelluri

Quantum networks promise unconditionally secure communication and distributed quantum computing. Realizing these capabilities requires the reliable creation and maintenance of multipartite entanglement across large-scale networks. However, distributing complex entangled states among many nodes becomes increasingly challenging due to physical imperfections, architectural constraints, and the growing demands on network resources. This thesis presents practical methods that address two key facets of this broader problem. First, we introduce graph-theoretic protocols that generate GHZ states in Bell-pair networks using only local operations and classical communication, bypassing NP-hard subroutines while minimizing gate counts and Bell-pair consumption. Benchmarked on random network topologies and validated on IBM quantum hardware, these methods provide a scalable path to distributed quantum computing and multiparty communication. Second, we improve the performance of second-generation quantum repeater networks by incorporating bosonic quantum error correction. We show that memories with shorter coherence times, when protected by error correction, can outperform unencoded memories with significantly longer coherence times. We further address the problem of optimal memory-buffer allocation across repeater networks, introducing policies that reduce waiting times, thereby improving entanglement distribution efficiency. Overall, these results demonstrate practical and effective methods for improving performance and advancing the realization of near-term quantum networks.

•Jan 1, 2026•0 citations

An N-Qubit Teleportation Protocol with a Generalized GHZ State

Abdelrahman E. Ahmed

Quantum teleportation is a cornerstone protocol for future quantum networks and distributed quantum com- puting. However, scaling teleportation to an arbitrary N- qubit state using conventional methods, which require N separate Bell pairs, presents a significant challenge in terms of both quantum and classical resource overhead. This paper introduces a novel and resource-efficient protocol for tele- porting an arbitrary N-qubit state using a single, pre-shared (N+1)-qubit Greenberger-Horne-Zeilinger (GHZ) state. Our approach reduces the required entangled channel qubits and classical communication bits from O(2N) to N+1, offering a substantial improvement in communication efficiency. The protocol mechanism involves a sequence of local and non-local CNOT gates performed by the sender (Alice), followed by local measurements on her N+1 qubits. The N+1 classical measurement outcomes are then transmitted to the receiver (Bob), who recovers the original quantum state by applying a specific corrective unitary transformation U-f, followed by a set of conditional Pauli gates. We provide a high-level proof of the protocol’s correctness and show that the corrective trans- formation U-f can be implemented efficiently using only local operations on the receiver’s side. Recognizing the practical difficulty of implementing non-local quantum gates between spatially separated nodes, we also propose a modified scheme to enhance near-term feasibility. This practical approach re- locates the non-local operations to a co-located preparation phase, thereby trading the formidable challenge of non-local interactions for a high-fidelity quantum memory requirement. This work analyzes the critical trade-offs between communication efficiency and operational complexity, presenting a vi- able alternative for designing scalable and resource-optimized quantum communication systems.

Novel Intelligent and Leading Emerging Sciences Conference (NILES)•Oct 25, 2025•0 citations
Establishing a fully functional quantum internet relies on the efficient allocation of multipartite entangled states, which enables advanced quantum communication protocols, secure multipartite quantum key distribution, and distributed quantum computing. In this work, we propose local operations and classical communication (LOCC) protocols for allocating generalized NNN-qubit W states within a centralized hub architecture, where the central hub node preshares Bell states with each end node. We develop a detailed analysis of the optimality of the resources required for our proposed W-state allocation protocol and the previously proposed GHZ-state protocol. Our results show that these protocols deterministically and exactly distribute states using only NNN qubits of quantum memory within the central system, with communication costs of 2N−22N - 22N−2 and NNN classical bits for the W and GHZ states, respectively. These resource-efficient LOCC protocols are further proven to be optimal within the centralized hub architecture, outperforming conventional teleportation protocols for entanglement distribution in both memory and communication costs. Our results provide a more resource-efficient method for allocating essential multipartite entangled states in quantum networks, paving the way for the realization of a quantum internet with enhanced efficiency.
Quantum information technology has the potential to revolutionize computing, communications, and security. To fully realize its potential, quantum processors with millions of qubits are needed, which are still far from being accomplished. Thus, it is important to establish quantum networks to enable distributed quantum computing to leverage existing and near-term quantum processors into more powerful resources. This paper proposes an efficient entanglement distribution protocol for classical-quantum networks with a limited number of quantum links, enabling quantum teleportation in near-term hybrid networks. The proposed protocol uses entanglement swapping and classical network coding to distribute entanglements efficiently while overcoming bottlenecks and minimizing qubit and link usage. Experimental results show that the proposed protocol requires quantum resources that scale linearly with network size, with individual nodes only requiring a fixed number of qubits. For small network sizes of up to three transceiver pairs, the proposed protocol outperforms the benchmark by using 17% fewer qubit resources, achieving 8.8% higher accuracy, and with a 35% faster simulation time. The percentage improvement increases significantly for large network sizes. We also propose a protocol for securing entanglement distribution against malicious entanglements using quantum state encoding through rotation. Our analysis shows that this method requires no communication overhead and reduces the chance of a malicious node retrieving the teleported state to 7.2%. The achieved results point toward a protocol that enables a highly scalable, efficient, and secure near-term quantum Internet.
Quantum information technology has the potential to revolutionize computing, communications, and security. To fully realize its potential, quantum processors with millions of qubits are needed, which is still far from being accomplished. Thus, it is important to establish quantum networks to enable distributed quantum computing to leverage existing and near-term quantum processors into more powerful resources. This paper introduces a protocol to distribute entanglements among quantum devices within classical-quantum networks with limited quantum links, enabling more efficient quantum teleportation in near-term hybrid networks. The proposed protocol uses entanglement swapping to distribute entanglements efficiently in a butterfly network, then classical network coding is applied to enable quantum teleportation while overcoming network bottlenecks and minimizing qubit requirements for individual nodes. Experimental results show that the proposed protocol requires quantum resources that scale linearly with network size, with individual nodes only requiring a fixed number of qubits. For small network sizes of up to three transceiver pairs, the proposed protocol outperforms the benchmark by using 17% fewer qubit resources, achieving 8.8% higher accuracy, and with a 35% faster simulation time. The percentage improvement increases significantly for large network sizes. We also propose a protocol for securing entanglement distribution against malicious entanglements using quantum state encoding through rotation. Our analysis shows that this method requires no communication overhead and reduces the chance of a malicious node retrieving a quantum state to 7.2%. The achieved results point toward a protocol that enables a highly scalable, efficient, and secure near-term quantum Internet.
Quantum entanglement plays a central role in many quantum communication protocols. It allows distant particles to share correlations beyond the limits of classical interactions. Entanglement is essential for superdense coding, quantum teleportation, and secure cryptographic key distribution in quantum communication. It is also a pillar for developing quantum networks, where the management and distribution of entanglement are crucial for connecting distant nodes. Although perfect entanglement is a sought-after ideal, experimental imperatives, including entanglement distribution over long distances, often limit the quality of entangled states. An important question is whether weaker entanglement still offers advantages. First, we study more general tasks than dense coding to show that simpler measurements, combined with entanglement, allow advantageous and sometimes even optimal qubit communication protocols to be obtained. We also demonstrate that simple measurements can generate quantum correlations that cannot be modelled by two classical communication bits and can constitute an optimal protocol with quantum resources. We implement a novel Bell-type inequality tailored for certifying full network non-locality (FNN) to develop certification methods guaranteeing security on an entanglement-based network. Our experiment uses two pairs of polarised entangled photons in a network configuration with three nodes, briefly referred to as a bilocal network scenario. Finally, we show that weakly entangled states can improve communication over a qubit channel using only separate (local) measurements on isotropic non-steerable two-qubit states, without interference, of individual photons, across two communication tasks: secret sharing and its stochastic variant.
A quantum internet aims at harnessing networked quantum technologies, namely by distributing bipartite entanglement between distant nodes. However, multipartite entanglement between the nodes may empower the quantum internet for additional or better applications for communications, sensing, and computation. In this work, we present an algorithm for generating multipartite entanglement between different nodes of a quantum network with noisy quantum repeaters and imperfect quantum memories, where the links are entangled pairs. Our algorithm is optimal for GHZ states with 3 qubits, maximising simultaneously the final state fidelity and the rate of entanglement distribution. Furthermore, we determine the conditions yielding this simultaneous optimality for GHZ states with a higher number of qubits, and for other types of multipartite entanglement. Our algorithm is general also in the sense that it can optimise simultaneously arbitrary parameters. This work opens the way to optimally generate multipartite quantum correlations over noisy quantum networks, an important resource for distributed quantum technologies.
Quantum networks promise unconditionally secure communication and distributed quantum computing. Realizing these capabilities requires the reliable creation and maintenance of multipartite entanglement across large-scale networks. However, distributing complex entangled states among many nodes becomes increasingly challenging due to physical imperfections, architectural constraints, and the growing demands on network resources. This thesis presents practical methods that address two key facets of this broader problem. First, we introduce graph-theoretic protocols that generate GHZ states in Bell-pair networks using only local operations and classical communication, bypassing NP-hard subroutines while minimizing gate counts and Bell-pair consumption. Benchmarked on random network topologies and validated on IBM quantum hardware, these methods provide a scalable path to distributed quantum computing and multiparty communication. Second, we improve the performance of second-generation quantum repeater networks by incorporating bosonic quantum error correction. We show that memories with shorter coherence times, when protected by error correction, can outperform unencoded memories with significantly longer coherence times. We further address the problem of optimal memory-buffer allocation across repeater networks, introducing policies that reduce waiting times, thereby improving entanglement distribution efficiency. Overall, these results demonstrate practical and effective methods for improving performance and advancing the realization of near-term quantum networks.
Quantum teleportation is a cornerstone protocol for future quantum networks and distributed quantum com- puting. However, scaling teleportation to an arbitrary N- qubit state using conventional methods, which require N separate Bell pairs, presents a significant challenge in terms of both quantum and classical resource overhead. This paper introduces a novel and resource-efficient protocol for tele- porting an arbitrary N-qubit state using a single, pre-shared (N+1)-qubit Greenberger-Horne-Zeilinger (GHZ) state. Our approach reduces the required entangled channel qubits and classical communication bits from O(2N) to N+1, offering a substantial improvement in communication efficiency. The protocol mechanism involves a sequence of local and non-local CNOT gates performed by the sender (Alice), followed by local measurements on her N+1 qubits. The N+1 classical measurement outcomes are then transmitted to the receiver (Bob), who recovers the original quantum state by applying a specific corrective unitary transformation U-f, followed by a set of conditional Pauli gates. We provide a high-level proof of the protocol’s correctness and show that the corrective trans- formation U-f can be implemented efficiently using only local operations on the receiver’s side. Recognizing the practical difficulty of implementing non-local quantum gates between spatially separated nodes, we also propose a modified scheme to enhance near-term feasibility. This practical approach re- locates the non-local operations to a co-located preparation phase, thereby trading the formidable challenge of non-local interactions for a high-fidelity quantum memory requirement. This work analyzes the critical trade-offs between communication efficiency and operational complexity, presenting a vi- able alternative for designing scalable and resource-optimized quantum communication systems.