HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Master Thesis

Évaluation du potentiel des machines quantiques pour l’optimisation combinatoire

Abstract : Quantum machine provide an opportunity to revolutionizing many fields, especially in combinatorial algorithms. In this internship, we propose to assess the performance of existing (and published) algorithms and clarify the opportunities of quantum algorithms. In a first step, we use a search algorithm on an unstructured database published by Lov Grover (1996) and two other algorithms inspired by the Grover algorithm dealing with the satisfiability problem on a logical formulas and search for elements in an array. The second part present quantum algorithms necessary to do combinatorial optimization, such as the sumation and minimization. Finally, we experimentally solve the problem of vertex cover and traveling salesman problem.
Document type :
Master Thesis
Complete list of metadata

Contributor : Faculté Des Sciences Um Connect in order to contact the contributor
Submitted on : Tuesday, October 19, 2021 - 9:18:01 AM
Last modification on : Wednesday, November 3, 2021 - 7:30:23 AM
Long-term archiving on: : Thursday, January 20, 2022 - 6:17:08 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution - NonCommercial - NoDerivatives 4.0 International License


  • HAL Id : dumas-03384577, version 1



Julien Rodriguez. Évaluation du potentiel des machines quantiques pour l’optimisation combinatoire. Informatique [cs]. 2020. ⟨dumas-03384577⟩



Record views


Files downloads