Solving Computationally Hard Problems Using Quantum Computing

Date

2024

Authors

Singh, Angadh

Journal Title

Journal ISSN

Volume Title

Publisher

University of Victoria

Abstract

Some 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.

Description

Keywords

quantum computing, QAOA, optimization, Hamiltonian, applications

Citation