Solving the B-SAT Problem Using Quantum Computing: Smaller is Sometimes Better

EasyChair Preprint 14507

Abstract

This paper examines the effectiveness of modern universal gate quantum computers in solving the Boolean Satisfiability (B-SAT) problem using Grover’s Search algorithm. Experiments were conducted with varying configurations, including the number of shots, qubit mapping, and different quantum processors, to assess their impact on the results. The study also includes an experiment that highlights a unique behavior observed in IBM quantum processors when running circuits with a specific number of shots.

Keyphrases: B-SAT, Boolean Satisfiability Problem, Grover’s Search, closed box testing, conjunctive normal form (CNF), electronic design automation(EDA), quantum computing

@booklet{EasyChair:14507,
  author    = {Ahmad Bennakhi and Greg Byrd and Paul Franzon},
  title     = {Solving the B-SAT Problem Using Quantum Computing: Smaller is Sometimes Better},
  howpublished = {EasyChair Preprint 14507},
  year      = {EasyChair, 2024}}