Entanglement Distribution in Lossy Quantum Networks

• URL: http://arxiv.org/abs/2503.24347v1
• Date: Mon, 31 Mar 2025 17:32:18 GMT
• Title: Entanglement Distribution in Lossy Quantum Networks
• Authors: Leonardo Oleynik, Junaid ur Rehman, Seid Koudia, Symeon Chatzinotas,
• Abstract summary: Entanglement distribution is essential for unlocking the potential of distributed quantum information processing.<n>We consider an $N$-partite network where entanglement is distributed via a central source over lossy channels.<n>We develop a general mathematical framework to assess the optimal average bipartite entanglement shared in a lossy distribution.
• Score: 33.69464508324306
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Entanglement distribution is essential for unlocking the potential of distributed quantum information processing. We consider an $N$-partite network where entanglement is distributed via a central source over lossy channels, and network participants cooperate to establish entanglement between any two chosen parties under local operations and classical communication (LOCC) constraints. We develop a general mathematical framework to assess the optimal average bipartite entanglement shared in a lossy distribution, and introduce a tractable lower bound by optimizing over a subset of single-parameter LOCC transformations. Our results show that probabilistically extracting Bell pairs from W states is more advantageous than deterministically extracting them from GHZ-like states in lossy networks, with this advantage increasing with network size. We further extend our analysis analytically, proving that W states remain more effective in large-scale networks. These findings offer valuable insights into the practical deployment of near-term networks, revealing a fundamental trade-off between deterministic entanglement distribution protocols and loss-sensitive resources.

Related papers

• Satellite-Aided Entanglement Distribution for Optimized Quantum Networks [30.362736262973463]
  Quantum internet needs to ensure timely provision of entangled qubits to be used in tasks that involve distributed quantum computing or sensing.<n>Pre-distribution of entanglements should aim to minimize the amount of qubits used, as this decreases the risk of decoherence and thus degradation of the entangled state.<n>Satellite-aided Entanglement Distribution (SED) can significantly enhance the performance of small quantum networks.
  arXiv  Detail & Related papers  (2025-02-25T11:21:20Z)
• Measuring network quantum steerability utilizing artificial neural networks [4.041957800585053]
  Network quantum steering plays a pivotal role in quantum information science.<n>We develop a neural network-based method for measuring network quantum steerability.<n>We analytically demonstrate that the network steering thresholds are determined by the curve $nu omega = 1/3$ under the corresponding configuration.
  arXiv  Detail & Related papers  (2025-02-24T12:03:04Z)
• Statistical analysis of Multipath Entanglement Purification in Quantum Networks [0.0]
  Multipath entanglement purification (MP-EP) can exploit the network's complex structure to strengthen the entanglement connection between node pairs separated by appropriate graph distances.<n>We investigate the network scenarios in which MP-EP outperforms entanglement distribution over single network paths.<n>We find that MP-EP can bost the entanglement connection between suitably separated node pairs to reach fidelities sufficient for a given quantum task.
  arXiv  Detail & Related papers  (2025-02-13T07:00:53Z)
• Distributed Value Decomposition Networks with Networked Agents [3.8779763612314633]
  We propose distributed value decomposition networks (DVDN) that generate a joint Q-function that factorizes into agent-wise Q-functions.<n>DVDN overcomes the need for centralized training by locally estimating the shared objective.<n> Empirically, both algorithms approximate the performance of value decomposition networks, in spite of the information loss during communication.
  arXiv  Detail & Related papers  (2025-02-11T15:23:05Z)
• Decentralized Federated Learning Over Imperfect Communication Channels [68.08499874460857]
  This paper analyzes the impact of imperfect communication channels on decentralized federated learning (D-FL) It determines the optimal number of local aggregations per training round, adapting to the network topology and imperfect channels. It is seen that D-FL, with an optimal number of local aggregations, can outperform its potential alternatives by over 10% in training accuracy.
  arXiv  Detail & Related papers  (2024-05-21T16:04:32Z)
• Networked Communication for Decentralised Agents in Mean-Field Games [59.01527054553122]
  We introduce networked communication to the mean-field game framework.<n>We prove that our architecture has sample guarantees bounded between those of the centralised- and independent-learning cases.<n>We show that our networked approach has significant advantages over both alternatives in terms of robustness to update failures and to changes in population size.
  arXiv  Detail & Related papers  (2023-06-05T10:45:39Z)
• Decentralized Learning over Wireless Networks: The Effect of Broadcast with Random Access [56.91063444859008]
  We investigate the impact of broadcast transmission and probabilistic random access policy on the convergence performance of D-SGD. Our results demonstrate that optimizing the access probability to maximize the expected number of successful links is a highly effective strategy for accelerating the system convergence.
  arXiv  Detail & Related papers  (2023-05-12T10:32:26Z)
• Influence of noise in entanglement-based quantum networks [0.0]
  We consider entanglement-based quantum networks, where multipartite entangled resource states are distributed and stored among the nodes. We study the influence of noise in this process, where we consider imperfections in state preparation, memories, and measurements. We find that in large networks, high-dimensional cluster states are favorable and lead to a significantly higher target state fidelity.
  arXiv  Detail & Related papers  (2023-05-05T18:00:06Z)
• Binarizing Sparse Convolutional Networks for Efficient Point Cloud Analysis [93.55896765176414]
  We propose binary sparse convolutional networks called BSC-Net for efficient point cloud analysis. We employ the differentiable search strategies to discover the optimal opsitions for active site matching in the shifted sparse convolution. Our BSC-Net achieves significant improvement upon our srtong baseline and outperforms the state-of-the-art network binarization methods.
  arXiv  Detail & Related papers  (2023-03-27T13:47:06Z)
• Collaborative Mean Estimation over Intermittently Connected Networks with Peer-To-Peer Privacy [86.61829236732744]
  This work considers the problem of Distributed Mean Estimation (DME) over networks with intermittent connectivity. The goal is to learn a global statistic over the data samples localized across distributed nodes with the help of a central server. We study the tradeoff between collaborative relaying and privacy leakage due to the additional data sharing among nodes.
  arXiv  Detail & Related papers  (2023-02-28T19:17:03Z)
• A scheme for multipartite entanglement distribution via separable carriers [68.8204255655161]
  We develop a strategy for entanglement distribution via separable carriers that can be applied to any number of network nodes. We show that our protocol results in multipartite entanglement, while the carrier mediating the process is always in a separable state with respect to the network.
  arXiv  Detail & Related papers  (2022-06-20T10:50:45Z)
• Decentralized Learning for Channel Allocation in IoT Networks over Unlicensed Bandwidth as a Contextual Multi-player Multi-armed Bandit Game [134.88020946767404]
  We study a decentralized channel allocation problem in an ad-hoc Internet of Things network underlaying on the spectrum licensed to a primary cellular network. Our study maps this problem into a contextual multi-player, multi-armed bandit game, and proposes a purely decentralized, three-stage policy learning algorithm through trial-and-error.
  arXiv  Detail & Related papers  (2020-03-30T10:05:35Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.