Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Engineering
Quantum Algorithm For Variant Maximum Satisfiability, Abdirahman Alasow, Peter Jin, Marek Perkowski
Quantum Algorithm For Variant Maximum Satisfiability, Abdirahman Alasow, Peter Jin, Marek Perkowski
Electrical and Computer Engineering Faculty Publications and Presentations
In this paper, we proposed a novel quantum algorithm for the maximum satisfiability problem. Satisfiability (SAT) is to find the set of assignment values of input variables for the given Boolean function that evaluates this function as TRUE or prove that such satisfying values do not exist. For a POS SAT problem, we proposed a novel quantum algorithm for the maximum satisfiability (MAX-SAT), which returns the maximum number of OR terms that are satisfied for the SAT-unsatisfiable function, providing us with information on how far the given Boolean function is from the SAT satisfaction. We used Grover’s algorithm with a …