Quantum Optimization for Solving NP-Hard Problems

dc.contributor.advisorJabeen, Shabnab
dc.contributor.authorDayal, Arnav
dc.contributor.authorKalidindi, Raghava
dc.contributor.authorKosuru, Sohan
dc.contributor.authorMoosavi, Miles
dc.date.accessioned2024-12-18T18:23:12Z
dc.date.available2024-12-18T18:23:12Z
dc.date.issued2024
dc.description.abstractThe University of Maryland has a lot of resources that it seeks to ensure every student has easy access to, ranging from facilities like Wi-fi to basic safety measures such as streetlights. Ensuring these resources are properly distributed amongst campus can grow to be expensive considering the University’s 1,339-acre estate. This optimization algorithm aims to minimize the resources necessary to ensure the entirety of any given area is fully encompassed by whatever facility the user desires. Quantum optimization is the ideal way to accomplish this task as classical optimizers are unable to provide as efficient of a solution due to the risk of getting trapped in local minima and the significantly weaker processing ability. The poorer performance of the classical optimizer is demonstrated in our results.
dc.identifierhttps://doi.org/10.13016/jcie-lnwj
dc.identifier.urihttp://hdl.handle.net/1903/33551
dc.language.isoen_US
dc.subjectThe First-Year Innovation & Research Experience (FIRE)
dc.subjectFIRE Quantum Machine Learning (QML)
dc.subjectnp-hard
dc.subjectqubo
dc.subjectadmm
dc.subjectannealing
dc.titleQuantum Optimization for Solving NP-Hard Problems
dc.typeOther

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
2024_TheFIRESummit_Moosavi_Miles.pdf
Size:
981.33 KB
Format:
Adobe Portable Document Format