Quantum algorithm of a set of quantum 2-sat problem

TL;DR

This paper introduces a quantum adiabatic algorithm for solving quantum 2-satisfiability problems, demonstrating polynomial time complexity and advantages over existing methods.

Contribution

The paper develops a novel quantum adiabatic algorithm for Q2SAT problems, with a specific Hamiltonian construction and numerical analysis of its efficiency.

Findings

Time complexity is approximately O(n^{3.9}) for certain problem sizes.

The algorithm maintains the system in a degenerate ground state subspace.

Advantages over classical and other quantum algorithms are discussed.

Abstract

We present a quantum adiabatic algorithm for a set of quantum 2-satisfiability (Q2SAT) problem, which is a generalization of 2-satisfiability (2SAT) problem. For a Q2SAT problem, we construct the Hamiltonian which is similar to that of a Heisenberg chain. All the solutions of the given Q2SAT problem span the subspace of the degenerate ground states. The Hamiltonian is adiabatically evolved so that the system stays in the degenerate subspace. Our numerical results suggest that the time complexity of our algorithm is $O(n^{3.9})$ for yielding non-trivial solutions for problems with the number of clauses $m=dn(n-1)/2\ (d\lesssim 0.1)$. We discuss the advantages of our algorithm over the known quantum and classical algorithms.