Back to results

Institutional Repository of Vilnius University

Hamiltono ciklo ieškojimas kvantiniais skaičiavimais /

Abstract

dc:description

The Hamiltonian cycle search problem is one of the most well-known problems in graph theory, and is relevant in many areas such as computer graphics, network routing, and many others. The Hamiltonian cycle problem belongs to the class of NP-complete problems, so that in the general case the solution of the problem is long and difficult. Quantum computing offers a faster solution. In this paper, we present several methods for solving the HCP by means of the quantum Grover search algorithm. The algorithms are implemented in the Python programming environment and tested in a quantum simulator with simple graphs. Results and comparisons are presented.

Degree

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

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Girdzijauskas, Henrikas Antanas,

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

Girdzijauskas, Henrikas Antanas,. Hamiltono ciklo ieškojimas kvantiniais skaičiavimais /. Institutional Repository of Vilnius University, 2022. https://repository.vu.lt/VU:ELABAETD146236942&prefLang=en_US