Work

qSAT: Design of an Efficient Quantum Satisfiability Solver for Hardware Equivalence Checking

Year: 2025

Type: article

Abstract: The use of Boolean Satisfiability (SAT) solver for hardware verification incurs exponential runtime in several instances. In this work, we have proposed an efficient quantum SAT (qSAT) solver for equivalence checking of Boolean circuits employing Grover’s algorithm. The Exclusive-Sum-of-Product (ESOP)-based generation of the Conjunctive Normal Form (CNF) equivalent clauses demands less qubits and minimizes the gates and depth of quantum circuit interpretation. The consideration of reference circuits for verification affecting Grover’s iterations and quantum resources are also presented as a case study. Experimental results are presented assessing the benefits of the proposed verification approach using open source Qiskit platform and IBM quantum computer.

Source: ACM Journal on Emerging Technologies in Computing Systems

DOI: 10.1145/3729229

Authors: Abhoy Kole, Mohammed Elkacem Djeridane, Lennart Weingarten, Kamalika Datta, Rolf Drechsler

Institutions: German Research Centre for Artificial Intelligence, University of Bremen

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funder: Bundesministerium für Bildung und Forschung

OpenAlex ID: W4409330059

FWCI: 0.4

Cites: 18

Cited by: 1

Related to: 10