Distributed quantum-classical hybrid algorithm for solving K-SAT problem

TL;DR

This paper introduces a distributed quantum-classical hybrid algorithm that accelerates solving K-SAT problems with fewer qubits and no quantum communication, improving upon prior quantum algorithms.

Contribution

It generalizes previous quantum algorithms for K-SAT, reducing qubit requirements and eliminating the need for quantum communication under resource constraints.

Findings

Achieves significant exponential acceleration in solving K-SAT.

Requires fewer qubits than previous algorithms.

Operates without quantum communication.

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.