Distributed quantum-classical hybrid algorithm for solving K-SAT problem
Quantum Physics
2026-04-16 v1
Abstract
Recently, Dunjko et al.(PRL, 2018) proposed an algorithm for accelerating the solution of 3-satisfiability problems using a small-scale quantum computer. In this paper, we design a distributed quantum-classical hybrid algorithm for solving K-satisfiability problems. Under resource-constrained conditions, our algorithm achieves a significant acceleration in the core term of the exponential time complexity. The proposed algorithm is a generalization of the algorithm by Dunjko et al. Compared with their algorithm, our algorithm requires a smaller number of qubits. More importantly, the proposed algorithm does not rely on any quantum communication.
Cite
@article{arxiv.2604.14057,
title = {Distributed quantum-classical hybrid algorithm for solving K-SAT problem},
author = {Huaijing Huang and Daowen Qiu and Le Luo and Paulo Mateus},
journal= {arXiv preprint arXiv:2604.14057},
year = {2026}
}
Comments
A PREPRINT