Entanglement Distribution in Quantum Repeater with Purification and Optimized Buffer Time

Abstract

Quantum repeater networks that allow long-distance entanglement distribution will be the backbone of distributed quantum information processing. In this paper we explore entanglement distribution using quantum repeaters with optimized buffer time, equipped with noisy quantum memories and performing imperfect entanglement purification and swapping. We observe that increasing the number of memories on end nodes leads to a higher entanglement distribution rate per memory and higher probability of high-fidelity entanglement distribution, at least for the case with perfect operations. When imperfect operations are considered, however, we make the surprising observation that the per-memory entanglement rate decreases with increasing number of memories. Our results suggest that building quantum repeaters that perform well under realistic conditions requires careful modeling and design that takes into consideration the operations and resources that are finite and imperfect.

6 pages, 4 figures, IEEE INFOCOM'23 NetSciQCom 2023

References in corpus (2)

• The Quantum Internet
• Optimal approach to quantum communication using dynamic programming

Cited by in corpus (6)

• Reducing classical communication costs in multiplexed quantum repeaters using hardware-aware quasi-local policies
• Simulation of fidelity in entanglement-based networks with repeater chains
• Analytical Performance Estimations for Quantum Repeater Network Scenarios
• On noise in swap ASAP repeater chains: exact analytics, distributions and tight approximations
• Cross-Validating Quantum Network Simulators
• Quantum Advantage in Distributed Sensing with Noisy Quantum Networks