2021
DOI: 10.48550/arxiv.2106.09056
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Unconstrained Binary Models of the Travelling Salesman Problem Variants for Quantum Optimization

Özlem Salehi,
Adam Glos,
Jarosław Adam Miszczak

Abstract: Quantum computing is offering a novel perspective for solving combinatorial optimization problems. To fully explore the possibilities offered by quantum computers, the problems need to be formulated as unconstrained binary models, taking into account limitation and advantages of quantum devices. In this work, we provide a detailed analysis of the Travelling Salesman Problem with Time Windows (TSPTW) in the context of solving it on a quantum computer. We introduce quadratic unconstrained binary optimization and… Show more

Help me understand this report
View published versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
11
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
5
1

Relationship

3
3

Authors

Journals

citations
Cited by 8 publications
(11 citation statements)
references
References 30 publications
0
11
0
Order By: Relevance
“…Although we have only considered the TSP problem in our numerical experiments, it is worth noting that the proposed schemes can be used with different objective Hamiltonians. Our ancilla-free post-selection through compression scheme can be applied to any problem where the feasible states are one-hot, including the problems defined over permutations such as Vehicle Routing Problem [53], variations of TSP [54,55], Railway Dispatching Problem [56,57], Graph Isomorphism Problem [58], Flight Gate Assignment Problem [59].…”
Section: Discussionmentioning
confidence: 99%
“…Although we have only considered the TSP problem in our numerical experiments, it is worth noting that the proposed schemes can be used with different objective Hamiltonians. Our ancilla-free post-selection through compression scheme can be applied to any problem where the feasible states are one-hot, including the problems defined over permutations such as Vehicle Routing Problem [53], variations of TSP [54,55], Railway Dispatching Problem [56,57], Graph Isomorphism Problem [58], Flight Gate Assignment Problem [59].…”
Section: Discussionmentioning
confidence: 99%
“…To make a stronger statement, the limitations of our model have to be studied further, both analytically (by elaborating e.g., on the more precise determination of α) and empirically by applying the method to many samples. We plan to use it for additional problems of the field of logistics and operations research, similarly to those e.g., in [31,32].…”
Section: Discussionmentioning
confidence: 99%
“…The upper bound should be large enough so that the equality is satisfied when k i=1 a i y i has the lowest possible. Further details can be found in [13].…”
Section: Converting Ilp To Qubomentioning
confidence: 99%