Solving the Traveling Salesman Problem on the D-Wave Quantum Computer
The traveling salesman problem is a well-known NP-hard problem in combinatorial optimization. This paper shows how to solve it on an Ising Hamiltonian based quantum annealer by casting it as a quadratic unconstrained binary optimization (QUBO) problem. Results of practical experiments are also prese...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Frontiers Media S.A.
2021-11-01
|
| Edice: | Frontiers in Physics |
| Témata: | |
| On-line přístup: | https://www.frontiersin.org/articles/10.3389/fphy.2021.760783/full |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|