Feasibility and Potential of Quantum Computing For a Typical EDA Optimization Problem


A new technical paper titled “QCEDA: Using Quantum Computers for EDA” was published by researchers at Fraunhofer IESE, RPTU Kaiserslautern, DLR (Germany), and OTH Regensburg.

“The field of Electronic Design Automation (EDA) is crucial for microelectronics, but the increasing complexity of Integrated Circuits (ICs) poses challenges for conventional EDA: Corresponding problems are often NP-hard and are therefore in general solved by heuristics, not guaranteeing optimal solutions. Quantum computers may offer better solutions due to their potential for optimization through entanglement, superposition, and interference. Most of the works in the area of EDA and quantum computers focus on how to use EDA for building quantum circuits. However, almost no research focuses on exploiting quantum computers for solving EDA problems. Therefore, this paper investigates the feasibility and potential of quantum computing for a typical EDA optimization problem broken down to the Min-k-Union problem. The problem is mathematically transformed into a Quadratic Unconstrained Binary Optimization (QUBO) problem, which was successfully solved on an IBM quantum computer and a D-Wave quantum annealer.”

Find the technical paper here. Published March 2024.

Jung, Matthias, Sven O. Krumke, Christof Schroth, Elisabeth Lobe, and Wolfgang Mauerer. “QCEDA: Using Quantum Computers for EDA.” arXiv preprint arXiv:2403.12998 (2024).

Leave a Reply

(Note: This name will be displayed publicly)