Solving 3SAT and MIS Problems with Analog Quantum Machines - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Solving 3SAT and MIS Problems with Analog Quantum Machines

Résumé

This work considers the use of analog quantum machines to solve the boolean satisfiability problem 3SAT by taking Quadratic Unconstrained Binary Optimization models (QUBO) as input. With the aim of using real quantum computers instead of emulators to solve instances of the problem, we choose the D-Wave quantum machines, which have a static topology and limited connectivity. Therefore, the choice of the problem formulation must take these important constraints into account. For this reason, we propose to solve 3SAT instances through polynomial-time reduction to the Maximum Independent Set problem. This is because the resulting graph is less dense and requires lower con- nectivity than the one that would be produced by directly modeling 3SAT into a QUBO.
Fichier principal
Vignette du fichier
3SAT.Proof.LNCS.546341_1_En_29_Chapter_Author.pdf (1.78 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04172858 , version 1 (10-06-2024)

Identifiants

Citer

Samuel Deleplanque. Solving 3SAT and MIS Problems with Analog Quantum Machines. 23rd International Conference on Computational Science and Its Applications, ICCSA 2023 Workshops, Jul 2023, Athens, Greece. pp.429-439, ⟨10.1007/978-3-031-37105-9_29⟩. ⟨hal-04172858⟩
33 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More