Heuristics for Quantum Computing Dealing with 3-SAT-Reference-Cited by-同舟云学术

Heuristics for Quantum Computing Dealing with 3-SAT

Published:2023-04-16 Issue:8 Volume:11 Page:1888
ISSN:2227-7390
Container-title:Mathematics
language:en
Short-container-title:Mathematics

Author:

Paulet Jose J.¹^ORCID,LLana Luis F.¹^ORCID,Calvo Hernán Indíbil²^ORCID,Mezzini Mauro³^ORCID,Cuartero Fernando²^ORCID,Pelayo Fernando L.²^ORCID

Affiliation:

1. Departamento de Sistemas Informaticos y Computacion, Facultad de Informatica, Complutense University, 28040 Madrid, Spain

2. Departamento de Sistemas Informaticos, Escuela Superior de Ingenieria Informatica, University of Castilla—La Mancha, 02071 Albacete, Spain

3. Dipartimento di Scienze della Formazione, Via del Castro Pretorio 20, UniRoma3, 00185 Rome, Italy

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.

Funder

Spanish MINECO/FEDER project AwESOMe

Region of Madrid project FORTE-CM

European Union and the Qsimov Quantum Computing project ‘Ampliación de la plataforma QSIMOV aumentando su versatilidad y conectividad’

Publisher

MDPI AG

Subject

General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)

Link

https://www.mdpi.com/2227-7390/11/8/1888/pdf

Reference33 articles.

1. Cook, S.A. (1971, January 3–5). The Complexity of Theorem-Proving Procedures. Proceedings of the Third Annual ACM Symposium on Theory of Computing, Shaker Heights, OH, USA.

2. Applications of SAT Solvers to Cryptanalysis of Hash Functions;Mironov;IACR Cryptol. ePrint Arch.,2006

3. Ganai, M., and Wang, C. (2006, January 22–27). SAT-Based Verification Methods and Applications in Hardware Verification. Proceedings of the 6th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, SFM 2006, Bertinoro, Italy.

4. Kautz, H., and Selman, B. (1992, January 3–7). Planning as Satisfiability. Proceedings of the 10th European Conference on Artificial Intelligence, Vienna, Austria.

5. Lin, P.C., and Khatri, S. (2011, January 4–6). Efficient cancer therapy using Boolean networks and Max-SAT-based ATPG. Proceedings of the International Workshop on Genomic Signal Processing and Statistics (GENSIPS), San Antonio, TX, USA.