guest ::
| Home > Publications database > Comparing different formulations to solve the Traveling Salesman Problem on a Quantum Computer |
| Home > Publications database > Comparing different formulations to solve the Traveling Salesman Problem on a Quantum Computer |
| Bachelor Thesis | FZJ-2025-01361 |
; ;
2023
This record in other databases:
Please use a persistent id in citations: doi:10.34734/FZJ-2025-01361
Abstract: 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.
|
The record appears in these collections: |
PDF