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

Entanglement-Assisted Communication Under Locality Constraints: From Correlated Contingencies to Scalable Quantum Networks

Michael W Barry

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.13140/rg.2.2.24214.20803

Related papers

Entanglement-Assisted Communication Networks

Janis Nötzel, Stephen DiAdamo

•Jan 1, 2020•0 citations

Entanglement assisted communication complexity measured by distinguishability

Satyaki Manna, Ankush Pandit, Anubhav Chaturvedi +1 more

We investigate the quantum advantage that can arise in typical two-party communication scenarios, where the sender and the receiver are allowed to share prior correlations. Focusing on communication tasks constrained by the distinguishability of the sender's inputs, we demonstrate that entanglement-assisted communication with both classical and quantum message can outperform classical communication supplemented with shared randomness. We begin by developing a general framework for communication tasks with pre-shared correlations. Within this framework, we establish an equivalence among entanglement-assisted classical communication, entanglement-assisted quantum communication, and quantum communication, showing that no hierarchy exists between these three paradigms. We then investigate the scenario where the receiver has no input and prove that no advantage can arise in this case. However, an advantage in the entanglement-assisted setting emerges once additional constraints are imposed on the dimension of the communicated message. This further highlights the superiority of entanglement-assisted classical communication over standard quantum communication. Then we demonstrate several tasks where the entanglement-assisted protocol using one-bit communication proves to be advantageous over classical communication. Finally, by constructing an explicit class of communication tasks, we show that a non-maximally entangled states outperform the maximally entangled state as a pre-shared resource between the communicating parties.

quant-pharXiv:2603.19105•Mar 20, 2026•6 citations

Entanglement characterization in Quantum Networks based on entanglement distance

Qi Han, Shijiao Xing, Xiao Wu +2 more

Physica A Statistical Mechanics and its Applications•Jul 22, 2026•1 citation

Emergent Operational Entanglement Graphs and Sub-Quadratic Authentication Scaling in Realistic E91 Quantum Networks

José Luis Rosales

Large-scale entanglement-based quantum key distribution (QKD) networks are commonly assumed to require authentication resources scaling quadratically with the number of users. We show that realistic quantum communication networks operating under loss, decoherence, and LOCC constraints exhibit fundamentally different scaling laws. Using Pauli transfer matrix (PTM) transport, we demonstrate that Bell correlations decay exponentially along entanglement-swapping paths, generating finite operational correlation lengths and sparse operational entanglement graphs. In sparse metropolitan quantum networks, the number of CHSH-usable Bell pairs consequently scales linearly with network size, while authentication complexity scales as \[ Θ(N\log N), \] under sparse-mixing assumptions. We further present an ancilla-assisted distributed Bell-state verification framework for realistic E91 quantum metropolitan infrastructures. Our results suggest that scalable authentication in quantum communication networks emerges directly from the physics of entanglement transport.

quant-pharXiv:2605.27434•May 25, 2026•0 citations

Entanglement distribution in quantum communication and beyond

IEEE/LEOS Summer Topical Meetings•Jul 1, 2011•0 citations

A System-Level Survey of Architectures, Noise, and Network Co-Design in QISAC

Vikram Singh Thakur, Atul Kumar, Maurizio Magarini +2 more

Quantum integrated sensing and communication (QISAC) is emerging as a key paradigm for next-generation quantum technologies, in which entanglement, coherence, and non-classical correlations are jointly exploited to enable secure communication, distributed sensing, and networked quantum functionalities. As quantum systems transition from laboratory demonstrations to deployable infrastructures, performance is increasingly limited not by individual components but by cross-layer interactions among hardware noise, channel loss, error-management strategies, and network architecture. This survey presents a system-level architectural framework for QISAC, focusing on how physical-layer constraints, quantum channel characteristics, and error-mitigation mechanisms jointly determine end-to-end performance and architectural feasibility in scalable quantum networks. We analyze representative quantum hardware platforms-including superconducting circuits, trapped ions, neutral atoms, photonic systems, and solid-state spin qubits-through the lens of coherence time, fidelity, interface capability, and technology readiness, emphasizing their implications for networked sensing and communication rather than device-level operation. The roles of quantum error correction (QEC) and entanglement purification are examined as complementary error-management layers, highlighting trade-offs among resource overhead, latency, and achievable entanglement fidelity under realistic noise and memory constraints. We further connect these architectural considerations to QISAC-enabled applications such as distributed quantum sensing, quantum key distribution (QKD), and repeater-assisted entanglement distribution, clarifying how hardware limitations and error-management choices propagate to application-level performance. By synthesizing noise, error management, and network co-design into a unified system perspective, this survey provides design-oriented insights and architectural guidelines for building scalable, noise-resilient QISAC networks.

IEEE Open Journal of the Communications Society•Jan 1, 2026•2 citations
We investigate the quantum advantage that can arise in typical two-party communication scenarios, where the sender and the receiver are allowed to share prior correlations. Focusing on communication tasks constrained by the distinguishability of the sender's inputs, we demonstrate that entanglement-assisted communication with both classical and quantum message can outperform classical communication supplemented with shared randomness. We begin by developing a general framework for communication tasks with pre-shared correlations. Within this framework, we establish an equivalence among entanglement-assisted classical communication, entanglement-assisted quantum communication, and quantum communication, showing that no hierarchy exists between these three paradigms. We then investigate the scenario where the receiver has no input and prove that no advantage can arise in this case. However, an advantage in the entanglement-assisted setting emerges once additional constraints are imposed on the dimension of the communicated message. This further highlights the superiority of entanglement-assisted classical communication over standard quantum communication. Then we demonstrate several tasks where the entanglement-assisted protocol using one-bit communication proves to be advantageous over classical communication. Finally, by constructing an explicit class of communication tasks, we show that a non-maximally entangled states outperform the maximally entangled state as a pre-shared resource between the communicating parties.
Large-scale entanglement-based quantum key distribution (QKD) networks are commonly assumed to require authentication resources scaling quadratically with the number of users. We show that realistic quantum communication networks operating under loss, decoherence, and LOCC constraints exhibit fundamentally different scaling laws. Using Pauli transfer matrix (PTM) transport, we demonstrate that Bell correlations decay exponentially along entanglement-swapping paths, generating finite operational correlation lengths and sparse operational entanglement graphs. In sparse metropolitan quantum networks, the number of CHSH-usable Bell pairs consequently scales linearly with network size, while authentication complexity scales as Θ(Nlog⁡N), Θ(N\log N), Θ(NlogN), under sparse-mixing assumptions. We further present an ancilla-assisted distributed Bell-state verification framework for realistic E91 quantum metropolitan infrastructures. Our results suggest that scalable authentication in quantum communication networks emerges directly from the physics of entanglement transport.
Quantum integrated sensing and communication (QISAC) is emerging as a key paradigm for next-generation quantum technologies, in which entanglement, coherence, and non-classical correlations are jointly exploited to enable secure communication, distributed sensing, and networked quantum functionalities. As quantum systems transition from laboratory demonstrations to deployable infrastructures, performance is increasingly limited not by individual components but by cross-layer interactions among hardware noise, channel loss, error-management strategies, and network architecture. This survey presents a system-level architectural framework for QISAC, focusing on how physical-layer constraints, quantum channel characteristics, and error-mitigation mechanisms jointly determine end-to-end performance and architectural feasibility in scalable quantum networks. We analyze representative quantum hardware platforms-including superconducting circuits, trapped ions, neutral atoms, photonic systems, and solid-state spin qubits-through the lens of coherence time, fidelity, interface capability, and technology readiness, emphasizing their implications for networked sensing and communication rather than device-level operation. The roles of quantum error correction (QEC) and entanglement purification are examined as complementary error-management layers, highlighting trade-offs among resource overhead, latency, and achievable entanglement fidelity under realistic noise and memory constraints. We further connect these architectural considerations to QISAC-enabled applications such as distributed quantum sensing, quantum key distribution (QKD), and repeater-assisted entanglement distribution, clarifying how hardware limitations and error-management choices propagate to application-level performance. By synthesizing noise, error management, and network co-design into a unified system perspective, this survey provides design-oriented insights and architectural guidelines for building scalable, noise-resilient QISAC networks.