DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/16768
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBitragunta, Sainath-
dc.date.accessioned2025-01-13T10:10:53Z-
dc.date.available2025-01-13T10:10:53Z-
dc.date.issued2024-07-
dc.identifier.urihttps://ieeexplore.ieee.org/abstract/document/10677246/keywords#keywords-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/16768-
dc.description.abstractWith the development of wireless sensor networks to combat the problem of reaching places otherwise unreachable for humans, there is a need to keep these remote renewable devices charged. Optimizing the network to utilize the minimum amount of energy becomes paramount. With the advent of powerful Quantum Variational Algorithms suited for the current Noisy Intermediate Scale Quantum (NISQ) era of quantum computers, we can exploit the power of these quantum processors to solve classically hard problems. In this paper, we use the Quantum Alternating Operator Ansatz (QAOA) followed by Grover Searching, which amplifies the possible paths to find the optimal path in a multi-hop network. We perform experiments using quantum simulators to obtain useful insights into the algorithm’s performance with respect to various parameters of interest. Our approach involving QAOA and Grover Searching is a useful benchmark for more general and complex optimization problems in remote renewable wireless networks.en_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.subjectEEEen_US
dc.subjectQuantum computing (QC)en_US
dc.subjectQAOAen_US
dc.subjectWireless sensor networks (WSNs)en_US
dc.subjectMulti-hopen_US
dc.subjectQuantum Processing Uniten_US
dc.titleOptimal Path-Finding using Quantum Alternating Operator Ansatz with Grover’s Search for Multi-hop Wireless Sensor Networksen_US
dc.typeArticleen_US
Appears in Collections:Department of Electrical and Electronics Engineering

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.