Pre-established Entanglement Distribution with Time-Guaranteed Memory Cells Selection in Quantum Networks

Abstract

Quantum entanglement enables numerous quantum applications such as secure communication. Based on entanglement-based quantum networks, long-distance entanglement establishment between two distant end nodes is vital to realize practical quantum networks. However, due to the decoherence and imperfect quantum operations such as the non-determinism of entanglement swapping, the latency of remote entanglement distribution will be increased, simultaneously, ongoing quantum operations will be cut off caused by the short coherence time of quantum memory. In this article, we propose a pre-established entanglement distribution algorithm which contains a time-guaranteed memory cells selection algorithm, aiming to choose the maximum time-matching entangled particle in each node to establish end-to-end entanglement. Simulation results show that for the different scales of grid network topologies, all success probability values are increasing with increase the size of the memory cells and the size of the time slots. Considering constructing the large scale of quantum network, it's necessary to consider employing high multi-mode capability and long lifetime quantum memory.