Advantages of Global Entanglement-Distillation Policies in Quantum Repeater Chains

• URL: http://arxiv.org/abs/2510.06737v1
• Date: Wed, 08 Oct 2025 07:50:38 GMT
• Title: Advantages of Global Entanglement-Distillation Policies in Quantum Repeater Chains
• Authors: Iftach Yakar, Michael Ben-Or,
• Abstract summary: Quantum repeaters are essential for achieving long-distance quantum communication due to photon loss.<n>Current quantum repeater generations use entanglement distillation protocols, where the decision of when to perform distillation depends on either local or global knowledge.<n>We ask whether global deterministic policies outperform local ones in terms of communication rate.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum repeaters are essential for achieving long-distance quantum communication due to photon loss, which grows exponentially with the channel distance. Current quantum repeater generations use entanglement distillation protocols, where the decision of when to perform distillation depends on either local or global knowledge. Recent approaches for quantum repeaters, such as Mantri et al. (arXiv:2409.06152), consider using deterministic local decision policies for entanglement distillation. We ask whether global deterministic policies outperform local ones in terms of communication rate. We simulate equidistant repeater chains, assisted by two-way classical communication, and compare local and global policies for distillation decisions, spanning large distances and varying network and hardware parameters. Our findings show that global deterministic policies consistently outperform these local ones, and in some cases, determine whether secret communication is possible. For large repeater chains ($N>512$), global policies improve SKR by two orders of magnitude. These results suggest that local distillation decisions in quantum repeater chains may not be optimal, and may inform future protocol design.

Related papers

• Robustness of quantum data hiding against entangled catalysts and memory [47.791962198275066]
  We develop a general framework for state discrimination that unifies catalytic and memory-assisted local discrimination protocols.<n>We prove that when the hiding states are separable, neither entangled catalysts nor quantum memory can increase the optimal discrimination probability.<n>In contrast, for some entangled states, a reusable quantum memory turns locally indistinguishable states into ones that can be discriminated almost perfectly.
  arXiv  Detail & Related papers  (2025-11-06T14:36:36Z)
• Optimizing entanglement distribution via noisy quantum channels [44.99833362998488]
  Entanglement distribution is a crucial problem in quantum information science.<n>We investigate strategies for distributing quantum entanglement between two distant parties through noisy quantum channels.
  arXiv  Detail & Related papers  (2025-06-06T13:48:20Z)
• Measurement-Based Entanglement Distillation and Constant-Rate Quantum Repeaters over Arbitrary Distances [3.965287302235051]
  Measurement-based quantum repeaters employ entanglement distillation and swapping across links.<n>We introduce a systematic protocol for measurement-based entanglement distillation and its application to repeaters.<n>We propose a measurement-based repeater protocol based on quantum low-density parity-check codes.
  arXiv  Detail & Related papers  (2025-02-16T15:53:09Z)
• Entanglement Routing using Quantum Error Correction for Distillation [2.26958010283863]
  Bell-state measurement (BSM) on entangled states shared between quantum repeaters is the fundamental operation used to route entanglement in quantum networks. We use quantum error correcting codes (QECCs) for emphdeterministic entanglement distillation to route Werner states on a chain of repeaters.
  arXiv  Detail & Related papers  (2024-05-01T20:25:36Z)
• Reducing classical communication costs in multiplexed quantum repeaters using hardware-aware quasi-local policies [5.405186125924916]
  We introduce textitquasi-local policies for multiplexed quantum repeater chains.<n>In quasi-local policies, nodes have increased knowledge of the state of the repeater chain, but not necessarily full, global knowledge.<n>Our policies also outperform the well-known and widely studied nested purification and doubling swapping policy.
  arXiv  Detail & Related papers  (2024-01-24T01:13:55Z)
• Federated Natural Policy Gradient and Actor Critic Methods for Multi-task Reinforcement Learning [46.28771270378047]
  Federated reinforcement learning (RL) enables collaborative decision making of multiple distributed agents without sharing local data trajectories. In this work, we consider a multi-task setting, in which each agent has its own private reward function corresponding to different tasks, while sharing the same transition kernel of the environment. We learn a globally optimal policy that maximizes the sum of the discounted total rewards of all the agents in a decentralized manner.
  arXiv  Detail & Related papers  (2023-11-01T00:15:18Z)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• Fast and reliable entanglement distribution with quantum repeaters: principles for improving protocols using reinforcement learning [0.6249768559720122]
  Future quantum technologies will rely on networks of shared entanglement between spatially separated nodes. We provide improved protocols/policies for entanglement distribution along a linear chain of nodes.
  arXiv  Detail & Related papers  (2023-03-01T19:05:32Z)
• GradSkip: Communication-Accelerated Local Gradient Methods with Better Computational Complexity [54.585248253601314]
  We study a class of distributed optimization algorithms that aim to alleviate high communication costs by allowing clients to perform multiple local gradient-type training steps before communication.<n>In particular, we prove that our modified method, GradSkip, converges linearly under the same assumptions and has the same accelerated communication complexity.
  arXiv  Detail & Related papers  (2022-10-28T20:59:06Z)
• Optimal entanglement distribution policies in homogeneous repeater chains with cutoffs [1.9021200954913475]
  We study the limits of bipartite entanglement distribution using a chain of quantum repeaters with quantum memories. We find global-knowledge policies that minimize the expected time to produce end-to-end entanglement.
  arXiv  Detail & Related papers  (2022-07-13T22:25:21Z)
• Entanglement catalysis for quantum states and noisy channels [41.94295877935867]
  We investigate properties of entanglement and its role for quantum communication. For transformations between bipartite pure states, we prove the existence of a universal catalyst. We further develop methods to estimate the number of singlets which can be established via a noisy quantum channel.
  arXiv  Detail & Related papers  (2022-02-10T18:36:25Z)
• Distributed Q-Learning with State Tracking for Multi-agent Networked Control [61.63442612938345]
  This paper studies distributed Q-learning for Linear Quadratic Regulator (LQR) in a multi-agent network. We devise a state tracking (ST) based Q-learning algorithm to design optimal controllers for agents.
  arXiv  Detail & Related papers  (2020-12-22T22:03:49Z)

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.