Entanglement can be used as a resource to support a wide range of quantum applications. However, the scarcity of efficient entanglement distribution protocols poses a significant challenge for the deployment of large-scale quantum networks. Losses in the media prevent the direct transmission of quantum states over large distances, but the use of quantum repeaters presents a possible alternative for long-distance quantum communication. Here, we focus on homogeneous quantum repeater chains and provide some guidelines based on heuristic methods that allow the design of entanglement swapping policies. For instance, delaying simultaneous swaps on adjacent nodes can reduce the probability of losing entanglement. Whereas previous work mainly focused on chains with few nodes only, we present three different policies that are easy to implement and scalable to longer chains. We evaluate these policies using Monte Carlo simulations, comparing their performance to the well-known swap-asap policy. When classical communication time is neglected, our policies provide lower delivery time than swap-asap for probabilistic swaps and large entanglement generation probability. When classical communication time is large, only one of our policies is in most cases faster than swap-asap for both probabilistic and deterministic swaps.

Quantum computers can solve certain problems faster than classical computers, but they require many qubits to solve valuable problems. Distributed quantum computing provides a scalable approach to increasing the number of qubits by interconnecting small-capacity quantum devices, or quantum nodes. Entangled states shared between nodes, so-called entangled links, can serve as a resource for implementing nonlocal operations. A better understanding of distributing links in a network of quantum nodes can guide the design of hardware and protocols for distributed quantum computing systems. We used two metrics to measure the performance of such entanglement distribution protocols considering the network’s objectives. Specifically, the virtual node degree reflects the requirement for many links to perform nonlocal operations, while the virtual neighbourhood size reflects the need for links between remote nodes to increase the number of qubits available for computation. Contrary to most prior research, these metrics explicitly consider the time-dependent fidelity of entangled links. We used discrete-time simulations to investigate the performance of a protocol that continuously distributes entanglement in a quantum network with a regular topology. The number of entangled links in the network evolves as quantum nodes create new links through entanglement generation and entanglement swaps, and remove low-fidelity links. The nodes probabilistically attempt swaps and can maximise the performance metrics by varying this probability.

We found that the performance metrics exhibit qualitatively similar behaviour for various network parameters, such as coherence time and entanglement generation fidelity. However, the network parameters shift the swap attempt probability that maximises the virtual neighbourhood size differently. The effect of network boundaries on performance metrics depends on the network topology.