001038364 001__ 1038364
001038364 005__ 20250207215605.0
001038364 0247_ $$2datacite_doi$$a10.34734/FZJ-2025-01361
001038364 037__ $$aFZJ-2025-01361
001038364 041__ $$aEnglish
001038364 1001_ $$0P:(DE-HGF)0$$aTsakalias, Nikolaos$$b0$$eCorresponding author
001038364 245__ $$aComparing different formulations to solve the Traveling Salesman Problem on a Quantum Computer$$f - 2023-10-08
001038364 260__ $$c2023
001038364 300__ $$a42
001038364 3367_ $$2DRIVER$$abachelorThesis
001038364 3367_ $$02$$2EndNote$$aThesis
001038364 3367_ $$2DataCite$$aOutput Types/Supervised Student Publication
001038364 3367_ $$0PUB:(DE-HGF)2$$2PUB:(DE-HGF)$$aBachelor Thesis$$bbachelor$$mbachelor$$s1738912695_13000
001038364 3367_ $$2BibTeX$$aMASTERSTHESIS
001038364 3367_ $$2ORCID$$aSUPERVISED_STUDENT_PUBLICATION
001038364 502__ $$aBachelorarbeit, Rheinisch-Westfälische Technische Hochschule Aachen, 2023$$bBachelorarbeit$$cRheinisch-Westfälische Technische Hochschule Aachen$$d2023
001038364 520__ $$aQuantum 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.
001038364 536__ $$0G:(DE-HGF)POF4-5111$$a5111 - Domain-Specific Simulation & Data Life Cycle Labs (SDLs) and Research Groups (POF4-511)$$cPOF4-511$$fPOF IV$$x0
001038364 7001_ $$0P:(DE-Juel1)167542$$aWillsch, Dennis$$b1$$eReviewer$$ufzj
001038364 7001_ $$0P:(DE-Juel1)194305$$aMontanez-Barrera, Jhon Alejandro$$b2$$eReviewer
001038364 8564_ $$uhttps://juser.fz-juelich.de/record/1038364/files/Bachelor_Tsakalias_Final.pdf$$yOpenAccess
001038364 909CO $$ooai:juser.fz-juelich.de:1038364$$popenaire$$popen_access$$pVDB$$pdriver$$pdnbdelivery
001038364 9101_ $$0I:(DE-588b)36225-6$$6P:(DE-HGF)0$$aRWTH Aachen$$b0$$kRWTH
001038364 9101_ $$0I:(DE-588b)5008462-8$$6P:(DE-Juel1)167542$$aForschungszentrum Jülich$$b1$$kFZJ
001038364 9101_ $$0I:(DE-588b)5008462-8$$6P:(DE-Juel1)194305$$aForschungszentrum Jülich$$b2$$kFZJ
001038364 9131_ $$0G:(DE-HGF)POF4-511$$1G:(DE-HGF)POF4-510$$2G:(DE-HGF)POF4-500$$3G:(DE-HGF)POF4$$4G:(DE-HGF)POF$$9G:(DE-HGF)POF4-5111$$aDE-HGF$$bKey Technologies$$lEngineering Digital Futures – Supercomputing, Data Management and Information Security for Knowledge and Action$$vEnabling Computational- & Data-Intensive Science and Engineering$$x0
001038364 9141_ $$y2024
001038364 915__ $$0StatID:(DE-HGF)0510$$2StatID$$aOpenAccess
001038364 920__ $$lyes
001038364 9201_ $$0I:(DE-Juel1)JSC-20090406$$kJSC$$lJülich Supercomputing Center$$x0
001038364 980__ $$abachelor
001038364 980__ $$aVDB
001038364 980__ $$aUNRESTRICTED
001038364 980__ $$aI:(DE-Juel1)JSC-20090406
001038364 9801_ $$aFullTexts