We invite you to attend (remote-only) Episode XL of the Warsaw Quantum Computing Group meetings! "Unconstrained Binary Models of the Travelling Salesman Problem Variants for Quantum Optimization”
Video recording: https://www.youtube.com/watch?v=lf31NdznYuY
Abstract from Özlem:
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 higher order binary optimization formulations of this problem. We demonstrate the advantages of edge-based and node-based formulations of the TSPTW problem. Additionally, we investigate the experimental realization of the presented methods on a quantum annealing device. The provided results pave the path for utilizing quantum computer for a variety of real-world task which can be cast in the form of Travelling Salesman Problem with Time Windows problem.
Özlem Salehi is a postdoctoral researcher at Institute of Theoretical and Applied Informatics, Polish Academy of Sciences. She obtained her Ph.D. degree in the field of theoretical computer science in 2019. Her research area focuses on quantum optimization and quantum annealing. In particular, she has been recently working on modeling and solving combinatorial optimization problems using quantum annealing and hybrid methods. She is one of the coordinators of QEducation Department under QWorld, a nonprofit organization active in 20 countries and popularizing quantum technologies. She has been organizing quantum programming workshops and developing open-source educational materials to promote quantum computing.
This meeting is organized by the Quantum AI Foundation.