Distributed Routing in a Quantum Internet

The aim of Quantum Internet is to enable the transmission of qubits between distant quantum devices, in order to achieve tasks that are impossible using classical information. Due to the losses in communication channel, routers are necessary for long distance quantum communication. In such a network, two distant parties share entanglement using the repeaters and transmit qubits using teleportation. However, due to the technological limitation, establishing long distance entanglement takes time and it increases waiting time. This raises the question whether an advantage can be achieved by distributing entanglement ahead of time. In this article we study distribution of entanglement in advance in a network vs producing it on demand. Here we model this problem as a distributed routing in an undirected simple graph. The nodes and edges in the graph denote the routers and communication links. To share an entangled state, two nodes first find a path in the graph and then use the pre-shared entanglement to perform entanglement swapping along that path. To find a path in the graph we use greedy location based routing algorithms. We have done a comparative study of the waiting time for all of the models.