Sequential vs. Simultaneous Entanglement Swapping under Optimal Link-Layer Control

• URL: http://arxiv.org/abs/2605.04047v1
• Date: Tue, 05 May 2026 17:59:22 GMT
• Title: Sequential vs. Simultaneous Entanglement Swapping under Optimal Link-Layer Control
• Abstract summary: Connection-less, packet-switched quantum network architectures distribute entanglement across multi-hop paths through sequential entanglement swapping.<n>We present a proof-of-principle study at fixed chain length $n = 4$ in which each link is governed by a fixed reinforcement-learning policy.<n>Sequence swapping collapses to zero end-to-end deliveries below $T_cmathrmext/= 25$, and begins recovering at $T_cmathrmext/= 50$.
• Score: 1.8829359083448898
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Connection-less, packet-switched quantum network architectures distribute entanglement across multi-hop paths through sequential entanglement swapping, in which each node acts on purely local state information. The architectural advantages over the connection-oriented alternative -- simultaneous SWAP-ASAP -- are compelling, but sequential swapping holds partial chains in intermediate buffers between successive swaps, exposing them to memory decoherence in a way simultaneous SWAP-ASAP avoids by design. We present a proof-of-principle study at fixed chain length $n = 4$ in which each elementary link is governed by a fixed reinforcement-learning policy optimizing the secret-key rate of the six-state protocol, leaving the network-layer protocol as the sole independent variable. Sweeping the network-layer memory coherence time $T_c^{\mathrm{ext}}$ over four orders of magnitude reveals a clear regime structure governed by the dimensionless ratio $T_c^{\mathrm{ext}}/τ$, where $τ$ is the per-link entanglement heralding latency. Simultaneous SWAP-ASAP delivers a constant rate across the full sweep. Sequential swapping, by contrast, collapses to zero end-to-end deliveries below $T_c^{\mathrm{ext}}/τ= 25$, and begins recovering at $T_c^{\mathrm{ext}}/τ= 50$. It remains limited by the simultaneous rate, which it saturates only at the relaxed end of the sweep. These results suggest that the connection-less penalty is a near-term phenomenon tied to present-day memory coherence rather than a fundamental property of sequential swapping.

Related papers

• Interface Capacity and Architectural Replenishment Determine Entanglement-Generation Speed in Quantum Networks [0.0]
  We show that entanglement-generation speed across a fixed network interface is governed by two distinct resources.<n> Interface capacity sets how much entangling flux is available, whereas architecture determines whether fresh degrees of freedom can continually replenish the interface and sustain repeated use of that capacity.
  arXiv  Detail & Related papers  (2026-08-19T15:16:39Z)
• A Queueing-Stability Criterion for Causal IPD-QIM Network Flow Watermarking [9.96318277344866]
  Causality lets the embedder delay packets but never advance them, so each quantization-index-modulation alignment injects nonnegative dwell into a delay buffer.<n>We model the embedder as a reflected dwell queue under the fixed dual-lattice, equiprobable-bit rule.<n>We give a testable stable-embeddability criterion and a quantization-step configuration baseline for causal QIM network flow watermarking.
  arXiv  Detail & Related papers  (2026-07-16T13:04:21Z)
• Lazy-Move Compilation for Neutral-Atom Quantum Computers via a Buffer-Relay Fabric [15.14867468741735]
  BRIDGE is a Buffer-Relay Interconnect for Data-stable Gate Execution.<n>It co-designs a static, compiler-managed buffer-relay fabric with a lazy-move compiler that exploits it.<n>It attains a geometric-mean $sim$10$times$ higher total fidelity than ZAP and $sim$16$times$ than Enola.
  arXiv  Detail & Related papers  (2026-06-30T15:38:42Z)
• Looped SSMs: Depth-Recurrence and Input Reshaping for Time Series Classification [50.994194925685434]
  We show that a looped SSM with $k$ parameters iterated $L$ times consistently closely matches or outperforms a standard SSM.<n>We also show that input reshaping is an equally neglected design axis.
  arXiv  Detail & Related papers  (2026-05-15T15:18:12Z)
• Boundary-Aware Stabilizer Scheduling for Distributed Quantum Error Correction [1.556083770714207]
  In topological quantum error correction, such as color codes, parity checks require remote CNOT operations using heralded Bell pairs.<n>A natural way to reduce this overhead is to skip some seam measurements.<n>We develop a scheduling module that integrates directly into standard syndrome-extraction circuits.
  arXiv  Detail & Related papers  (2026-04-24T11:49:07Z)
• Time Is All It Takes: Spike-Retiming Attacks on Event-Driven Spiking Neural Networks [87.16809558673403]
  Spiking neural networks (SNNs) compute with discrete spikes and exploit temporal structure.<n>We study a timing-only adversary that retimes existing spikes while preserving spike counts and amplitudes in event-driven SNNs.
  arXiv  Detail & Related papers  (2026-02-03T09:06:53Z)
• Efficient Parallel Training Methods for Spiking Neural Networks with Constant Time Complexity [63.56009745101597]
  Spiking Neural Networks (SNNs) often suffer from high time complexity $O(T)$ due to the sequential processing of $T$ spikes.<n>We propose a novel Fixed-point Parallel Training (FPT) method to accelerate SNN training without modifying the network architecture.
  arXiv  Detail & Related papers  (2025-06-10T13:27:27Z)
• Scaling Up Liquid-Resistance Liquid-Capacitance Networks for Efficient Sequence Modeling [50.994194925685434]
  LrcSSM is a $textitnon-linear$ recurrent model that processes long sequences as fast as today's linear state-space layers.<n>By forcing its Jacobian matrix to be diagonal, the full sequence can be solved in parallel.<n>LrcSSM offers a formal gradient-stability guarantee that other input-varying systems such as Liquid-S4 do not provide.
  arXiv  Detail & Related papers  (2025-05-27T20:02:59Z)
• DASA: Delay-Adaptive Multi-Agent Stochastic Approximation [64.32538247395627]
  We consider a setting in which $N$ agents aim to speedup a common Approximation problem by acting in parallel and communicating with a central server. To mitigate the effect of delays and stragglers, we propose textttDASA, a Delay-Adaptive algorithm for multi-agent Approximation.
  arXiv  Detail & Related papers  (2024-03-25T22:49:56Z)
• Entanglement Routing over Networks with Time Multiplexed Repeaters [7.394870163112929]
  Quantum networks will be able to service consumers with long-distance entanglement by use of quantum repeaters.<n>Global link state knowledge is required to maximize the rate of entanglement generation between any two consumers.<n>We propose two entanglement routing protocols that require only local link state knowledge to relax the quantum memory coherence time requirements.
  arXiv  Detail & Related papers  (2023-08-29T05:21:54Z)
• Sharper Convergence Guarantees for Asynchronous SGD for Distributed and Federated Learning [77.22019100456595]
  We show a training algorithm for distributed computation workers with varying communication frequency. In this work, we obtain a tighter convergence rate of $mathcalO!!!(sigma2-2_avg!! . We also show that the heterogeneity term in rate is affected by the average delay within each worker.
  arXiv  Detail & Related papers  (2022-06-16T17:10:57Z)
• ADOM: Accelerated Decentralized Optimization Method for Time-Varying Networks [124.33353902111939]
  We propose ADOM - an accelerated method for smooth and strongly convex decentralized optimization over time-varying networks. Up to a constant factor, which depends on the network structure only, its communication is the same as that of accelerated Nesterov method.
  arXiv  Detail & Related papers  (2021-02-18T09:37:20Z)

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.