Back to search

Institutional Repository of Vilnius University

Kombinatorinių problemų sprendimas naudojant QAOA ir IBM Qiskit /

Abstract

dc:description

This thesis explores the application and tuning of the Quantum Approximate Optimization Algorithm (QAOA) for solving combinatorial optimization problems, such as the Traveling Salesman Problem (TSP) and Max-Cut, using IBM Qiskit. The study mainly focuses on the following aspects: evaluating the solution quality obtained by running the QAOA algorithm, analyzing the algorithm's performance with different problem sizes, and the effect of changing algorithm's parameters such as the number of shots, reps, and constraints on variational parameters gamma and beta. By formulating combinatorial problems into the Quadratic Unconstrained Binary Optimization (QUBO) model, the research examines how tuning these parameters can balance computational efficiency and result accuracy. Finally, the findings of these experiments are presented as insights to identify the most effective QAOA parameter configurations, optimizing resource utilization and maximizing solution precision across varying problem scales and within the constraints of quantum computing limitations. The experiments and simulations conducted with the IBM Qiskit Aer simulator provide insights into the practical applicability of QAOA when addressing complex optimization tasks. The experimental results demonstrated how the tuning of various parameters impacts the solution quality and computational efficiency. This work contributes to the field of quantum optimization by offering perspectives on how QAOA can be refined and adapted to solve real-world problems more effectively in the future.

Degree

thesis:*
Grantor dc:publisher
Institutional Repository of Vilnius University
Year dc:date
2025

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Jurgaitis, Jūris,

Rights

dc:rights
Statement dc:rights
  • info:eu-repo/semantics/openAccess
Language dc:language
lit

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Vilnius University
Base URL
epublications.vu.lt/oai
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Jurgaitis, Jūris,. Kombinatorinių problemų sprendimas naudojant QAOA ir IBM Qiskit /. Institutional Repository of Vilnius University, 2025. https://repository.vu.lt/VU:ELABAETD229556624&prefLang=en_US