Heuristics for Quantum Computing Dealing with 3-SAT
Loading...
Download
Official URL
Full text at PDC
Publication date
2023
Advisors (or tutors)
Editors
Journal Title
Journal ISSN
Volume Title
Publisher
MDPI
Citations
Exportar
Citation
Paulet, J.J.; LLana, L.F.; Calvo, H.I.; Mezzini, M.; Cuartero, F.; Pelayo, F.L. Heuristics for Quantum Computing Dealing with 3-SAT. Mathematics 2023, 11, 1888. https:// doi.org/10.3390/math11081888
Abstract
The SAT problem is maybe one of the most famous NP-complete problems. This paper deals with the 3-SAT problem. We follow a sort of incremental strategy to save computational costs with respect to the classical quantum computing approach. We present an heuristics that leads this strategy, improving the performance of the purely random incremental scheme. We finally validate our approach by means of a thorough empirical study.