IEEE International Conference on Advanced Networks and Telecommunications Systems

Analyzing Quantum Network Routing Protocols through Time-Driven Simulations

B. Anvesh, ABS Phaneendra, M. Sai Anuraag, J. Sai Nishith, Anubhav Srivastava, A. Antony Franklin, M. V. Panduranga Rao, K. Dhanush, Devendra Mishra, Nixon Patel

Published Dec 13, 2021• 0 citations

Publisher

Abstract

Quantum routing protocols seek to distribute entanglement across different nodes of a quantum network. A recently popular approach for quantum routing is to cut down the latency times for sharing entanglement by using virtual edges in addition to physical ones. While a physical edge is associated with the presence of a quantum channel, virtual edges correspond to pre-existing entanglement between some nodes which can be leveraged for entanglement swapping. Distributed routing protocols for quantum networks have been proposed and analyzed using this idea. These analyses have also been backed up by simulations. However, to the best of our knowledge, existing simulation approaches consider a static picture, where the demands for entangled pairs are presented upfront. In this paper, we study routing algorithms through time-driven simulations. Such an approach allows for the demands to emerge in real-time as the simulation proceeds, and therefore mimic realistic scenarios better. This also facilitates studying routing protocols in the presence of dynamic replenishment of entangled pairs, and exposes issues like occurrence of deadlocks in the context of limited quantum resources. As a demonstration of the approach, we show simulation results that analyze the performance of various physical and virtual graph topologies in terms of average latency time. Finally, we show the change in performance and network saturation in the presence of replenishment of entanglement resources.

DOI: 10.1109/ants52808.2021.9936958

Related papers

Quantum network routing via link prediction

Antal Száva

A network of devices capable of transmitting quantum information called a quantum network has promising applications with vast benefits. One of the most near term achievable application is the quantum key distribution. It could be used for sharing a secret key between two end-users through any insecure authenticated communication channel. Other than sharing a secret key, a quantum network can be used for connecting quantum computers. Quantum computers have the potential to solve computational problems that their classical counterparts would require significantly more time to do so. By connecting such devices, distributed computation problems such as leader election or distributed consensus between nodes can be solved securely. For such applications to be put into practice on a large scale, there are open practical questions still to be answered. In a quantum network, a data qubit containing quantum information is transmitted by an operation called quantum teleportation. For it, two nodes need to share entanglement. Quantum teleportation then ensures the safe transmission of a qubit by using the shared entanglement and the exchange of two classical bits. This operation, however, consumes entanglement between the nodes, changing the network topology with each served request. In quantum networks, certain nodes share entanglement between each other. Routing in quantum networks entails determining which of these shared entanglements are used to transmit quantum information. As this proves to be a difficult task, we study quantum networks and in particular consider the problem of routing entanglement in quantum networks. The average latency for routing entanglement in a quantum network has been studied so far using a distributed routing approach. Thus, we present numerical simulation results of centralised routing for the average latency of demands in two existing entanglement generation models. In the first, shared entanglement between nodes is created on-demand. In the second, certain nodes pre-share entanglement before the demand comes. Our results show the intuition that using a centralised routing approach in the on-demand model results in drastically more average latency than in the model with pre-shared entanglement. Since some nodes might not be informed about the change in topology, we study the effect of the propagation of information about the network topology to nodes in the network. Our observations based on simulation results show that the average latency is significantly higher if the information about the topology is not propagated well in the network. As propagating information to all nodes in a network would be a significant load for the network, we consider information propagation within a radius and still observe a considerable decrease in average latency. At last, we present a technique called link prediction which can be performed by any node without the need for information propagation and still achieve a considerable decrease in average latency. It can be effectively used to predict the change of topology in a quantum network by using knowledge about the network topology for a certain future point in time and previous knowledge about the network traffic.

Jan 1, 20190 citations

Distributed Routing in a Quantum Internet

Kaushik Chakraborty, Filip Rozpędek, Axel Dahlberg +1 more

We develop new routing algorithms for a quantum network with noisy quantum devices such that each can store a small number of qubits. We thereby consider two models for the operation of such a network. The first is a continuous model, in which entanglement between a subset of the nodes is produced continuously in the background. This can in principle allows the rapid creation of entanglement between more distant nodes using the already pre-generated entanglement pairs in the network. The second is an on-demand model, where entanglement production does not commence before a request is made. Our objective is to find protocols, that minimise the latency of the network to serve a request to create entanglement between two distant nodes in the network. We propose three routing algorithms and analytically show that as expected when there is only a single request in the network, then employing them on the continuous model yields a lower latency than on the on-demand one. We study the performance of the routing algorithms in a ring, grid, and recursively generated network topologies. We also give an analytical upper bound on the number of entanglement swap operations the nodes need to perform for routing entangled links between a source and a destination yielding a lower bound on the end to end fidelity of the shared entangled state. We proceed to study the case of multiple concurrent requests and show that in some of the scenarios the on-demand model can outperform the continuous one. Using numerical simulations on ring and grid networks we also study the behaviour of the latency of all the routing algorithms. We observe that the proposed routing algorithms behave far better than the existing classical greedy routing algorithm. The simulations also help to understand the advantages and disadvantages of different types of continuous models for different types of demands.

arXiv:1907.11630Bulletin of the American Physical SocietyJul 26, 2019101 citations

Short-cuts on quantum network simulators

Anubhav Srivastava, Devendra Mishra, Madhuri Annavazzala +3 more

An important idea in quantum networks is that of employing virtual edges or “short-cuts” between quantum nodes. These edges, which are shared entangled pairs between two nodes that are not directly connected “physically”, are expected to reduce the average latency of entanglement distribution in quantum network routing. In this work, we show how to create such edges on an existing discrete event simulator for quantum networks called SeQUeNCe, and study the impact that these edges have on latency. Additionally, we implement a distributed routing algorithm on the simulator and demonstrate its use in conjunction with the virtual edges. We observe a reduction in latency when short-cuts are used, as is expected. Thus, with these modifications, we believe that SeQUeNCe (and other similar simulators) can be used for experimenting with advanced quantum networking protocols.

IEEE International Conference on Advanced Networks and Telecommunications SystemsDec 13, 20210 citations

Shortcuts to quantum network routing

Eddie Schoute, Laura Mančinska, Tanvirul Islam +2 more

A quantum network promises to enable long distance quantum communication, and assemble small quantum devices into a large quantum computing cluster. Each network node can thereby be seen as a small few qubit quantum computer. Qubits can be sent over direct physical links connecting nearby quantum nodes, or by means of teleportation over pre-established entanglement amongst distant network nodes. Such pre-shared entanglement effectively forms a shortcut - a virtual quantum link - which can be used exactly once. Here, we present an abstraction of a quantum network that allows ideas from computer science to be applied to the problem of routing qubits, and manage entanglement in the network. Specifically, we consider a scenario in which each quantum network node can create EPR pairs with its immediate neighbours over a physical connection, and perform entanglement swapping operations in order to create long distance virtual quantum links. We proceed to discuss the features unique to quantum networks, which call for the development of new routing techniques. As an example, we present two simple hierarchical routing schemes for a quantum network of N nodes for a ring and sphere topology. For these topologies we present efficient routing algorithms requiring O(log N) qubits to be stored at each network node, O(polylog N) time and space to perform routing decisions, and O(log N) timesteps to replenish the virtual quantum links in a model of entanglement generation.

arXiv:1610.05238Oct 17, 201695 citations

Quantum Entanglement Topological Network Routing

Jincheng Zhang

This paper proposes a novel distributed routing protocol for quantum networks leveraging the topological properties of quantum entanglement. The core idea is to construct a network topology based on entangled states between nodes, enabling communication through the instantaneous correlation inherent in entanglement. This approach aims to overcome the limitations of traditional routing protocols, particularly in terms of speed and security. We define a routing algorithm that dynamically adjusts the entanglement states to facilitate data transmission, effectively creating a network with inherently high bandwidth and resilience to eavesdropping. The algorithm is based on a graph theory framework where nodes represent quantum devices and edges represent entangled pairs. The routing process involves identifying the shortest path through the entanglement network, leveraging the correlated states for rapid information transfer. We explore the mathematical underpinnings of this protocol, outlining key formulas for calculating entanglement metrics, path distances, and routing decisions. The theoretical framework presented here provides a foundation for future research and development in quantum network architecture and routing strategies.

Sep 6, 20260 citations

Cost vector analysis & multi-path entanglement routing in quantum networks

Hudson Leone, Miller, Nathaniel R., Deepesh Singh +2 more

We present a static framework for analysing quantum routing protocols that we call the \textit{cost-vector formalism}. Here, quantum networks are recast as multi-graphs where edges represent two-qubit entanglement resources that \textit{could} exist under some sequence of operations. Each edge is weighted with a \textit{transmission probability} that represents the likelihood of the pair existing and a \textit{coherence probability} which is the likelihood that the pair is suitable for teleportation. Routing operations such as entanglement swapping and purification are then interpreted as \textit{contractions on the multi-graph} with relatively simple rules for updating the edge-weights. Moreover, we extend our formalism to include routing scenarios over time by developing a compatible resource theory for quantum memories. We develop rudimentary greedy algorithms for routing in this framework and test them over a variety of toy networking scenarios. Our results indicate that congestion in quantum networks does not improve significantly when more nodes (computers) are added. Rather, we find that congestion is all but eliminated by waiting a small amount of time.

arXiv:2105.00418May 2, 20213 citations