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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Entropy (Basel, Switzerland) Jg. 26; H. 10; S. 875
Hauptverfasser:	Bennakhi, Ahmad, Byrd, Gregory T., Franzon, Paul
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Switzerland MDPI AG 18.10.2024 MDPI
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!