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:2510.02895

DH-EAC: Design of a Dynamic, Hierarchical Entanglement Access Control Protocol

Akihisa Takahashi, Yoshito Tobe

Published Oct 3, 2025• 0 citations
arXivHTMLPDF

Abstract

We propose Dynamic, Hierarchical Entanglement Access Control (DH-EAC), a pure-quantum protocol for fair and anonymous allocation of scarce entanglement across wide-area quantum networks composed of many quantum LANs (QLANs). Prior Dicke-state-based pure-quantum MACs resolve contention by local measurements without classical signaling, but they mainly target a single QLAN under static conditions; extending them to wide-area, dynamic settings while avoiding post-selection reconciliation remains open. DH-EAC adopts a two-layer pure-quantum lottery: the outer layer selects winning QLANs and the inner layer selects winning nodes within each winning QLAN. A key design principle is that both the winning set and the per-QLAN quota are fixed by measurements alone, so the contention loop requires no classical round trip. The protocol thus aims to jointly satisfy anonymity (no node IDs revealed until decisions are fixed) and fairness (bias suppression under heterogeneous QLAN sizes). We also provide analytical models for success probability and latency under a standard i.i.d. loss model, and we evaluate DH-EAC against two baselines - single-layer Dicke within one QLAN and a classical GO-driven allocator - using a minimal, reproducible set of scenarios. Metrics include success probability, end-to-end latency, throughput, and Jain's fairness index. The results indicate that DH-EAC offers an implementable design point in the space of entanglement access control, balancing pure-quantum contention resolution, anonymity, and scalability for multi-QLAN networks.

DOI
10.48550/arxiv.2510.02895

Related papers

Quantum MAC: Genuine Entanglement Access Control via Many-Body Dicke States

Jessica Illiano, Marcello Caleffi, Michele Viscardi +1 more

Multipartite entanglement plays a crucial role for the design of the Quantum Internet, due to its peculiarities with no classical counterpart. Yet, for entanglement-based quantum networks, a key open issue is constituted by the lack of an effectiveentanglement access control(EAC) strategy for properly handling and coordinating the quantum nodes in accessing the entangled resource. In this paper, we design aquantum-genuineentanglement access control (EAC) to solve the contention problem arising in accessing a multipartite entangled resource. The proposed quantum-genuine EAC is able to: i) fairly select a subset of nodes granted with the access to the contended resource; ii) preserve the privacy and anonymity of the identities of the selected nodes; iii) avoid to delegate the signaling arising with entanglement access control to the classical network. We also conduct a theoretical analysis of noise effects on the proposed EAC. This theoretical analysis is able to catch the complex noise effects on the EAC through meaningful parameters.

arXiv:2305.01276•IEEE Transactions on Communications•Dec 18, 2023•20 citations

An Asynchronous Entanglement Distribution Protocol for Quantum Networks

Zhaoying Wang, Jian Li, Kaiping Xue +4 more

Entanglement-based quantum networks can provide unconditionally secure communication by distributing entangled pairs between distant end nodes. To achieve end-to-end entanglement distribution, multiple operations of entanglement swapping in a quantum repeater chain are always required. However, due to the non-determinism of entanglement swapping caused by imperfect physical devices, the execution pattern of swapping operations has a direct impact on the performance of entanglement distribution, which can be categorized into an entanglement access control (EAC) problem. In this article, we attribute the EAC problem to two aspects: the matching optimization within quantum nodes, and the swapping conflict avoidance between quantum nodes. Accordingly, we propose an asynchronous entanglement distribution protocol which contains a custom weighted maximum matching algorithm, and a reliable signaling interaction mechanism to avoid a swapping conflict, respectively. Based on the proposed protocol, quantum repeaters autonomously decide their behaviors and spontaneously construct the end-to-end entangled pairs asynchronously. Simulation results show that our protocol can significantly improve the entanglement distribution rate and fidelity of end-to-end entangled pairs while simplifying the deployment and management process of the quantum networks.

IEEE Network•Sep 1, 2022•13 citations

Quantum Internet: from Medium Access Control to Entanglement Access Control

Jessica Illiano, Michele Viscardi, Seid Koudia +2 more

Multipartite entanglement plays a crucial role for the design of the Quantum Internet, due to its potentiality of significantly increasing the network performance. In this paper, we design an entanglement access control protocol for multipartite state, which exhibits several attractive features. Specifically, the designed protocol is able to jointly extract in a distributed way an EPR pair from the original multipartite entangled state shared by the set of network nodes, and to univocally determines the identities of the transmitter node and the receiver node in charge of using the extracted EPR pair. Furthermore, the protocol avoids to delegate the signaling arising with entanglement access control to the classical network, with the exception of the unavoidable classical communications needed for EPR extraction and qubit teleportation. Finally, the protocol supports the anonymity of the entanglement accessing nodes.

arXiv:2205.11923•IEEE Globecom Workshops (GC Wkshps)•Dec 4, 2022•8 citations

Fair-EAS: Entanglement Allocation and Selection for Process-Oriented Fairness in Quantum Communication Networks

Zhaoying Wang, Jian Li, Kaiping Xue +5 more

Quantum communication networks enable advanced quantum applications through remote entanglement distribution among source-destination pairs. Despite efforts to optimize entanglement distribution, fairness in multi-request scenarios has been neglected, potentially causing issues like “request starvation”. To address such issue, this paper concentrates on the unique properties of entangled systems and introduces a process-oriented fairness metric, i.e., expected throughput, departing from conventional approaches used in classical networks. Furthermore, we propose an entanglement distribution scheme named Fair-EAS, which prioritizes entanglement allocation and selection for batching multiple requests to maximize overall throughput while maintaining max-min fairness. To facilitate a convenient solution, we transform the nonlinearity of the problem into an equivalent linear programming formulation and decouple the solution into offline and online phases. In the offline phase, we design a multi-round water-filling-like optimization algorithm to determine the optimal path set for predicting entanglement allocation. In the online phase, we introduce an adaptive compensation algorithm and an entanglement “fragment” exhaustion algorithm to dynamically adjust the path set based on successfully generated entangled pairs. Comprehensive simulations show that Fair-EAS outperforms the existing schemes in terms of fairness by significantly enhancing the minimum throughput and throughput deviation among multiple requests while maintaining an overall throughput close to the optimal level.

IEEE Transactions on Communications•Dec 12, 2024•7 citations

Quantum Games Based Communication Protocols

Omar Gustavo Zabaleta, Constancio Miguel Arizmendi

Medium access control (MAC) and efficient spectrum allocation function particularly, are real challenges that wireless communications are facing nowadays and Dynamic Spectrum Access (DSA), enhanced with quantum computation techniques, is the most promising alternative. In such a context, we capitalize quantum games and quantum decisions strengths to design protocols that make classic communications more efficient. That is, we focus on protocols running on quantum devices whose input and output signals are classic. In this work we propose a quantum media access control (QMAC) that allows dynamic and fair spectrum allocation. Particularly, we point to two of the main DSA functions, which are Spectrum Sharing and Spectrum Allocation.

Journal of Advances in Applied & Computational Mathematics•Dec 31, 2017•3 citations

REDP: Reliable Entanglement Distribution Protocol Design for Large-Scale Quantum Networks

Lutong Chen, Kaiping Xue, Jian Li +5 more

Remote entanglement distribution in an efficient and reliable manner, especially in the context of a large-scale quantum network with multiple requests, remains an unsolved challenge. The key difficulties lie in achieving spontaneous and precise control over the entanglement distribution procedure, as multiple nodes need to reach a consensus on how to perform it. From the network aspect, allocating link-layer entangled pairs as resources to achieve high efficiency is also challenging. To address these issues, we propose a decentralized Reliable Entanglement Distribution Protocol (REDP) for large-scale networks. The protocol operates in a Forward-Backward Propagation (FBP) manner, where consensus is reached hop-by-hop and disseminated to all nodes on the path. We further use probabilistic analysis and quasi-static modeling to seek the fairness and efficiency of the network based on the above transmission model. Accordingly, we introduce a Source Window Strategy (SWS) and an Entanglement Allocation Strategy (EAS) to assign sending windows and allocate resources for multiple requests, ensuring a high level of fairness and efficiency from a network perspective. Through systematic simulations involving both classical and quantum communication protocols, we demonstrate that REDP outperforms existing approaches in terms of fairness, throughput, and fidelity performance.

IEEE Journal on Selected Areas in Communications•Mar 21, 2024•21 citations
We propose Dynamic, Hierarchical Entanglement Access Control (DH-EAC), a pure-quantum protocol for fair and anonymous allocation of scarce entanglement across wide-area quantum networks composed of many quantum LANs (QLANs). Prior Dicke-state-based pure-quantum MACs resolve contention by local measurements without classical signaling, but they mainly target a single QLAN under static conditions; extending them to wide-area, dynamic settings while avoiding post-selection reconciliation remains open. DH-EAC adopts a two-layer pure-quantum lottery: the outer layer selects winning QLANs and the inner layer selects winning nodes within each winning QLAN. A key design principle is that both the winning set and the per-QLAN quota are fixed by measurements alone, so the contention loop requires no classical round trip. The protocol thus aims to jointly satisfy anonymity (no node IDs revealed until decisions are fixed) and fairness (bias suppression under heterogeneous QLAN sizes). We also provide analytical models for success probability and latency under a standard i.i.d. loss model, and we evaluate DH-EAC against two baselines - single-layer Dicke within one QLAN and a classical GO-driven allocator - using a minimal, reproducible set of scenarios. Metrics include success probability, end-to-end latency, throughput, and Jain's fairness index. The results indicate that DH-EAC offers an implementable design point in the space of entanglement access control, balancing pure-quantum contention resolution, anonymity, and scalability for multi-QLAN networks.
Multipartite entanglement plays a crucial role for the design of the Quantum Internet, due to its peculiarities with no classical counterpart. Yet, for entanglement-based quantum networks, a key open issue is constituted by the lack of an effectiveentanglement access control(EAC) strategy for properly handling and coordinating the quantum nodes in accessing the entangled resource. In this paper, we design aquantum-genuineentanglement access control (EAC) to solve the contention problem arising in accessing a multipartite entangled resource. The proposed quantum-genuine EAC is able to: i) fairly select a subset of nodes granted with the access to the contended resource; ii) preserve the privacy and anonymity of the identities of the selected nodes; iii) avoid to delegate the signaling arising with entanglement access control to the classical network. We also conduct a theoretical analysis of noise effects on the proposed EAC. This theoretical analysis is able to catch the complex noise effects on the EAC through meaningful parameters.
Entanglement-based quantum networks can provide unconditionally secure communication by distributing entangled pairs between distant end nodes. To achieve end-to-end entanglement distribution, multiple operations of entanglement swapping in a quantum repeater chain are always required. However, due to the non-determinism of entanglement swapping caused by imperfect physical devices, the execution pattern of swapping operations has a direct impact on the performance of entanglement distribution, which can be categorized into an entanglement access control (EAC) problem. In this article, we attribute the EAC problem to two aspects: the matching optimization within quantum nodes, and the swapping conflict avoidance between quantum nodes. Accordingly, we propose an asynchronous entanglement distribution protocol which contains a custom weighted maximum matching algorithm, and a reliable signaling interaction mechanism to avoid a swapping conflict, respectively. Based on the proposed protocol, quantum repeaters autonomously decide their behaviors and spontaneously construct the end-to-end entangled pairs asynchronously. Simulation results show that our protocol can significantly improve the entanglement distribution rate and fidelity of end-to-end entangled pairs while simplifying the deployment and management process of the quantum networks.
Multipartite entanglement plays a crucial role for the design of the Quantum Internet, due to its potentiality of significantly increasing the network performance. In this paper, we design an entanglement access control protocol for multipartite state, which exhibits several attractive features. Specifically, the designed protocol is able to jointly extract in a distributed way an EPR pair from the original multipartite entangled state shared by the set of network nodes, and to univocally determines the identities of the transmitter node and the receiver node in charge of using the extracted EPR pair. Furthermore, the protocol avoids to delegate the signaling arising with entanglement access control to the classical network, with the exception of the unavoidable classical communications needed for EPR extraction and qubit teleportation. Finally, the protocol supports the anonymity of the entanglement accessing nodes.
Quantum communication networks enable advanced quantum applications through remote entanglement distribution among source-destination pairs. Despite efforts to optimize entanglement distribution, fairness in multi-request scenarios has been neglected, potentially causing issues like “request starvation”. To address such issue, this paper concentrates on the unique properties of entangled systems and introduces a process-oriented fairness metric, i.e., expected throughput, departing from conventional approaches used in classical networks. Furthermore, we propose an entanglement distribution scheme named Fair-EAS, which prioritizes entanglement allocation and selection for batching multiple requests to maximize overall throughput while maintaining max-min fairness. To facilitate a convenient solution, we transform the nonlinearity of the problem into an equivalent linear programming formulation and decouple the solution into offline and online phases. In the offline phase, we design a multi-round water-filling-like optimization algorithm to determine the optimal path set for predicting entanglement allocation. In the online phase, we introduce an adaptive compensation algorithm and an entanglement “fragment” exhaustion algorithm to dynamically adjust the path set based on successfully generated entangled pairs. Comprehensive simulations show that Fair-EAS outperforms the existing schemes in terms of fairness by significantly enhancing the minimum throughput and throughput deviation among multiple requests while maintaining an overall throughput close to the optimal level.
Medium access control (MAC) and efficient spectrum allocation function particularly, are real challenges that wireless communications are facing nowadays and Dynamic Spectrum Access (DSA), enhanced with quantum computation techniques, is the most promising alternative. In such a context, we capitalize quantum games and quantum decisions strengths to design protocols that make classic communications more efficient. That is, we focus on protocols running on quantum devices whose input and output signals are classic. In this work we propose a quantum media access control (QMAC) that allows dynamic and fair spectrum allocation. Particularly, we point to two of the main DSA functions, which are Spectrum Sharing and Spectrum Allocation.
Remote entanglement distribution in an efficient and reliable manner, especially in the context of a large-scale quantum network with multiple requests, remains an unsolved challenge. The key difficulties lie in achieving spontaneous and precise control over the entanglement distribution procedure, as multiple nodes need to reach a consensus on how to perform it. From the network aspect, allocating link-layer entangled pairs as resources to achieve high efficiency is also challenging. To address these issues, we propose a decentralized Reliable Entanglement Distribution Protocol (REDP) for large-scale networks. The protocol operates in a Forward-Backward Propagation (FBP) manner, where consensus is reached hop-by-hop and disseminated to all nodes on the path. We further use probabilistic analysis and quasi-static modeling to seek the fairness and efficiency of the network based on the above transmission model. Accordingly, we introduce a Source Window Strategy (SWS) and an Entanglement Allocation Strategy (EAS) to assign sending windows and allocate resources for multiple requests, ensuring a high level of fairness and efficiency from a network perspective. Through systematic simulations involving both classical and quantum communication protocols, we demonstrate that REDP outperforms existing approaches in terms of fairness, throughput, and fidelity performance.