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:2305.01276 · IEEE Transactions on Communications

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

Jessica Illiano, Marcello Caleffi, Michele Viscardi, Angela Sara Cacciapuoti

Published Dec 18, 2023• 20 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1109/tcomm.2023.3344140

Related papers

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

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

Akihisa Takahashi, Yoshito Tobe

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.

arXiv:2510.02895•Oct 3, 2025•0 citations

Multipartite Entanglement for the Quantum Internet

Si‐Yi Chen, Angela Sara Cacciapuoti, Xiu‐Bo Chen +1 more

Multipartite entanglement plays a crucial role in the Quantum Internet design, due to its potentiality of significantly increasing the network performance. In this paper, we identify the four key network functionalities for managing multipartite entanglement among remote nodes. And we discuss each functionality by considering - as case study - a specific multipartite state, which exhibits an attractive computing feature. Specifically, the designed state allows an arbitrary entangled node to calculate - in a distributed way - the sum of a set of values arbitrarily selected by the remaining entangled nodes.

International Conference on Communications•May 28, 2023•3 citations

General framework for genuine multipartite entanglement detection

Xin-Yu Xu, Qing Fa Zhou, Shuai Zhao +4 more

The design of detection strategies for multipartite entanglement stands as a central importance on our understanding of fundamental quantum mechanics and has had a substantial impact on quantum information applications. However, accurate and robust detection approaches are severely hindered, particularly when the number of nodes grows rapidly like in a quantum network. Here we present a general and operational framework that generates alternative entanglement witness for an arbitrary targeted state. The framework enjoys a systematic and high-efficient character and allows to substantiate genuine multipartite entanglement for a variety of states that arise naturally in practical situations and to dramatically outperform currently standard methods. With excellent noise tolerance, our framework should be broadly applicable to witness genuine multipartite entanglement in various practically scenarios and to facilitate the best use of entangled resources in the emerging area of quantum network.

arXiv:2211.05563•Physical Review A•May 12, 2023•8 citations

Entanglement access control for the quantum Internet

Laszlo Gyongyosi, Sándor Imre

Quantum entanglement is a crucial element of establishing the entangled network structure of the quantum Internet. Here we define a method to achieve controlled entanglement access in the quantum Internet. The proposed model defines different levels of entanglement accessibility for the users of the quantum network. The path cost is determined by an integrated criterion on the entanglement fidelities between the quantum nodes and the probabilities of entangled connections of an entangled path. We reveal the connection between the number of available entangled paths and the accessible fidelity of entanglement and reliability in the end nodes. The scheme provides an efficient model for entanglement access control in the experimental quantum Internet.

arXiv:1905.00256•Quantum Information Processing•Feb 28, 2019•54 citations

Optimising multipartite entanglement manipulation in quantum networks

Shashank Shekhar, David Elkouss, Siddhartha Santra

Long-range, genuine multipartite entanglement (GME) between distant parties in a quantum network is a crucial resource for distributed quantum information processing. Through controlled manipulation of short-range GME states in the network via stochastic local operations aided by classical communication (SLOCC), long-range GME can be established between selected target nodes on demand. Optimizing such multipartite entanglement distribution protocols under constraints imposed by the network architecture, target-node set, and available resource budget is a key challenge in resource-efficient manipulation of GME. We present a general operational framework for manipulating GME in quantum networks by classifying the relevant networking operations into three broad primitives-inflation, deflation, and purification-reflecting their effect on the proliferation of GME through general bounds and illustrative examples. We show how these primitives can be combined to construct a broad class of multipartite quantum repeater protocols, enabling their systematic optimization, and demonstrate the framework with a simple example. Applying our approach to networks of Dür-Cirac-Tarrach states reveals a rich landscape of achievable end-to-end GME and accessible entanglement classes. More generally, our framework provides a systematic approach to the construction and optimization of multipartite quantum repeater protocols for scalable and resource-efficient GME distribution in quantum networks.

quant-pharXiv:2610.21420•Oct 16, 2026•0 citations
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.
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.
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 in the Quantum Internet design, due to its potentiality of significantly increasing the network performance. In this paper, we identify the four key network functionalities for managing multipartite entanglement among remote nodes. And we discuss each functionality by considering - as case study - a specific multipartite state, which exhibits an attractive computing feature. Specifically, the designed state allows an arbitrary entangled node to calculate - in a distributed way - the sum of a set of values arbitrarily selected by the remaining entangled nodes.
The design of detection strategies for multipartite entanglement stands as a central importance on our understanding of fundamental quantum mechanics and has had a substantial impact on quantum information applications. However, accurate and robust detection approaches are severely hindered, particularly when the number of nodes grows rapidly like in a quantum network. Here we present a general and operational framework that generates alternative entanglement witness for an arbitrary targeted state. The framework enjoys a systematic and high-efficient character and allows to substantiate genuine multipartite entanglement for a variety of states that arise naturally in practical situations and to dramatically outperform currently standard methods. With excellent noise tolerance, our framework should be broadly applicable to witness genuine multipartite entanglement in various practically scenarios and to facilitate the best use of entangled resources in the emerging area of quantum network.
Quantum entanglement is a crucial element of establishing the entangled network structure of the quantum Internet. Here we define a method to achieve controlled entanglement access in the quantum Internet. The proposed model defines different levels of entanglement accessibility for the users of the quantum network. The path cost is determined by an integrated criterion on the entanglement fidelities between the quantum nodes and the probabilities of entangled connections of an entangled path. We reveal the connection between the number of available entangled paths and the accessible fidelity of entanglement and reliability in the end nodes. The scheme provides an efficient model for entanglement access control in the experimental quantum Internet.
Long-range, genuine multipartite entanglement (GME) between distant parties in a quantum network is a crucial resource for distributed quantum information processing. Through controlled manipulation of short-range GME states in the network via stochastic local operations aided by classical communication (SLOCC), long-range GME can be established between selected target nodes on demand. Optimizing such multipartite entanglement distribution protocols under constraints imposed by the network architecture, target-node set, and available resource budget is a key challenge in resource-efficient manipulation of GME. We present a general operational framework for manipulating GME in quantum networks by classifying the relevant networking operations into three broad primitives-inflation, deflation, and purification-reflecting their effect on the proliferation of GME through general bounds and illustrative examples. We show how these primitives can be combined to construct a broad class of multipartite quantum repeater protocols, enabling their systematic optimization, and demonstrate the framework with a simple example. Applying our approach to networks of Dür-Cirac-Tarrach states reveals a rich landscape of achievable end-to-end GME and accessible entanglement classes. More generally, our framework provides a systematic approach to the construction and optimization of multipartite quantum repeater protocols for scalable and resource-efficient GME distribution in quantum networks.