TY  - THES
AU  - Tsakalias, Nikolaos
TI  - Comparing different formulations to solve the Traveling Salesman Problem on a Quantum Computer
PB  - Rheinisch-Westfälische Technische Hochschule Aachen
VL  - Bachelorarbeit
M1  - FZJ-2025-01361
SP  - 42
PY  - 2023
N1  - Bachelorarbeit, Rheinisch-Westfälische Technische Hochschule Aachen, 2023
AB  - Quantum Computing is an emerging technology. This means that many of the details of thisfield are still unexplored. For example, when trying to solve a problem on a classical computer,there often exists a well-established, preferable method of doing it. This is often not the casewhen using a quantum computer. This Bachelor’s Thesis will focus on the Traveling SalesmanProblem, a famous optimization problem with a lot of real applications, ranging from efficientpackage delivery to genome map assembly and guiding industrial machines. Different ways ofencoding and solving the problem on a quantum computer will be compared. This is done in hopeof determining whether a preferable encoding exists for the TSP. The result could also shed somelight on the encoding of other optimization problems.
LB  - PUB:(DE-HGF)2
DO  - DOI:10.34734/FZJ-2025-01361
UR  - https://juser.fz-juelich.de/record/1038364
ER  -