Solving the B-SAT Problem Using Quantum Computing: Smaller Is Sometimes Better
Ahmad Bennakhi, Gregory T. Byrd, Paul D. Franzon · Preprints.org · 2024
This paper aims to outline the effectiveness of modern universal gate quantum computers when utilizing different configurations to solve the B-SAT(Boolean Satisfiability) problem. The quantum computing experiments are performed using Grover’s Search algorithm to find a valid solution. The experiments are performed under different variations to demonstrate their effects on the results. Changing the number of shots, qubit mapping, and using a different quantum processor are all among the experimental variables. The study also branches into a dedicated experiment highlighting a peculiar behavior that IBM quantum processors exhibit when running circuits with a certain number of shots.