Sequential vs. Synchronized Entanglement Swapping: QKD Secret-Key Rate under Optimized Link-Layer Control

arXiv:2605.04047 · quant-ph, cs.NI · Submitted 2026-05-05 · Read on arXiv

Listen

Transcript

Introduction to the show: ident: Quantum Radio. Generated commentary on the latest quantum physics and condensed matter papers.

Kai: Today's paper: "Sequential vs. Synchronized Entanglement Swapping".

Mira: The gist: Sequential entanglement swapping exhibits a collapse to zero end-to-end deliveries below Textc /τ = 25, while simultaneous SWAP-ASAP maintains a constant rate across the full sweep,

Kai: First, who's behind it and why it matters.

Paper summary: Kai: So, to recap, this paper by Srivastava et al is diving into how sequential versus simultaneous entanglement swapping affects the secret-key rate in a quantum key distribution setup over a simulated four-hop chain using an idealized Werner-state noise model > Mira which essentially sets up the comparison between two distinct network layer protocols.

Mira: The main thesis they are pushing is that they isolate network effects by holding the link-layer policy fixed, meaning they only vary the protocol—sequential or simultaneous SWAP-ASAP—to see how that choice dictates performance > Lev which means you can really focus on the swapping timing mechanism without worrying about the link generation itself.

Kai: The paper claims that for sequential swapping, you get a collapse to zero end-to-end deliveries below Textc over tau equals twenty-five but it starts recovering at Textc over tau equals fifty > Lev which is a big indicator of how sensitive the sequential method is to memory limits.

Mira: Simultaneously, the synchronized SWAP-ASAP protocol delivers a constant rate across the full range of coherence time they simulated, which contrasts sharply with the sequential approach that struggles as storage time increases > Kai so one protocol seems robust against long waiting times while the other fails quickly.

Lev: From an engineering standpoint, this means if we’re building hardware today, we need to be concerned about Textc over tau being smaller than twenty-five if we want to use a sequential approach for any meaningful key generation > Mira because that's where you lose progress completely > Kai and it highlights the difficulty of maintaining coherence in those intermediate buffers.

Mira: The paper also derives a closed-form condition for when the sequential protocol can actually preserve progress across time steps, which is useful for understanding the theoretical limits of that method > Lev because it gives us a mathematical way to predict if we’re going to succeed or not.

Kai: So, what does this mean in practice? It suggests that the connectionless penalty for sequential swapping is mostly tied to present-day memory coherence, not some fundamental flaw in the swapping concept itself > Mira which frames it as a hardware platform problem rather than a pure protocol failure.

Lev: It sounds like we need better memory or faster processing to push past that threshold of Textc over tau equals twenty-five if we want the advantages of sequential operation > Kai because that’s the practical requirement for using that method effectively in our experiments.

Conclusion: Kai: Looking at this study, the authors are Srivastava, Sabavat, Jain, Scheller-Wolf, Tayur, Tipper, Krishnamurthy, Babay and Seshadreesan > Mira who mapped out how these two swapping methods play out under optimized link-layer control.

Mira: The main implication is that the choice between sequential and simultaneous swapping isn't just about which one you prefer topologically; it’s fundamentally about your hardware’s coherence time versus how long you need to wait for links to deliver pairs > Lev because they show that the viability depends on that ratio, Textc over tau.

Kai: Essentially, if your memory can only hold pairs for a short time—say less than twenty-five units of Textc over tau—then the sequential method just won't give you any usable key bits > Lev because those stored pairs expire too fast > Mira which means we’re currently limited by memory coherence in this way.

Mira: And even if you have long memory, the synchronized approach gives a steady rate regardless of how long you wait, whereas the sequential one hits zero and then starts recovering when that ratio hits fifty > Kai so for reliable key distribution right now, synchronization seems safer for maintaining a constant flow.

Lev: For real hardware implementation, this means we need to design systems where the memory coherence time is much larger than that threshold of twenty-five if we want to leverage the sequential advantage > Kai otherwise, you’re better off sticking with synchronized timing for stability in your experiments > Mira because it handles the waiting time better.

Priyam Srivastava, †Akshat R. Sabavat, ‡Siddharth Jain, ‡Alan Scheller-Wolf, ‡Sridhar Tayur, ‱David Tipper, 㪕Prashant Krishnamurthy, 㪖Amy Babay, 㪗Kaushik P. Seshadreesan

Department of Informatics & Networked Systems, University of Pittsburgh · Department of Physics & Astronomy, University of Pittsburgh · Tepper School of Business, Carnegie Mellon University

quant-ph, cs.NI

Submitted: 2026-05-05

Updated: 2026-10-13

Comments: Accepted at ACM PQQS 2026

License: http://creativecommons.org/licenses/by/4.0/

Importance score: 85/100

The gist: The gist: Sequential entanglement swapping exhibits a collapse to zero end-to-end deliveries below Textc /τ = 25, while simultaneous SWAP-ASAP maintains a constant rate across the full sweep,

Key concepts

Sequential (swap-and-wait) Discipline: This approach builds and stores partial entanglement chains hop-by-hop. It swaps links as soon as adjacent pairs are ready, causing the partially assembled chain to wait for the next link. This method is connectionless but suffers from fidelity loss in stored pairs, leading to a total collapse in key rate when memory coherence is low.
Simultaneous (wait-and-swap) Discipline: This protocol waits until all links are ready before executing any swaps in parallel. It generates entanglement on every link first and then performs all necessary swaps simultaneously. This method maintains a constant delivery rate across various noise conditions, suggesting it is more robust under current hardware limitations.
Textc / τ Ratio: This dimensionless ratio compares the external memory coherence time (Textc) to the time step (τ). It defines the operational regime for entanglement swapping. Below a ratio of 25, sequential swapping fails, while above 50, it begins to recover. This ratio is identified as the key hardware metric needed for connectionless protocols to succeed.
Link-Layer Control Invariance: The study fixed the link-layer policy using reinforcement learning. Remarkably, all ten tested policies converged to a single operating point (0.1357–0.1358 bits/tick). This means the specific way links are controlled does not significantly alter the fundamental performance limits imposed by memory coherence time, isolating network-layer effects.

Terminology

Entanglement — 4× in this paper · explained in 4 episodes

Summary

The gist: Sequential entanglement swapping exhibits a collapse to zero end-to-end deliveries below Textc /τ = 25, while simultaneous SWAP-ASAP maintains a constant rate across the full sweep, suggesting that memory coherence time is the dominant factor determining viability in current hardware regimes.

Architectural Comparison

The paper compares two paradigms for timing entanglement swapping relative to link-level entanglement generation: Simultaneous (or “wait-and-swap”) protocols generate entanglement on every link first and then execute all swaps in parallel Sequential (or “swap-and-wait”) protocols extend a chain hop-by-hop: as soon as adjacent links produce entanglement they swap, and the partially assembled chain waits for the next link to be ready. This sequential approach admits a fully distributed, connection-less implementation in which each node acts on purely local state information.

Link-Layer Control and Invariance

The study isolates network-level effects by holding the link-layer policy fixed and varying only the network-layer protocol. The link layer is governed by a reinforcement learning agent trained to maximize the per-link six-state QKD secret-key rate. Remarkably, all ten link policies converge to the same dimensionless operating point within four-decimal precision: 0.1357–0.1358 bits/tick. This indicates that the link-layer task admits a single dimensionless operating point at 0.1357–0.1358 bits/tick, where a tick corresponds to the per-link entanglement heralding latency.

Coherence-Time Regime Structure

The performance comparison is analyzed by sweeping the external memory coherence time Textc from a relaxed-coherence reference down to a stressed regime. The results reveal a clear regime structure governed by the dimensionless ratio Textc /τ. Specifically, sequential swapping collapses to zero end-to-end deliveries below Textc /τ = 25, and begins recovering at Textc /τ = 50. Simultaneously SWAP-ASAP delivers a constant rate across the full stressed sweep.

Mechanism of Collapse

The collapse of sequential performance is explained by the chain-buffer dwell time diagnostic. A delivered link pair stored in a link buffer ages at rate Textc and is discarded once its fidelity falls to the level Freq(n) at which the end-to-end fidelity after n−1 swaps would still meet Fmin. When the link-buffer cutoff falls below τ, link pairs expire faster than the controller can use them.

Conclusion and Implication

The results suggest that the connectionless penalty is a near-term phenomenon tied to present-day memory coherence rather than a fundamental property of sequential swapping. The same Textc /τ ratio that separates the two regimes in our simulations is the figure of merit a hardware platform would need to surpass before the systems-level advantages of connectionless, packet-switched operation become accessible without performance compromise.

Limitations

Several limitations bound the present scope and motivate direct extensions. The regime characterization is performed at n = 4. Sequential’s chain-assembly window scales linearly in n while simultaneous SWAP-ASAP’s collapse remains a single tick. The threshold Textc /τ should therefore grow with chain length, and quantitative confirmation at larger n would localize the scaling. The crossover from substantial gap to equivalence is bracketed by our two measurement regimes but not directly localized; sweeping the intermediate Textc /τ range would identify the precise location of the transition. The protocol selection should therefore be guided by the operating Textc /τ ratio rather than by topology alone. This narrowness is a useful diagnostic for hardware roadmaps: "the same Textc /τ ratio that separates the two regimes in our simulations is the figure of merit a hardware platform would need to surpass before the systems-level advantages of connectionless, packet-switched operation become accessible without performance compromise". The regime structure is governed entirely by Textc, not by internal communication memory or by the link-layer policy <ref:2605.

Improvements for AI systems

Improved AI system can perform optimal protocol selection based on coherence time rather than topology alone, as suggested by Protocol selection should therefore be guided by the operating Textc /τ ratio rather than by topology alone. This allows for a hardware-aware decision on whether to use sequential or simultaneous swapping to maximize performance in real-world quantum repeater deployments.
Improved AI system can predict the operational viability of connection-less protocols based on external memory coherence, specifically by identifying the regime structure governed by the dimensionless ratio Textc /τ. This enables proactive engineering decisions regarding required hardware improvements to close the connection-less gap.
Improved AI system can diagnose whether performance degradation is due to fundamental protocol differences or hardware limitations by monitoring the chain-buffer dwell time diagnostic. This allows researchers to distinguish between a near-term phenomenon tied to present-day memory coherence rather than a fundamental property of sequential swapping and actual protocol inefficiencies.
Improved AI system can optimize link-layer operations by utilizing a fixed, empirically determined operating point, as demonstrated by the finding that all ten policies converge to the same dimensionless operating point within four-decimal precision: 0.1357–0.1358 bits/tick. This ensures that link-level entanglement generation maximizes secret-key rates regardless of specific link characteristics (L and Tintc).

Abstract

Quantum repeater chains build long-distance entanglement for quantum key distribution (QKD) by creating pairs on short links and joining them through entanglement swapping. Because stored pairs lose fidelity while they wait, swap timing can affect the secret-key rate. We study how network-layer swap scheduling affects six-state QKD on a simulated four-hop chain under an idealized Werner-state noise model. We compare a sequential (swap-and-wait) discipline, which builds and stores partial chains, with a synchronized (wait-and-swap) discipline, which waits until all links are ready before swapping. Both use the same reinforcement-learned link controllers, isolating the effect of the swapping discipline. When stored pairs cannot retain sufficient fidelity for one network time step, our sequential implementation produces no key, while synchronized retains a small key rate from simultaneous link deliveries. Once sequential becomes viable, it outperforms synchronized by up to 19.1% in the homogeneous chains studied, with the advantage decreasing as memory lifetime increases. We predict the synchronized short-memory pair-delivery rate from link-delivery statistics and derive a closed-form condition for when sequential can preserve progress across time steps. We also examine chains with one slower link, where partial chains can wait and decay at the bottleneck. In this setting, synchronized slightly outperforms sequential at longer memory lifetimes. Moving the slow link has little effect on key rate away from the transition region but strongly affects sequential link-buffer occupancy. Choosing a swapping discipline therefore depends not only on whether memories can preserve partial progress, but also on how the link configuration determines where that progress must wait and decay.