Executive Summary : | The exponential growth in tele-traffic in the fifth generation (5G) and beyond has made network management a key issue. Timely resource allocation across the network system is becoming a challenge due to stringent latency requirements. Real-time applications like 4K/16K video streaming, drone swarms in disaster monitoring, and high-speed Internet in crowded areas are some scenarios where fast computations for network resource planning in the backbone of the network are a serious bottleneck. Addition of expensive servers may be one way to solve this issue, but it may not be cost-effective due to computational time gain. Quantum computation is a next leap forward in the computational arena, with faster computation compared to classical counterparts. The Indian government has focused on quantum system development due to its phenomenal computational potential. Quantum algorithms can be used in various real-world applications. To address this problem, two sub-problems have been categorized: mapping resource computation into a structural Laplace system, where graph signal processing (GSP) can be applied, and proposing a much faster computation of resources on a Quantum computer exploiting this Laplace structure of the network. This work aims to map a network resource problem to a Quantum Graph problem, leveraging the time efficiency of quantum computation in a large network resource allocation problem. The efficient Quantum architecture and subsequent simulation can be well designed. |