QCEDA: Using Quantum Computers for EDA

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Jung, Matthias, Krumke, Sven O., Schroth, Christof, Lobe, Elisabeth, Mauerer, Wolfgang
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912344477532160
author Jung, Matthias
Krumke, Sven O.
Schroth, Christof
Lobe, Elisabeth
Mauerer, Wolfgang
author_facet Jung, Matthias
Krumke, Sven O.
Schroth, Christof
Lobe, Elisabeth
Mauerer, Wolfgang
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2403_12998
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle QCEDA: Using Quantum Computers for EDA
Jung, Matthias
Krumke, Sven O.
Schroth, Christof
Lobe, Elisabeth
Mauerer, Wolfgang
Quantum Physics
Emerging Technologies
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.
title QCEDA: Using Quantum Computers for EDA
topic Quantum Physics
Emerging Technologies
url https://arxiv.org/abs/2403.12998