Palestrante: Dr. Fabrício de Souza Luiz (DFMC-IFGW-Unicamp)
          

                            In this work, we present an innovative approach using Continuous Quantum Walk (CQW) to solve classical graph problems, 
such as the Minimum Spanning Tree (MST). The proposal is based on a mapping of the graph vertices into quantum states and the use of the system's 
transition probabilities to  identify optimal  solutions,  using  a  binary encoding of the states that  allows significantly reducing the use of 
resources.Specifically, the number of qubits required is reduced to log_2(N),  where N is the  number of  vertices in  the  graph. This  resource 
reduction allows the exact application of the algorithm to find the  MST without  degree restriction in high-dimensional graphs, in  addition  to 
providing  a good approximation for the problem with restriction.