qSAT: Design of an Efficient Quantum Satisfiability Solver for Hardware Equivalence Checking
<|reference_start|>qSAT: Design of an Efficient Quantum Satisfiability Solver for Hardware Equivalence Checking: The use of Boolean Satisfiability (SAT) solver for hardware verification incurs exponential run-time 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 based generation of the Conjunctive Normal Form equivalent clauses demand 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.<|reference_end|>
@article{kole2024qsat:,
    title={qSAT: Design of an Efficient Quantum Satisfiability Solver for Hardware
  Equivalence Checking},
    author={Abhoy Kole, Mohammed E. Djeridane, Lennart Weingarten, Kamalika Datta,
  Rolf Drechsler},
    journal={arXiv preprint arXiv:2409.03917},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.03917},
    primaryClass={quant-ph cs.ET}
}