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.
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.
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.
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.
High-fidelity entanglement shared between distant quantum systems is an essential resource for quantum communication and computation. Entanglement distillation addresses this need by converting multiple noisy Bell pairs into fewer higher-fidelity pairs, using only local quantum operations and classical communication. However, this approach typically requires a substantial overhead in the number of qubits. To bypass this hurdle, we propose to leverage the high-dimensional Hilbert space of a single pair of bosonic systems to store a large amount of entanglement, replacing the need for multi-qubit systems. To distill entanglement in such a setup, we devise a new entanglement distillation protocol, tailored for bosonic systems. The protocol converts a highly-entangled noisy state between two bosonic systems into a lower-dimensional but high-fidelity entangled state, using only local bosonic operations. We show that our protocol significantly enhances the fidelity of the entangled state in the presence of naturally occurring loss and dephasing errors. Compared to methods relying on multiple Bell pairs, our scheme offers a more hardware-efficient strategy, providing a practical route toward the realization of entanglement distillation.
Near-term and early fault-tolerant quantum computing architectures are expected to exhibit highly non-uniform error rates. In particular, local operations within a chip can be substantially more reliable than operations connecting different chips or dilution refrigerators. Such inter-module operations can therefore become a dominant bottleneck, even when quantum error correction is applied. Entanglement distillation provides a natural way to trade additional operations and qubits for higher-fidelity entanglement. Standard distillation protocols, however, are usually formulated in an LOCC resource model, in which several noisy Bell pairs are generated initially and all subsequent processing consists only of local operations and classical communication. Here, we consider a generalized model tailored to modular quantum computing hardware, in which the two modules have access to high-fidelity local operations and to repeated uses of the same noisy inter-module entangling operation during the protocol. We develop practical small-scale entanglement distillation protocols designed to minimize both space and time overhead. Remarkably, our main protocol requires only two qubits per module, yet achieves quadratic error suppression of inter-module errors, assuming local operations are much cleaner. Compared with existing small-scale protocols, our space-optimal protocol provides more space- and time-efficient quadratic error suppression and achieves the best performance in our simulations and experiments on noisy links of current superconducting quantum processors. These results suggest that inter-module-gate-assisted entanglement distillation can be a practical primitive for overcoming noisy links in modular quantum computing architectures.
The degradation of entanglement in quantum memories due to decoherence is a critical challenge for scalable quantum networks. We present an entanglement distillation protocol based on the [[4, 2, 2]] quantum error-detecting code, deriving analytical expressions for its output fidelity and yield, and benchmarking it against the BBPSSW protocol. In addition to single-round performance, we further examine the iterative behavior of both protocols through multi-round fidelity and cumulative yield analysis. We then investigate a storage-stage recovery strategy in which the retained logical entangled state is subjected to repeated stabilizer-based syndrome checks without decoding and re-encoding, avoiding the need to regenerate and redistribute entanglement from scratch. Our analysis shows that this strategy can extend the usable storage lifetime beyond the BBPSSW baseline when the classical communication latency is sufficiently small. We derive latency thresholds and quantify the cumulative acceptance probabilities for different numbers of syndrome checks. A sensitivity analysis further shows that local gate and measurement errors reduce the fidelity advantage region and the admissible communication latency window, highlighting the importance of sufficiently accurate local operations. These results provide a quantitative framework for assessing the storage-stage benefit of logical state retention in the presence of finite communication latency and nonideal local operations.
Recent constructions of quantum low-density parity-check (QLDPC) codes provide optimal scaling of the number of logical qubits and the minimum distance in terms of the code length, thereby opening the door to fault-tolerant quantum systems with minimal resource overhead. However, the hardware path from nearest-neighbor-connection-based topological codes to long-range-interaction-demanding QLDPC codes is likely a challenging one. Given the practical difficulty in building a monolithic architecture for quantum systems, such as computers, based on optimal QLDPC codes, it is worth considering a distributed implementation of such codes over a network of interconnected medium-sized quantum processors. In such a setting, all syndrome measurements and logical operations must be performed through the use of high-fidelity shared entangled states between the processing nodes. Since probabilistic many-to-1 distillation schemes for purifying entanglement are inefficient, we investigate quantum error correction based entanglement purification in this work. Specifically, we employ QLDPC codes to distill GHZ states, as the resulting high-fidelity logical GHZ states can interact directly with the code used to perform distributed quantum computing (DQC), e.g. for fault-tolerant Steane syndrome extraction. This protocol is applicable beyond the application of DQC since entanglement distribution and purification is a quintessential task of any quantum network. We use the min-sum algorithm (MSA) based iterative decoder with a sequential schedule for distilling 3 -qubit GHZ states using a rate 0.118 family of lifted product QLDPC codes and obtain an input fidelity threshold of ≈0.7974 under i.i.d. single-qubit depolarizing noise. This represents the best threshold for a yield of 0.118 for any GHZ purification protocol. Our results apply to larger size GHZ states as well, where we extend our technical result about a measurement property of 3 -qubit GHZ states to construct a scalable GHZ purification protocol.