With the imminent advent of quantum communications head-on and its landing in what is going to be called the Quantum Internet, it is essential to research different ways of how it could be done in its most efficient way. In this work, we propose a game theory based self-adaptive system that, by accumulating reward, manages to learn how to minimize the latency of packets that are sent in a congested quantum network. To begin with, we study under which circumstances the quantum protocol outperforms its classical equivalent. First, analyzing the minimum number of packets moving through the network as a function of the size of the network necessary for guaranteeing an improvement in the quantum protocol. Then, studying the minimum size of the network based on the number of nodes needed to ensure the aforementioned advantage. Furthermore, taking advantage of the concepts of non-cooperative games and reinforcement learning, a protocol is designed and the behavior of a network with quantum nodes is evaluated. In order to analyze this protocol, different algorithms and scenarios are tested by measuring their efficiency and adaptability.
With the imminent advent of quantum communications head-on and its landing in what is going to be called the Quantum Internet, it is essential to research different ways of how it could be done in its most efficient way. In this work, we propose a game theory based self-adaptive system that, by accumulating reward, manages to learn how to minimize the latency of packets that are sent in a congested quantum network. To begin with, we study under which circumstances the quantum protocol outperforms its classical equivalent. First, analyzing the minimum number of packets moving through the network as a function of the size of the network necessary for guaranteeing an improvement in the quantum protocol. Then, studying the minimum size of the network based on the number of nodes needed to ensure the aforementioned advantage. Furthermore, taking advantage of the concepts of non-cooperative games and reinforcement learning, a protocol is designed and the behavior of a network with quantum nodes is evaluated. In order to analyze this protocol, different algorithms and scenarios are tested by measuring their efficiency and adaptability.
Because of the sustained growth of information and mobile users transmitting a great amount of data packets, modern network performances are being seriously affected by congestion problems. In fact, congestion management is a challenging task that can be roughly summarized as a trade off between transmission latency and cost. In order to contribute to solve the congestion problem on communication networks, a novel framework based on a quantum game model is proposed, where network packets compete selfishly for their fastest route. Simulations show that final network routing and traveling times achieved with the quantum version outperform those obtained with a classical game model with the same options for packet transmission for both. Pareto optimality and Nash equilibrium are studied as well as the influence of simulated and real noise in the quantum protocol. This leads to the opportunity of developing full-stack protocols that may be capable of taking advantage of the quantum properties for optimizing communication systems. Due to its generality, this game approach can be applied both in classical complex networks and in future quantum networks in order to maximize the performance of the quantum internet.
Abstract Because of the sustained growth of information and mobile users transmitting a great amount of data packets, modern network performances are being seriously affected by congestion problems. In fact, congestion management is a challenging task that can be roughly summarized as a trade off between transmission latency and cost. In this context, a novel framework is proposed for solving the congestion problem on communication networks using a quantum game theory model, where network packets compete selfishly for the shortest route. Simulations show that final network routing and traveling times achieved with the quantum game version outperform those obtained classically. This leads to the opportunity of developing full-stack protocols that may be capable of taking advantage of the quantum properties for optimizing communication systems. Due to its generality, the game theoretic approach can be applied both in local networks and in more complex networks such as 5G or LTE-A.
Abstract The innovative dynamics of communication networks are being challenged unprecedentedly by rising data traffic, dynamically evolving topologies, and the increased complexity of distributed intelligent applications. Typically, routing algorithms are inadequate for adjusting in actual time to address network congestion, changes in computational needs and heterogeneity and real-time. In this paper, we propose a new hybrid quantum-augmented routing model that synergistically integrates quantum reinforcement learning with physics-motivated network modeling by reasoning in terms of a space‒time continuum. Here, the phenomenon of network congestion is simulated as a curvature on the fabric of space-time, and the computation facilities on nodes are envisioned as a gravitational source, which directs the flows of data. The most essential innovation is the development of an artificial intelligence awareness layer (AIAL), that functions with quantum-aid learning agents proactively weighing and choosing the routing paths in live environments. The quantum agents query the multiple parallel paths in SQL via quantum superposition and quantum parallelism to enhance convergence and global route optimization. The hybrid structure is built upon features of the local adaptability of quantum-enhanced Q-learning and global contextual knowledge of deep Q-networks (DQNs), which are constantly adjusted to changes in network metrics, such as the load, latency, and availability of nodes. Large simulations demonstrate that this structure has a reward/cost ratio of 138.16, scales well during states of extreme congestion and is structurally efficient in all cases, with higher resiliency and faster convergence of the framework than those of OSPF, the EIGRP, the IS-IS and the RIP. Although this is a positive finding, it is reached under certain simulation conditions and it is not directly applicable in real-life network with diverse topologies and traffic patterns. The findings corroborate that coupling quantum reinforcement learning with physics-inspired routing will make full use of the adaptive optimal routing discoverable in uncertain situations, changing network conditions in an autonomous manner. This study establishes a basis for a new generation of cognitively adaptive, self-optimizing networks to best meet the needs of 6G, edge computing and quantum-aware distributed infrastructures.
The quantum internet is a global system also called the future internet and is considered a complement to the classical packet switching internet, which performs the function of exchanging messages in the network in an innovative way, as it depends on the basic principles of quantum bits. In order to prepare for the quantum internet, its protocols must be configured initially like routing protocols, and because routing in the quantum internet depends mainly on the property of quantum entanglement, it is facing a constant challenge to what the quantum properties impose, Accordingly, studies in this field continue to emerge, as proposals for protocols are renewed. Therefore, in this research, we present a comprehensive study of the recently proposed quantum routing protocols by classifying these protocols into two categories, the first deals with the routing metrics on which the protocol depends, while the other deals with the problem being solved through the routing protocol. It is shown that although many metrics were suggested for routing protocols, the common metric was the throughput (entanglement rate), In addition, it was considered an essential metric in solving most of the routing problems in quantum networks.
Quantum entanglement brings high-speed and inherently privacy-preserving transmission for information communication in quantum networks. The qubit scarcity is an important issue that cannot be ignored in quantum networks due to the limited storage capacity of quantum devices, the short lifespan of qubits, and so on. In this article, we first formulate the qubit competition problem as the Cooperative-Qubit-Allocation-Problem (CQAP) by taking into account both the waiting time and the fidelity of end-to-end entanglement with the given transmission link set. We then model the CQAP as a Markov Decision Process (MDP) and adopt a Reinforcement Learning (RL) algorithm to self-adaptively and cooperatively allocate qubits among quantum repeaters. Further, we introduce an Active Learning (AL) algorithm to improve the efficiency of the RL algorithm by reducing its trial-error times. Simulation results demonstrate that our proposed algorithm outperforms the benchmark algorithms, with 23.5 ms reduction on the average waiting time and 19.2 improvement on the average path maturity degree, respectively.
The quantum internet holds transformative potential for global communication by harnessing the principles of quantum information processing. Despite significant advancements in quantum communication technologies, the efficient distribution of critical resources, such as qubits, remains a persistent and unresolved challenge. Conventional approaches often fall short of achieving optimal resource allocation, underscoring the necessity for more effective solutions. This study proposes a novel reinforcement learning-based adaptive entanglement routing framework designed to enable resource allocation tailored to the specific demands of quantum applications. The introduced QuDQN model utilizes reinforcement learning to optimize the management of quantum networks, allocate resources efficiently, and enhance entanglement routing. The model integrates key considerations, including fidelity requirements, network topology, qubit capacity, and request demands.