In quantum networks, nodes are connected via sharing of Einstein-Podolsky-Rosen (EPR) pairs, ideally with high fidelity and high rate. However, the fidelity of EPR pairs degrades due to imperfect generation and decoherence errors. Entanglement Distillation is a method that increases the fidelity but operates probabilistically and may destroy all involved EPR pairs upon failure. This failure reduces available EPR pairs for application use, thereby decreasing the service rate. Quantum Error Correction (QEC) is another mechanism to protect EPR pairs against error by forming what we term as Coding-Enhanced Memory (CEM). While effective, CEM requires extra time and resources to form the code, which also reduces the service rate. Existing methods often use static combinations of distillation and CEM, ignoring demand variations. This results in a low service rate without significant fidelity gain. Limited resources together with this rate-fidelity tradeoff make it essential to schedule when to run distillation, form CEM, or serve requests.
We propose ReFINE, a demand-aware preemptive scheduler that based on application requirements either serves an available EPR pair immediately or preserves it in CEM. This selective use of CEM, only when needed, enables a better balance for rate-fidelity tradeoff than always using CEM. Between request arrivals, ReFINE either schedules distilling EPR pairs or forming CEM to protect distilled pairs, following one of the three priority policies: ReFINE-D (Distillation-First) first generates EPR pairs for distillation and then forms the CEM, prioritizing service rate. ReFINE-M (Memory-First) first forms the CEM, then generates the EPR pairs for distillation, prioritizing fidelity. ReFINE-C (Concurrent) performs both distillation and CEM formation concurrently, balancing between fidelity and service rate.
AI Summary
ReFINE addresses the rate–fidelity tradeoff in proactive, link-level entanglement distribution: distillation can improve fidelity but consumes pairs and can fail, while error-corrected storage requires preparation time and resources. Requests are served immediately when a pair is available and otherwise rejected. The question is how to schedule distillation, coding-enhanced memory (CEM) preparation, and consumption under different demand rates.
The scheduler permits consumption of available pairs before processing finishes and provides three policies: distillation-first, memory-first, and concurrent preparation. Policy selection uses a known, stable demand class rather than online traffic adaptation. Evaluation uses continuous-time Markov-chain-based simulations with Poisson generation and requests, Werner-state noise, a 2-to-1 bilocal Clifford distillation protocol, and teleportation-based Shor-code memory. Default parameters are initial fidelity $0.8$, generation rate $\lambda=1$, and physical/CEM decoherence rates $0.05$ and $5\times10^{-4}$.
Memory-first performs best in the reported low-demand regime, concurrent scheduling balances rate and fidelity at moderate demand, and distillation-first favors service rate at high demand. Reported improvements close up to $11.21\%$ of the remaining gap to unit fidelity relative to continuous distillation; at moderate demand, concurrent scheduling closes $66.26\%$ of the service-rate gap relative to static distillation-plus-CEM. These are gap reductions, not absolute percentage-point gains.
The scope is principally individual links with stable demand. Other codes and distillation protocols are not evaluated, decoding overhead is excluded, and the receiver is assumed to protect its stored half. Short-chain simulations show benefits diminishing with chain length as accumulated swapping errors dominate.
Some signs of AI-generated textIncrementalOverclaimsStrong assumptionsPossible error
Central claim may not hold: ReFINE's policy selection is evaluated for known, fixed demand classes rather than adaptation to changing demand regimes.
The reported rate–fidelity gains assume an encoded-memory decoherence improvement without deriving it from the stated code's noisy preparation and correction operations.
The headline maximum service-rate gap improvement of 49.48% conflicts with the evaluation's reported 66.26% against the same baseline without an explained distinction.
The stated Bell measurement on two Bell pairs performs entanglement swapping rather than preparing the claimed four-qubit GHZ resource, leaving the physical CEM preparation and its simulated formation cost unsupported.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
In quantum networks, nodes are connected via sharing of Einstein-Podolsky-Rosen (EPR) pairs, ideally with high fidelity and high rate. However, the fidelity of EPR pairs degrades due to imperfect generation and decoherence errors. Entanglement Distillation is a method that increases the fidelity but operates probabilistically and may destroy all involved EPR pairs upon failure. This failure reduces available EPR pairs for application use, thereby decreasing the service rate. Quantum Error Correction (QEC) is another mechanism to protect EPR pairs against error by forming what we term as Coding-Enhanced Memory (CEM). While effective, CEM requires extra time and resources to form the code, which also reduces the service rate. Existing methods often use static combinations of distillation and CEM, ignoring demand variations. This results in a low service rate without significant fidelity gain. Limited resources together with this rate-fidelity tradeoff make it essential to schedule when to run distillation, form CEM, or serve requests.
We propose ReFINE, a demand-aware preemptive scheduler that based on application requirements either serves an available EPR pair immediately or preserves it in CEM. This selective use of CEM, only when needed, enables a better balance for rate-fidelity tradeoff than always using CEM. Between request arrivals, ReFINE either schedules distilling EPR pairs or forming CEM to protect distilled pairs, following one of the three priority policies: ReFINE-D (Distillation-First) first generates EPR pairs for distillation and then forms the CEM, prioritizing service rate. ReFINE-M (Memory-First) first forms the CEM, then generates the EPR pairs for distillation, prioritizing fidelity. ReFINE-C (Concurrent) performs both distillation and CEM formation concurrently, balancing between fidelity and service rate.
ReFINE addresses the rate–fidelity tradeoff in proactive, link-level entanglement distribution: distillation can improve fidelity but consumes pairs and can fail, while error-corrected storage requires preparation time and resources. Requests are served immediately when a pair is available and otherwise rejected. The question is how to schedule distillation, coding-enhanced memory (CEM) preparation, and consumption under different demand rates.
The scheduler permits consumption of available pairs before processing finishes and provides three policies: distillation-first, memory-first, and concurrent preparation. Policy selection uses a known, stable demand class rather than online traffic adaptation. Evaluation uses continuous-time Markov-chain-based simulations with Poisson generation and requests, Werner-state noise, a 2-to-1 bilocal Clifford distillation protocol, and teleportation-based Shor-code memory. Default parameters are initial fidelity 0.8, generation rate λ=1, and physical/CEM decoherence rates 0.05 and 5×10−4.
Memory-first performs best in the reported low-demand regime, concurrent scheduling balances rate and fidelity at moderate demand, and distillation-first favors service rate at high demand. Reported improvements close up to 11.21% of the remaining gap to unit fidelity relative to continuous distillation; at moderate demand, concurrent scheduling closes 66.26% of the service-rate gap relative to static distillation-plus-CEM. These are gap reductions, not absolute percentage-point gains.
The scope is principally individual links with stable demand. Other codes and distillation protocols are not evaluated, decoding overhead is excluded, and the receiver is assumed to protect its stored half. Short-chain simulations show benefits diminishing with chain length as accumulated swapping errors dominate.
Quantum communications rely on quantum tele-portation, which requires high-fidelity entangled pairs between remote nodes. In realistic conditions, however, noise affects both the quantum states to be transmitted and entangled pairs used for teleportation, reducing overall communication reliability. This work proposes an adaptive framework for quantum error correction that selects the most suitable quantum code based on parameters estimated from the entanglement distillation process. By analyzing the fidelity and asymmetry of noisy channel induced by imperfect Einstein-Podolsky-Rosen (EPR) pairs, the scheme identifies how to adapt the quantum code for transmission. The proposed method can either reduce the number of required EPR pairs without compromising performance or enhance performance without increasing resource requirements.
The quantum Internet envisions a network where information is transmitted through entanglement, with Einstein-Podolsky-Rosen (EPR) pairs serving as one of the fundamental carriers. In this work, we propose a framework for dimensioning quantum memories capable of storing distilled EPR pairs useful to transmitting and manage quantum error correcting codes. Using a Markov chain model, we capture the stochastic evolution of stored entangled states in quantum memories, linking memory performance to system parameters such as technology characteristics and initial entanglement fidelity. Building on this framework, we provide analytical tools and design principles for optimizing memory architectures that preserve high-fidelity entanglement over time, ensuring the availability of encoded quantum resources necessary for several operations in future quantum Internet infrastructures transmitting EPR packets.
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.
Distributed quantum computing can potentially address the scalability challenge by networking processors through photon-mediated remote entanglement. Prior approaches assumed that remote Bell pairs require distillation before use, incurring substantial overhead, to achieve sufficiently high fidelity. However, recent results show that lattice-surgery operations at logical qubit boundaries tolerate significantly higher error rates than previously assumed. We quantify the resource trade-offs between distillation overhead and surface-code distance requirements under realistic constraints including probabilistic entanglement generation and memory decoherence. We identify the fidelity crossover point separating the two regimes. Below this threshold, the distillation strategy dominates, reducing resource overhead by up to two orders of magnitude. Above it, no-distillation becomes the more efficient choice, reducing resource overhead by more than half. We briefly describe the application of these methods to ion-trap and neutral-atom platforms. These results provide joint design guidelines for optimizing photonic interconnects and fault-tolerant architectures in distributed quantum computing.
The quantum switch is a vital component for the development of the quantum internet. In an entanglement distribution network, the function of a quantum switch is to generate elementary entanglement with its clients followed by entanglement swapping to distribute end-to-end entanglement of sufficiently high fidelity between clients. The threshold on entanglement fidelity is any quality of service requirement specified by the clients as dictated by the application they run on the network. We consider a discrete time model for a quantum switch that attempts generation of fresh elementary entanglement with clients in each time step in the form of maximally entangled qubit pairs, or Bell pairs, which succeed probabilistically; the successfully generated Bell pairs are stored in noisy quantum memories until they can be swapped. We focus on establishing the value of entanglement distillation of the stored Bell pairs prior to entanglement swapping in presence of their inevitable aging, i.e., decoherence: For a simple instance of a switch with two clients, an exponential decay of entanglement fidelity, and a wellknown probabilistic but heralded two-to-one distillation protocol, given a threshold end-to-end entanglement fidelity, we use the Markov Decision Processes framework to identify the optimal action policy - to wait, to distill, or to swap that maximizes throughput. We compare the switch's performance under the optimal distillation-enabled policy with that excluding distillation. Simulations of the two policies demonstrate the improvements that are possible in principle via optimal use of distillation with respect to average throughput, average fidelity and jitter of end-to-end entanglement, as functions of fidelity threshold. Our model thus helps capture the role of entanglement distillation in mitigating the effects of decoherence in a quantum switch in an entanglement distribution network, adding to the growing literature on quantum switches.
Quantum datacenter (QDC) architectures must support communication among quantum processing units (QPUs) under limited communication qubits, optical switching and measurement resources, probabilistic entanglement generation, and physical-layer noise. This paper presents Q-REFINE, a framework for Quantum Resource Exploration via Factorial & Iterative N-factor Experiments. Its measure is the completion rate, the rate at which requests are served with at least a threshold fidelity. For a given QDC topology, Q-REFINE asks which physical-layer factors and their combinations change this rate most, and over what range improving each factor still pays off. Q-REFINE combines a discrete event simulator, controllable inter-QPU request workloads, topology instances with explicit switches and measurement units, and a design of experiments (DOE). We apply it to Fat-tree, Clos, QFly, BCube and DCell. Load selection fixes, with every factor at its best level, the smallest concurrency limit whose completion rate is within 5% of the best while at most 5% of requests go unserved. At that limit, a full-factorial DOE finds which factor combinations serve any request and how much each factor raises the rate, and one-factor-at-a-time sweeps show over what range each improvement pays off. Emitted-pair fidelity, Hong–Ou–Mandel visibility and memory coherence time jointly decide whether any request is served. The emission efficiency raises the rate most, 8.4–9.5 times between its two DOE levels, and a higher attempt rate pays off only with a short communication-qubit cooldown time. Although we use a particular workload, performance metric, and configurations, the framework applies to any workload, metric(s), or configurations.