Home > Publications database > Comparing different formulations to solve the Traveling Salesman Problem on a Quantum Computer > print |
001 | 1038364 | ||
005 | 20250207215605.0 | ||
024 | 7 | _ | |a 10.34734/FZJ-2025-01361 |2 datacite_doi |
037 | _ | _ | |a FZJ-2025-01361 |
041 | _ | _ | |a English |
100 | 1 | _ | |a Tsakalias, Nikolaos |0 P:(DE-HGF)0 |b 0 |e Corresponding author |
245 | _ | _ | |a Comparing different formulations to solve the Traveling Salesman Problem on a Quantum Computer |f - 2023-10-08 |
260 | _ | _ | |c 2023 |
300 | _ | _ | |a 42 |
336 | 7 | _ | |a bachelorThesis |2 DRIVER |
336 | 7 | _ | |a Thesis |0 2 |2 EndNote |
336 | 7 | _ | |a Output Types/Supervised Student Publication |2 DataCite |
336 | 7 | _ | |a Bachelor Thesis |b bachelor |m bachelor |0 PUB:(DE-HGF)2 |s 1738912695_13000 |2 PUB:(DE-HGF) |
336 | 7 | _ | |a MASTERSTHESIS |2 BibTeX |
336 | 7 | _ | |a SUPERVISED_STUDENT_PUBLICATION |2 ORCID |
502 | _ | _ | |a Bachelorarbeit, Rheinisch-Westfälische Technische Hochschule Aachen, 2023 |c Rheinisch-Westfälische Technische Hochschule Aachen |b Bachelorarbeit |d 2023 |
520 | _ | _ | |a 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. |
536 | _ | _ | |a 5111 - Domain-Specific Simulation & Data Life Cycle Labs (SDLs) and Research Groups (POF4-511) |0 G:(DE-HGF)POF4-5111 |c POF4-511 |f POF IV |x 0 |
700 | 1 | _ | |a Willsch, Dennis |0 P:(DE-Juel1)167542 |b 1 |e Reviewer |u fzj |
700 | 1 | _ | |a Montanez-Barrera, Jhon Alejandro |0 P:(DE-Juel1)194305 |b 2 |e Reviewer |
856 | 4 | _ | |u https://juser.fz-juelich.de/record/1038364/files/Bachelor_Tsakalias_Final.pdf |y OpenAccess |
909 | C | O | |o oai:juser.fz-juelich.de:1038364 |p openaire |p open_access |p VDB |p driver |p dnbdelivery |
910 | 1 | _ | |a RWTH Aachen |0 I:(DE-588b)36225-6 |k RWTH |b 0 |6 P:(DE-HGF)0 |
910 | 1 | _ | |a Forschungszentrum Jülich |0 I:(DE-588b)5008462-8 |k FZJ |b 1 |6 P:(DE-Juel1)167542 |
910 | 1 | _ | |a Forschungszentrum Jülich |0 I:(DE-588b)5008462-8 |k FZJ |b 2 |6 P:(DE-Juel1)194305 |
913 | 1 | _ | |a DE-HGF |b Key Technologies |l Engineering Digital Futures – Supercomputing, Data Management and Information Security for Knowledge and Action |1 G:(DE-HGF)POF4-510 |0 G:(DE-HGF)POF4-511 |3 G:(DE-HGF)POF4 |2 G:(DE-HGF)POF4-500 |4 G:(DE-HGF)POF |v Enabling Computational- & Data-Intensive Science and Engineering |9 G:(DE-HGF)POF4-5111 |x 0 |
914 | 1 | _ | |y 2024 |
915 | _ | _ | |a OpenAccess |0 StatID:(DE-HGF)0510 |2 StatID |
920 | _ | _ | |l yes |
920 | 1 | _ | |0 I:(DE-Juel1)JSC-20090406 |k JSC |l Jülich Supercomputing Center |x 0 |
980 | _ | _ | |a bachelor |
980 | _ | _ | |a VDB |
980 | _ | _ | |a UNRESTRICTED |
980 | _ | _ | |a I:(DE-Juel1)JSC-20090406 |
980 | 1 | _ | |a FullTexts |
Library | Collection | CLSMajor | CLSMinor | Language | Author |
---|