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

arXiv:2601.18351

An Adaptive Purification Controller for Quantum Networks: Dynamic Protocol Selection and Multipartite Distillation

Pranav Kulkarni, Leo Sünkel, Michael Kölle

quant-phcs.DCSubmitted Jan 26, 2026• Announced Jan 27, 2026• 0 citations• Revised Jan 27, 2026 (v2)
v1 · Jan 26, 2026v2 · Jan 27, 2026v3 · Jan 29, 2026
arXivHTMLPDF

Abstract

Efficient entanglement distribution is the cornerstone of the Quantum Internet. However, physical link parameters such as photon loss, memory coherence time, and gate error rates fluctuate dynamically, rendering static purification strategies suboptimal. In this paper, we propose an Adaptive Purification Controller (APC) that autonomously optimizes the entanglement distillation sequence to maximize the "goodput," the rate of delivered pairs meeting a strict fidelity threshold. By treating protocol selection as a resource allocation problem, the APC dynamically switches between purification depths and protocol families (e.g., BBPSSW vs. DEJMPS) to navigate the trade-off between generation rate and state quality. Using a dynamic programming planner with Pareto pruning, simulation results demonstrate that our approach eliminates the "fidelity cliffs" inherent in static protocols and prevents resource wastage in high-noise regimes. Furthermore, we extend the controller to heterogeneous scenarios, demonstrating robustness for both multipartite GHZ state generation and continuous variable systems using effective noiseless linear amplification models. We benchmark its computational overhead, confirming real-time feasibility with decision latencies in the millisecond range per link.

Related papers

Adaptive Entanglement Distillation

Sijie Cheng, Narayanan Rengaswamy

Quantum network applications impose a variety of requirements on entanglement resources in terms of rate, fidelity, latency, and more. The repeaters in the quantum network must combine good methods for entanglement generation, effective entanglement distillation, and smart routing protocols to satisfy these application requirements. In this work, we focus on entanglement distillation in a linear chain of quantum repeaters. While conventional approaches reuse the same distillation scheme over multiple hop lengths after entanglement swaps, we propose a novel adaptive quantum error correction (QEC) scheme that boosts end-to-end metrics. Specifically, depending on the network operating point, we adapt the code used in distillation over successive rounds to monotonically increase the rate while also improving fidelity. We demonstrate the effectiveness of this strategy using three codes, with parameters [[9,1,3]], [[9,2,3]], [[9,3,3]], and a new performance metric, efficiency, that incorporates both overall rate and fidelity. Since the minimum input fidelity for QEC-based distillation is high, we then extend our study to include non-QEC-based purification protocols, specifically DEJMPS since it outperforms others. We compare the performance of end-to-end DEJMPS against adapting from DEJMPS to QEC once DEJMPS improves the initial fidelity to the threshold for QEC. Through a refined efficiency metric, we illuminate the regime where QEC is beneficial. These results provide a detailed outlook for entanglement purification and distillation in first and second generation quantum repeaters.

arXiv:2504.11670•Apr 15, 2025•1 citation

Adaptive Entanglement Purification Framework for High-Fidelity QISAC Systems

Vikram Singh Thakur, Atul Kumar, Kapal Dev

Quantum integrated sensing and communication (QISAC) requires high-fidelity entanglement for secure communication and quantum-enhanced sensing. However, decoherence, asymmetric noise, and time-varying channel drift degrade the quality of entanglement, thereby limiting system performance. Conventional purification protocols such as BBPSSW and DEJMPS rely on fixed parameters, which can make them inefficient under nonstationary noise. Although DEJMPS outperforms BBPSSW under asymmetric conditions, its fixed rotations remain suboptimal in dynamic environments. To address this, we propose an adaptive DEJMPS framework that adaptively optimizes purification using a classical controller. The controller adjusts rotation parameters and determines a resource-aware stopping point based on real-time fidelity–yield feedback, balancing performance and resource consumption. Simulation results show improved fidelity at moderate-to-high drift levels, with comparable performance in symmetric noise. The enhanced fidelity further improves secrecy capacity, quantum Fisher information (QFI), and attack-detection robustness, demonstrating a practical and resource-efficient solution for QISAC systems.

IEEE Transactions on Consumer Electronics•Jan 1, 2026•0 citations

SFTRAP: Satisfying Fidelity Threshold Routing and Adaptive Purification for Throughput Maximum in Quantum Network

Zhi Wang, Tao Gong, Yingpu Nian +6 more

The core function of quantum networks is to establish high-fidelity quantum entanglement for long-distance communication. However, the main challenge is to efficiently allocate resources under limited conditions, maximize throughput, satisfy end-to-end (E2E) fidelity requirements, and prevent quantum decoherence caused by inefficient routing algorithms. Current research focuses on optimizing either throughput or fidelity, with a lack of approaches that optimize both simultaneously; furthermore, existing algorithms suffer from high computational complexity. To tackle these challenges, this study proposes a Satisfying Fidelity Threshold Routing and Adaptive Purification Strategy (SFTRAP). SFTRAP maximizes throughput for each request by selecting multiple paths and dynamically choosing links for entanglement purification based on the current state of link resources, thus minimizing throughput loss while satisfying fidelity threshold. The strategy also adaptively adjusts the number of purification rounds according to the fidelity threshold, thereby optimizing the time required for deep purification and enhancing algorithmic efficiency. For multi-request scenarios, SFTRAP employs a priority sorting mechanism that takes into account both path cost and path freedom, which refines request scheduling and path selection to create more efficient request combinations, thus further boosting the overall network throughput. Simulation results indicate that SFTRAP surpasses state-of-the-art methods in terms of both throughput and algorithmic efficiency, highlighting its potential for optimizing resources in quantum networks.

IEEE Transactions on Communications•Jan 1, 2026•17 citations

Purification Strategy Optimization for Entanglement Routing in Quantum Networks

Javier Vecino Peñas, Ana Fernández Vilas, Rebeca P. Díaz Redondo +2 more

Quantum networks rely on the efficient distribution of entanglement to enable long-distance quantum communication and information processing. A key challenge in these networks is the design of routing protocols capable of maintaining high quality entanglement in the presence of noise, decoherence, and imperfect operations, which progressively degrade the fidelity of entangled states through entanglement swapping. Entanglement purification provides an effective mechanism to mitigate this degradation at the cost of additional resources. In this work, we study purification-aware quantum routing and formulate the problem of selecting optimal purification strategies as an optimization task. By employing dynamic programming techniques, we identify strategies that optimally balance resource consumption and end-to-end fidelity, demonstrating the effectiveness of our approach across different scenarios.

arXiv:2605.23331•IEEE International Conference on Quantum Control, Computing and Learning (qCCL)•Jun 1, 2026•1 citation

Entanglement distillation in color center quantum networks: evaluating algorithmic thresholds

Alessio Belshi

Achieving high-fidelity state distribution across quantum networks requires mitigating the effects of local hardware imperfections. While purification methods such as entanglement distillation provide a pathway toward higher-fidelity entangled states, they also introduce additional processing latency, exposing stored qubits to memory dephasing. In this work, we present a quantitative framework to model the performance of different distillation sequences under realistic color-center hardware constraints. Our results reveal a hardware-dependent latency floor, beyond which the accumulated errors associated with memory storage and local processing offset the fidelity gains provided by additional purification. This allows us to identify the parameter regimes in which multi-round distillation improves the network performance and those in which its overhead becomes detrimental. Using an optimistic near-term combination of state-of-the-art hardware parameters, we predict Bell-state fidelities above 95% and GHZ-state fidelities exceeding 90%, while maintaining an operational generation rate of approximately 1 Hz. These results indicate that entanglement distillation can already provide high-quality distributed resources in a regime relevant to quantum communication and distributed sensing. Finally, we investigate a more ambitious long-term hardware scenario and identify the combination of memory, gate, readout and spin-photon interface parameters required to achieve Bell and GHZ fidelities of 99.9% and 99.0%, respectively, while maintaining generation rates above 1 Hz. These results outline a possible hardware route toward the high-fidelity network resources required by future fault-tolerant quantum-network architectures, rather than constituting a demonstration of fault-tolerant operation itself.

•Oct 29, 2026•0 citations

Concurrent Entanglement Purification Scheduling in Dynamic Quantum Networks

Gongyu Ni, Lester Ho

Quantum networks must deliver end-to-end entanglement whose fidelity meets application requirements, which typically requires entanglement purification along multi-hop paths. Existing scheduling approaches either purify at the link level or optimize end-to-end fidelity for a static set of requests, and do not capture concurrent requests competing for network resources over time. This paper studies concurrent entanglement purification scheduling in a time-slotted quantum network with heterogeneous links, in which requests compete for link capacity and quantum memories, and each request may be served by multiple parallel paths for increased reliability. We formulate a mixed-integer linear programming (MILP) scheduler that maximizes the number of scheduled requests, with max-min path allocation as a fairness criterion, and develop reinforcement learning (RL) schedulers based on DQN, PPO, and SAC, whose rewards balance request success against Bell-pair consumption. Simulations under varying network load, topologies and target fidelity thresholds show that the RL schedulers achieve the highest success rates, improving on MILP by up to 6% and on Progressive Filling and Greedy heuristics by 16.5% and 19.5% respectively, at the cost of higher Bell pair consumption and the deferral of a small fraction of requests. MILP, in contrast, achieves the highest fairness and the lowest Bell pair consumption in most scenarios.

quant-pharXiv:2610.26900•Oct 20, 2026•0 citations
Efficient entanglement distribution is the cornerstone of the Quantum Internet. However, physical link parameters such as photon loss, memory coherence time, and gate error rates fluctuate dynamically, rendering static purification strategies suboptimal. In this paper, we propose an Adaptive Purification Controller (APC) that autonomously optimizes the entanglement distillation sequence to maximize the "goodput," the rate of delivered pairs meeting a strict fidelity threshold. By treating protocol selection as a resource allocation problem, the APC dynamically switches between purification depths and protocol families (e.g., BBPSSW vs. DEJMPS) to navigate the trade-off between generation rate and state quality. Using a dynamic programming planner with Pareto pruning, simulation results demonstrate that our approach eliminates the "fidelity cliffs" inherent in static protocols and prevents resource wastage in high-noise regimes. Furthermore, we extend the controller to heterogeneous scenarios, demonstrating robustness for both multipartite GHZ state generation and continuous variable systems using effective noiseless linear amplification models. We benchmark its computational overhead, confirming real-time feasibility with decision latencies in the millisecond range per link.
Quantum network applications impose a variety of requirements on entanglement resources in terms of rate, fidelity, latency, and more. The repeaters in the quantum network must combine good methods for entanglement generation, effective entanglement distillation, and smart routing protocols to satisfy these application requirements. In this work, we focus on entanglement distillation in a linear chain of quantum repeaters. While conventional approaches reuse the same distillation scheme over multiple hop lengths after entanglement swaps, we propose a novel adaptive quantum error correction (QEC) scheme that boosts end-to-end metrics. Specifically, depending on the network operating point, we adapt the code used in distillation over successive rounds to monotonically increase the rate while also improving fidelity. We demonstrate the effectiveness of this strategy using three codes, with parameters [[9,1,3]], [[9,2,3]], [[9,3,3]], and a new performance metric, efficiency, that incorporates both overall rate and fidelity. Since the minimum input fidelity for QEC-based distillation is high, we then extend our study to include non-QEC-based purification protocols, specifically DEJMPS since it outperforms others. We compare the performance of end-to-end DEJMPS against adapting from DEJMPS to QEC once DEJMPS improves the initial fidelity to the threshold for QEC. Through a refined efficiency metric, we illuminate the regime where QEC is beneficial. These results provide a detailed outlook for entanglement purification and distillation in first and second generation quantum repeaters.
Quantum integrated sensing and communication (QISAC) requires high-fidelity entanglement for secure communication and quantum-enhanced sensing. However, decoherence, asymmetric noise, and time-varying channel drift degrade the quality of entanglement, thereby limiting system performance. Conventional purification protocols such as BBPSSW and DEJMPS rely on fixed parameters, which can make them inefficient under nonstationary noise. Although DEJMPS outperforms BBPSSW under asymmetric conditions, its fixed rotations remain suboptimal in dynamic environments. To address this, we propose an adaptive DEJMPS framework that adaptively optimizes purification using a classical controller. The controller adjusts rotation parameters and determines a resource-aware stopping point based on real-time fidelity–yield feedback, balancing performance and resource consumption. Simulation results show improved fidelity at moderate-to-high drift levels, with comparable performance in symmetric noise. The enhanced fidelity further improves secrecy capacity, quantum Fisher information (QFI), and attack-detection robustness, demonstrating a practical and resource-efficient solution for QISAC systems.
The core function of quantum networks is to establish high-fidelity quantum entanglement for long-distance communication. However, the main challenge is to efficiently allocate resources under limited conditions, maximize throughput, satisfy end-to-end (E2E) fidelity requirements, and prevent quantum decoherence caused by inefficient routing algorithms. Current research focuses on optimizing either throughput or fidelity, with a lack of approaches that optimize both simultaneously; furthermore, existing algorithms suffer from high computational complexity. To tackle these challenges, this study proposes a Satisfying Fidelity Threshold Routing and Adaptive Purification Strategy (SFTRAP). SFTRAP maximizes throughput for each request by selecting multiple paths and dynamically choosing links for entanglement purification based on the current state of link resources, thus minimizing throughput loss while satisfying fidelity threshold. The strategy also adaptively adjusts the number of purification rounds according to the fidelity threshold, thereby optimizing the time required for deep purification and enhancing algorithmic efficiency. For multi-request scenarios, SFTRAP employs a priority sorting mechanism that takes into account both path cost and path freedom, which refines request scheduling and path selection to create more efficient request combinations, thus further boosting the overall network throughput. Simulation results indicate that SFTRAP surpasses state-of-the-art methods in terms of both throughput and algorithmic efficiency, highlighting its potential for optimizing resources in quantum networks.
Quantum networks rely on the efficient distribution of entanglement to enable long-distance quantum communication and information processing. A key challenge in these networks is the design of routing protocols capable of maintaining high quality entanglement in the presence of noise, decoherence, and imperfect operations, which progressively degrade the fidelity of entangled states through entanglement swapping. Entanglement purification provides an effective mechanism to mitigate this degradation at the cost of additional resources. In this work, we study purification-aware quantum routing and formulate the problem of selecting optimal purification strategies as an optimization task. By employing dynamic programming techniques, we identify strategies that optimally balance resource consumption and end-to-end fidelity, demonstrating the effectiveness of our approach across different scenarios.
Achieving high-fidelity state distribution across quantum networks requires mitigating the effects of local hardware imperfections. While purification methods such as entanglement distillation provide a pathway toward higher-fidelity entangled states, they also introduce additional processing latency, exposing stored qubits to memory dephasing. In this work, we present a quantitative framework to model the performance of different distillation sequences under realistic color-center hardware constraints. Our results reveal a hardware-dependent latency floor, beyond which the accumulated errors associated with memory storage and local processing offset the fidelity gains provided by additional purification. This allows us to identify the parameter regimes in which multi-round distillation improves the network performance and those in which its overhead becomes detrimental. Using an optimistic near-term combination of state-of-the-art hardware parameters, we predict Bell-state fidelities above 95% and GHZ-state fidelities exceeding 90%, while maintaining an operational generation rate of approximately 1 Hz. These results indicate that entanglement distillation can already provide high-quality distributed resources in a regime relevant to quantum communication and distributed sensing. Finally, we investigate a more ambitious long-term hardware scenario and identify the combination of memory, gate, readout and spin-photon interface parameters required to achieve Bell and GHZ fidelities of 99.9% and 99.0%, respectively, while maintaining generation rates above 1 Hz. These results outline a possible hardware route toward the high-fidelity network resources required by future fault-tolerant quantum-network architectures, rather than constituting a demonstration of fault-tolerant operation itself.
Quantum networks must deliver end-to-end entanglement whose fidelity meets application requirements, which typically requires entanglement purification along multi-hop paths. Existing scheduling approaches either purify at the link level or optimize end-to-end fidelity for a static set of requests, and do not capture concurrent requests competing for network resources over time. This paper studies concurrent entanglement purification scheduling in a time-slotted quantum network with heterogeneous links, in which requests compete for link capacity and quantum memories, and each request may be served by multiple parallel paths for increased reliability. We formulate a mixed-integer linear programming (MILP) scheduler that maximizes the number of scheduled requests, with max-min path allocation as a fairness criterion, and develop reinforcement learning (RL) schedulers based on DQN, PPO, and SAC, whose rewards balance request success against Bell-pair consumption. Simulations under varying network load, topologies and target fidelity thresholds show that the RL schedulers achieve the highest success rates, improving on MILP by up to 6% and on Progressive Filling and Greedy heuristics by 16.5% and 19.5% respectively, at the cost of higher Bell pair consumption and the deferral of a small fraction of requests. MILP, in contrast, achieves the highest fairness and the lowest Bell pair consumption in most scenarios.