Abstract
Energy-efficient routing in wireless sensor networks has attracted attention from researchers in both academia and industry, most recently motivated by the opportunity to use software-defined network-inspired approaches. These problems are NP-hard, with algorithms needing computation time that scales faster than polynomials in the problem size. Consequently, heuristic algorithms are used in practice, which are unable to guarantee optimally. In this article, we show proof-of-principle for the use of a quantum annealing processor instead of a classical processor, to find optimal or nearly optimal solutions very quickly. Our preliminary results for small networks show that this approach using quantum computing has great promise and may open the door for other significant improvements in the efficacy of network algorithms.
Original language | English |
---|---|
Article number | 3102912 |
Journal | IEEE Transactions on Quantum Engineering |
Volume | 3 |
DOIs | |
State | Published - 2022 |
Funding
The work of Jie Chen and Nicholas Chancellor was supported by EPSRC Fellowship under Grant EP/S00114X/1.
Keywords
- Next generation networking
- quantum algorithms
- routing protocols
- wireless sensor network