Warsaw Quantum Computing Group, Episode XL, “Unconstrained Binary Models of the Travelling Salesman Problem Variants for Quantum Optimization”, ‪Özlem Salehi

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.