Presentation
Late Breaking Results: QUBO Approaches to Logic Equivalence Checking and Testing
DescriptionThis work presents a novel approach to formulate Logic Equivalence Checking (LEC) and Test Pattern Generation (TPG) problems as Quadratic Unconstrained Binary Optimization (QUBO) formulations, allowing them to be solved with quantum algorithms such as Quantum Annealing and Quantum Approximate Optimization Algorithm. We propose an advanced QUBO formulation approach that significantly re- duces the qubit, quantum gate and quantum circuit depth requirements, thereby improving the scalability and efficiency of quantum algorithms. To the best of our knowledge, this is the first work that formulates LEC and TPG problems in the QUBO. This work opens up new possibilities for leveraging quantum computing in the domains of verification and testing.
Event Type
Late Breaking Results
TimeMonday, July 275:38pm - 5:42pm PDT
LocationExhibit Hall