Wireless packet scheduling with Quantum Computing

We present the quantum formulation of wireless packet scheduling algorithm to support QoS (quality of services) in fading channel. We show that existing scheduling algorithm with classical computer can be extended to support the quantum device as well. With support of quantum search algorithm (Grover’s algorithm), we expect to reduce great amount of calculation time for wireless packet scheduling algorithm by factor of square root. We show that how Quantum search algorithm can be used to implement the wireless packet scheduler. In addition, we investigate the possible applicable schemes and benefits of the quantum formulated wireless packet scheduling algorithm for different systems (broadcast, unicast, and multicast) and propose the model which could be beneficial to support the future wireless network.

  We focus on the extension and implementation of wireless packet scheduling algorithm for bandwidth management to the quantum computation. For effective bandwidth management, a lot of scheduling algorithms have been developed in classical computer to support different types of QoS (Quality of Service). We perform the case study of how existing classical scheduling algorithm can be migrated to quantum computer and test the applicability and usability of quantum algorithm.