Solving Computationally Hard Problems Using Quantum Computing

Simple item page
dc.contributor.authorSingh, Angadh
dc.date.accessioned2024-03-17T04:00:10Z
dc.date.available2024-03-17T04:00:10Z
dc.date.issued2024
dc.description.abstractSome problems are computationally solvable but to complexity of nature of problem, they take a long time to solve. Quantum computers (QC) offer the ability to solve these problems in reasonable time using principles of quantum mechanics. One such hard problem is MaxCut, with various applications like portfolio optimization, drug discovery, and inventory management. This poster dives into solving these problems on QC with introduction to how problems are encoded mathematically (QUBO); converted into quantum language (Hamiltonian) and solved using quantum algorithm (QAOA).The goal of research was to run MaxCut problem on different variants of a quantum algorithms to analyze results.
dc.description.reviewstatusReviewed
dc.description.scholarlevelUndergraduate
dc.description.sponsorshipJamie Cassels Undergraduate Research Awards (JCURA)
dc.identifier.urihttps://hdl.handle.net/1828/16201
dc.language.isoen
dc.publisherUniversity of Victoria
dc.subjectquantum computing
dc.subjectQAOA
dc.subjectoptimization
dc.subjectHamiltonian
dc.subjectapplications
dc.titleSolving Computationally Hard Problems Using Quantum Computing
dc.typePoster

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Angadh_Singh-JCURAposter-2024.pdf
Size:
3.05 MB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.62 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Jamie Cassels Undergraduate Research Awards (JCURA)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.