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

Ahmad Bennakhi; Gregory T. Byrd; Paul Franzon

doi:10.20944/preprints202409.0452.v1

Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Version 1 : Received: 4 September 2024 / Approved: 5 September 2024 / Online: 5 September 2024 (12:38:58 CEST)

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.

quantum computing; B-SAT; Boolean satisfiability problem; Grover’s Search; electronic design automation (EDA); conjunctive normal form (CNF); closed box testing

Computer Science and Mathematics, Other

Not displayed online.

Please leave your comment to this article below.

Mathematical equations can be typed in either LaTeX formats \\[ ... \\] or $$ ... $$, or MathML format <math> ... </math>. Try the LaTeX or MathML example.

Type equation:

Preview:

Copy equation into message below

Close menu

Please click a symbol to insert it into the message box below:

Please enter the link here:

Optionally, you can enter text that should appear as linked text:

Copy link into message below

Close menu

Please enter or paste the URL to the image here (please only use links to jpg/jpeg, png and gif images):

Copy image into message below

Close menu

Type author name or keywords to filter the list of references in this group (you can add a new citation under Bibliography):

No existing citations in Discussion Group

Wikify editor is a simple editor for wiki-style mark-up. It was written by MDPI for Sciforum in 2014. The rendering of the mark-up is based on Wiky.php with some tweaks. Rendering of mathematical equations is done with MathJax. Please send us a message for support or for reporting bugs.

Close menu

Please declare any conflicts of interest you may have with this paper, financial or otherwise.

I do not have a conflict of interest

I would like to declare a conflict of interest

Display my name on the website

Captcha

Renew

I accept the following conditions:

Comments must follow the standards of professional discourse and should focus on the scientific content of the article. Insulting or offensive language, personal attacks and off-topic remarks will not be permitted. Comments must be written in English. Preprints reserves the right to remove comments without notice. Readers who post comments are obliged to declare any competing interests, financial or otherwise.

* All users must log in before leaving a comment

Notify me about updates to this article or when a peer-reviewed version is published.

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

Abstract

Keywords

Subject

Comments (0)