Quantum Computing for solving the 3SAT problem by reduction to the MIS combinatorial optimization problem - Institut d'électronique, de microélectronique et de nanotechnologie Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Quantum Computing for solving the 3SAT problem by reduction to the MIS combinatorial optimization problem

Résumé

This work tries to anticipate the main issues related to the D-Wave machines topology for solving the 3Sat problem. The polynomial reduction to the Maximum Independent Set Problem (MIS) is employed for solving a 3Sat instance to furnish a less dense graph to the machine. These analog quantum machines, based on the quantum annealing process, takes a Quadratic Unconstrained Binary Optimization model (QUBO) as input, which is a specific mathematical program easy to build considering the MIS.
Fichier principal
Vignette du fichier
EUME_JE.SamPaper.pdf (331.7 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04037331 , version 1 (20-03-2023)

Identifiants

  • HAL Id : hal-04037331 , version 1

Citer

Samuel Deleplanque. Quantum Computing for solving the 3SAT problem by reduction to the MIS combinatorial optimization problem. Emerging optimization methods: from metaheuristics to quantum approaches, Apr 2023, Troyes, France. ⟨hal-04037331⟩
36 Consultations
102 Téléchargements

Partager

Gmail Facebook X LinkedIn More