Quantum Algorithm for 3-SAT Problem of 5, and 6 Variables by Shor’s Fourier Transform with Repeat Qubits on QCEngine
Toru Fujimura · Global Journal of Pure and Applied Mathematics · 2025
A quantum algorithm for the 3-SAT problem of 5, and 6 variables by the Shor's Fourier transform with the repeat qubits on the QCEngine, and its example are reported.When there are 3 literals with 2 'OR's in each clause, a number of clauses is, and xn are the variables, and the repeat qubits.],and S(u) is Σr = 1 → m r×Cu,r (x1, x2, x3, … , xn), mod(S(u)max) of S(u) [S(u)max is the maximum value of S(u).] is computed, next, for u, the quantum Fourier transform is done.In this time, there are 5, and 6 variables, and m = 9, and 10, respectively.The complexity of this method is able to be several times.