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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Entropy (Basel, Switzerland) Ročník 26; číslo 10; s. 875
Hlavní autori:	Bennakhi, Ahmad, Byrd, Gregory T., Franzon, Paul
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Switzerland MDPI AG 18.10.2024 MDPI
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!