Curator's Take
This research tackles a critical engineering challenge in building practical quantum networks: how to efficiently manage quantum memories in repeaters when connection distances are unequal. The "mismatch problem" they address is particularly relevant as real-world quantum networks won't have perfectly symmetric topologies, making this asymmetric repeater design essential for practical deployment. By developing dynamic memory allocation strategies, the work provides a pathway to maintain both high entanglement rates and fidelity even when quantum repeaters must handle different link distances to neighboring nodes. This optimization work represents the kind of practical engineering insight needed to move quantum networks from laboratory demonstrations toward real-world quantum internet infrastructure.
— Mark Eatherly
Summary
At the core of the quantum Internet lie quantum repeaters that enable remote end-to-end entanglement generation. Fundamentally, the entanglement generation rate and fidelity of quantum repeaters constitute the bottleneck for end-to-end performance. To achieve high rates, quantum repeaters employ quantum memory multiplexing. In a high-rate standard repeater, each memory sequentially generates an entanglement with its neighboring nodes and then applies entanglement swapping. This, however, results in low fidelity due to decoherence of the first-formed entanglement in the sequential generation process. By allocating different numbers of memories to simultaneously form entanglements with the left and right adjacent nodes, quantum repeaters reduce high waiting times and achieve high fidelity. In such a repeater, a mismatch problem arises due to the difference between the probabilistic number of generated entanglements on both sides. Consequently, some entanglements remain stored until opposite entanglements are available. The mismatch problem reduces the repeater rate and particularly the entanglement fidelity. In this paper, we consider the mismatch problem in an asymmetric repeater with different distances to its adjacent nodes. To mitigate the mismatch problem, we derive a dynamic optimal memory allocation. Under the optimal allocation, we derive statistical lower bounds on the achievable rate and fidelity. We demonstrate that the optimal allocation significantly improves the fidelity while maintaining a comparable rate to the standard repeater. In contrast, our results show that fixed memory allocation may be detrimental to the fidelity.