A quantum Approach to Optimum-Path Forest Using the Traveling Salesman Problem

• Grant number: 23/12016-0
• Support Opportunities: Scholarships in Brazil - Scientific Initiation
• Start date: February 01, 2024
• End date: October 31, 2024
• Field of knowledge: Physical Sciences and Mathematics - Computer Science - Theory of Computation
• Principal Investigator: João Paulo Papa
• Grantee: Mariane Ferreira dos Santos
• Host Institution: Faculdade de Ciências (FC). Universidade Estadual Paulista (UNESP). Campus de Bauru. Bauru , SP, Brazil
• Associated research grant: 13/07375-0 - CeMEAI - Center for Mathematical Sciences Applied to Industry, AP.CEPID

Abstract

In this research project, we will explore the application of machine learning methods focused on the implementation of the Optimum-Path Forest (OPF) in the context of quantum computing. We will study how quantum computing tools and methods can be used to solve the Traveling Salesman problem, integrating this solution to the OPF. In particular, we will investigate how the implementation of the Traveling Salesman algorithm using the Quantum Approximate Optimization Algorithm (QAOA) and the Feedback-Based Quantum Optimization (FALQON) can be incorporated into OPF, replacing the Minimum Spanning Tree (MST) algorithm to find prototypes.