EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
314. SAT resolution with an Indirect Quantum based approach
Invited abstract in session MB-42: Decomposition methods for Quantum Optimization, stream Quantum Computing Optimization.
Monday, 10:30-12:00Room: 98 (building: 306)
Authors (first author is the speaker)
| 1. | Philippe LACOMME
|
| ISIMA, LIMOS | |
| 2. | Gérard Fleury
|
| LIMOS |
Abstract
In recent years, there has been a significant increase in the adoption of Boolean Satisfiability (SAT) models and algorithms to tackle various challenges in Engineering and Computer Science. This surge can be credited to the notable advancements in SAT algorithms during this period, allowing for the resolution of more complex problem instances across diverse application domains.
We present a highly specific modelization of SAT, with a resolution approach based on Quantum Approximate Optimization Algorithm (QAOA). This particular methodology enables the solution of SAT problems with 96 clauses, currently representing the largest problem sizes solvable using quantum approaches.
Keywords
- Algorithms
Status: accepted
Back to the list of papers