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

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 were performed using Grover’s search algorithm to find a valid solution. The experime...

Full description

Saved in:

Bibliographic Details
Published in:	Entropy (Basel, Switzerland) Vol. 26; no. 10; p. 875
Main Authors:	Bennakhi, Ahmad, Byrd, Gregory T., Franzon, Paul
Format:	Journal Article
Language:	English
Published:	Switzerland MDPI AG 18.10.2024 MDPI
Subjects:	Algorithms B-SAT Boolean Boolean satisfiability problem Circuits conjunctive normal form (CNF) electronic design automation (EDA) Grover’s search Logic Microprocessors Quantum computers Quantum computing Qubits (quantum computing) Search algorithms Variables Nigeria Ecuador electronic design automation (EDA) Boolean satisfiability problem quantum computing Grover’s search closed-box testing conjunctive normal form (CNF) B-SAT
ISSN:	1099-4300, 1099-4300
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!